Home
last modified time | relevance | path

Searched refs:keys (Results 1 – 25 of 146) sorted by relevance

123456

/rocksdb-6.9/table/
Dsst_file_reader_test.cc63 ASSERT_OK(writer.Put(keys[i], keys[i])); in CreateFile()
100 CreateFile(sst_name_, keys); in CreateFileAndCheck()
101 CheckFile(sst_name_, keys); in CreateFileAndCheck()
115 std::vector<std::string> keys; in TEST_F() local
117 keys.emplace_back(EncodeAsString(i)); in TEST_F()
119 CreateFileAndCheck(keys); in TEST_F()
124 std::vector<std::string> keys; in TEST_F() local
126 keys.emplace_back(EncodeAsUint64(i)); in TEST_F()
128 CreateFileAndCheck(keys); in TEST_F()
132 std::vector<std::string> keys; in TEST_F() local
[all …]
Dtable_test.cc178 keys->clear(); in Finish()
933 if (keys.empty()) { in TestRandomAccess()
978 if (keys.empty()) { in PickRandomKey()
1821 &keys, &kvmap); in TEST_P()
1859 &keys, &kvmap); in TEST_P()
1941 keys[0], keys[1], keys[2], keys[7], keys[9], in IndexTest()
1956 std::vector<std::string> upper_bound = {keys[1], keys[2], keys[7], keys[9], }; in IndexTest()
2136 ASSERT_EQ(1, keys.size()); in TEST_P()
2413 ASSERT_EQ(2, keys.size()); in TEST_P()
3492 &keys, &kvmap); in TEST_F()
[all …]
/rocksdb-6.9/table/block_based/
Dpartitioned_filter_block_test.cc87 int num_keys = sizeof(keys) / sizeof(*keys); in MaxIndexSize()
97 int num_keys = sizeof(keys) / sizeof(*keys); in MaxFilterSize()
205 builder->Add(keys[i]); in TestBlockPerKey()
206 CutABlock(pib.get(), keys[i], keys[i + 1]); in TestBlockPerKey()
208 builder->Add(keys[i]); in TestBlockPerKey()
209 CutABlock(pib.get(), keys[i], keys[i + 1]); in TestBlockPerKey()
211 builder->Add(keys[i]); in TestBlockPerKey()
212 builder->Add(keys[i]); in TestBlockPerKey()
213 CutABlock(pib.get(), keys[i], keys[i + 1]); in TestBlockPerKey()
230 CutABlock(pib.get(), keys[i], keys[i + 1]); in TestBlockPerTwoKeys()
[all …]
Dblock_test.cc79 std::vector<std::string> keys; in TEST_F() local
87 builder.Add(keys[i], values[i]); in TEST_F()
119 Slice k(keys[index]); in TEST_F()
167 regular_iter->Seek(keys[i]); in CheckBlockContents()
189 std::vector<std::string> keys; in TEST_F() local
205 std::vector<std::string> keys; in TEST_F() local
359 std::vector<std::string> keys; in TEST_F() local
420 Slice k(keys[i]); in TEST_F()
457 Slice k(keys[index]); in TEST_F()
517 std::set<std::string> keys; in GenerateRandomIndexEntries() local
[all …]
/rocksdb-6.9/java/src/test/java/org/rocksdb/
DRocksMemEnvTest.java22 final byte[][] keys = { in memEnvFillAndReopen()
43 for (int i = 0; i < keys.length; i++) { in memEnvFillAndReopen()
44 db.put(keys[i], values[i]); in memEnvFillAndReopen()
48 for (int i = 0; i < keys.length; i++) { in memEnvFillAndReopen()
55 for (int i = 0; i < keys.length; i++) { in memEnvFillAndReopen()
69 for (int i = 0; i < keys.length; i++) { in memEnvFillAndReopen()
80 for (int i = 0; i < keys.length; i++) { in memEnvFillAndReopen()
90 final byte[][] keys = { in multipleDatabaseInstances()
117 for (int i = 0; i < keys.length; i++) { in multipleDatabaseInstances()
118 db.put(keys[i], values[i]); in multipleDatabaseInstances()
[all …]
DAbstractTransactionTest.java209 final byte keys[][] = new byte[][] { in multiGetPut_cf()
224 txn.put(testCf, keys[0], values[0]); in multiGetPut_cf()
232 final byte keys[][] = new byte[][] { in multiGetPut()
245 txn.put(keys[0], values[0]); in multiGetPut()
246 txn.put(keys[1], values[1]); in multiGetPut()
280 final byte keys[][] = new byte[][] { in multiGetForUpdate_cf()
305 final byte keys[][] = new byte[][]{ in multiGetForUpdate()
317 txn.put(keys[0], values[0]); in multiGetForUpdate()
318 txn.put(keys[1], values[1]); in multiGetForUpdate()
500 final byte keys[][] = new byte[][] { in multiGetPutUntracked_cf()
[all …]
DOptimisticTransactionTest.java97 final byte keys[][] = new byte[][] { in multiGetForUpdate_cf_conflict()
111 txn.put(testCf, keys[0], values[0]); in multiGetForUpdate_cf_conflict()
112 txn.put(testCf, keys[1], values[1]); in multiGetForUpdate_cf_conflict()
123 txn2.put(testCf, keys[0], otherValue); in multiGetForUpdate_cf_conflict()
124 assertThat(txn2.get(testCf, readOptions, keys[0])) in multiGetForUpdate_cf_conflict()
144 final byte keys[][] = new byte[][] { in multiGetForUpdate_conflict()
155 txn.put(keys[0], values[0]); in multiGetForUpdate_conflict()
156 txn.put(keys[1], values[1]); in multiGetForUpdate_conflict()
163 assertThat(txn3.multiGetForUpdate(readOptions, keys)) in multiGetForUpdate_conflict()
167 txn2.put(keys[0], otherValue); in multiGetForUpdate_conflict()
[all …]
DTransactionTest.java89 final byte keys[][] = new byte[][] { in multiGetForUpdate_cf_conflict()
103 txn.put(testCf, keys[0], values[0]); in multiGetForUpdate_cf_conflict()
104 txn.put(testCf, keys[1], values[1]); in multiGetForUpdate_cf_conflict()
105 assertThat(txn.multiGet(readOptions, cfList, keys)).isEqualTo(values); in multiGetForUpdate_cf_conflict()
111 assertThat(txn3.multiGetForUpdate(readOptions, cfList, keys)) in multiGetForUpdate_cf_conflict()
131 final byte keys[][] = new byte[][] { in multiGetForUpdate_conflict()
142 txn.put(keys[0], values[0]); in multiGetForUpdate_conflict()
143 txn.put(keys[1], values[1]); in multiGetForUpdate_conflict()
144 assertThat(txn.multiGet(readOptions, keys)).isEqualTo(values); in multiGetForUpdate_conflict()
150 assertThat(txn3.multiGetForUpdate(readOptions, keys)) in multiGetForUpdate_conflict()
[all …]
/rocksdb-6.9/db/
Ddb_basic_test.cc857 keys.resize(2); in TEST_F()
858 keys[0] = "a"; in TEST_F()
859 keys[1] = "b"; in TEST_F()
1099 keys.clear(); in TEST_P()
1112 keys.clear(); in TEST_P()
1276 db_->MultiGet(ReadOptions(), handles_[1], keys.size(), keys.data(), in TEST_F()
1317 db_->MultiGet(ReadOptions(), handles_[1], keys.size(), keys.data(), in TEST_F()
1622 db_->MultiGet(ReadOptions(), handles_[1], keys.size(), keys.data(), in TEST_P()
2189 keys.resize(10); in TEST_P()
2211 keys.resize(10); in TEST_P()
[all …]
Dmerge_helper_test.cc67 ASSERT_EQ(test::KeyStr("a", 20, kTypeValue), merge_helper_->keys()[0]); in TEST_F()
69 ASSERT_EQ(1U, merge_helper_->keys().size()); in TEST_F()
84 ASSERT_EQ(test::KeyStr("a", 40, kTypeValue), merge_helper_->keys()[0]); in TEST_F()
86 ASSERT_EQ(1U, merge_helper_->keys().size()); in TEST_F()
102 ASSERT_EQ(test::KeyStr("a", 50, kTypeMerge), merge_helper_->keys()[0]); in TEST_F()
104 ASSERT_EQ(1U, merge_helper_->keys().size()); in TEST_F()
119 ASSERT_EQ(test::KeyStr("a", 40, kTypeMerge), merge_helper_->keys()[0]); in TEST_F()
123 ASSERT_EQ(2U, merge_helper_->keys().size()); in TEST_F()
137 ASSERT_EQ(1U, merge_helper_->keys().size()); in TEST_F()
152 ASSERT_EQ(1U, merge_helper_->keys().size()); in TEST_F()
[all …]
/rocksdb-6.9/table/cuckoo/
Dcuckoo_table_reader_test.cc78 keys.clear(); in SetUp()
79 keys.resize(num_items); in SetUp()
137 keys[i].clear(); in UpdateKeys()
181 it->Seek(keys[cnt]); in CheckIterator()
392 keys->clear(); in GetKeys()
401 keys->push_back(new_key); in GetKeys()
435 builder.Add(Slice(keys[key_idx]), Slice(&keys[key_idx][0], 4)); in WriteFile()
465 ASSERT_TRUE(Slice(keys[i]) == Slice(&keys[i][0], 4)); in WriteFile()
499 keys.reserve(num); in ReadKeys()
501 keys.push_back(2 * i); in ReadKeys()
[all …]
Dcuckoo_table_builder_test.cc48 for (const auto& key : keys) { in CheckFileContents()
101 ASSERT_EQ(props->num_entries, keys.size()); in CheckFileContents()
103 ASSERT_EQ(props->fixed_key_len, keys.empty() ? 0 : keys[0].size()); in CheckFileContents()
121 if (key_idx == keys.size()) { in CheckFileContents()
203 std::vector<std::string> keys; in TEST_F() local
253 std::vector<std::string> keys; in TEST_F() local
271 builder.Add(Slice(keys[i]), Slice(values[i])); in TEST_F()
302 std::vector<std::string> keys; in TEST_F() local
321 builder.Add(Slice(keys[i]), Slice(values[i])); in TEST_F()
357 std::vector<std::string> keys; in TEST_F() local
[all …]
/rocksdb-6.9/java/src/main/java/org/rocksdb/
DTransaction.java341 final byte[][] keys) throws RocksDBException { in multiGet() argument
345 if (keys.length != columnFamilyHandles.size()) { in multiGet()
349 if(keys.length == 0) { in multiGet()
358 keys, cfHandles); in multiGet()
389 if(keys.length == 0) { in multiGet()
394 keys); in multiGet()
550 if (keys.length != columnFamilyHandles.size()){ in multiGetForUpdate()
554 if(keys.length == 0) { in multiGetForUpdate()
562 keys, cfHandles); in multiGetForUpdate()
580 if(keys.length == 0) { in multiGetForUpdate()
[all …]
DAbstractMutableOptions.java12 protected final String[] keys; field in AbstractMutableOptions
21 protected AbstractMutableOptions(final String[] keys, final String[] values) { in AbstractMutableOptions() argument
22 this.keys = keys; in AbstractMutableOptions()
27 return keys; in getKeys()
43 for(int i = 0; i < keys.length; i++) { in toString()
45 .append(keys[i]) in toString()
49 if(i + 1 < keys.length) { in toString()
80 protected abstract T build(final String[] keys, final String[] values); in build() argument
83 final String keys[] = new String[options.size()]; in build() local
88 keys[i] = option.getKey().name(); in build()
[all …]
DRocksDB.java2020 assert(keys.size() != 0); in multiGet()
2070 assert(keys.size() != 0); in multiGet()
2119 assert(keys.size() != 0); in multiGet()
2170 assert(keys.size() != 0); in multiGet()
2217 assert(keys.size() != 0); in multiGetAsList()
2219 final byte[][] keysArray = keys.toArray(new byte[keys.size()][]); in multiGetAsList()
2253 assert(keys.size() != 0); in multiGetAsList()
2265 final byte[][] keysArray = keys.toArray(new byte[keys.size()][]); in multiGetAsList()
2290 assert(keys.size() != 0); in multiGetAsList()
2292 final byte[][] keysArray = keys.toArray(new byte[keys.size()][]); in multiGetAsList()
[all …]
/rocksdb-6.9/tools/advisor/advisor/
Drules.ini123 keys=dyno.flash_write_bytes_per_sec key
130 keys=[]rocksdb.read.block.get.micros.p99 key
137 keys=[]rocksdb.db.get.micros.p50:[]rocksdb.db.get.micros.p99 key
139 evaluate=(keys[1]/keys[0])>5
162 keys=[]rocksdb.bloom.filter.useful.count:[]rocksdb.bloom.filter.full.positive.count:[]rocksdb.bloom… key
164 evaluate=((keys[0]+keys[2])/(keys[0]+keys[1]))<0.9 # should evaluate to a boolean
173 keys=[]rocksdb.bloom.filter.useful.count:[]rocksdb.bloom.filter.full.positive.count:[]rocksdb.bloom… key
175 evaluate=keys[0]+keys[1]+keys[2]==0
198 keys=block_decompress_time:block_read_time:block_checksum_time key
200 evaluate=(keys[0]/(keys[0]+keys[1]+keys[2]))>0.3
Ddb_timeseries_parser.py74 timestamps = sorted(list(self.keys_ts[entity][statistic].keys()))
103 latest_timestamp = max(list(self.keys_ts[entity][stat].keys()))
106 oldest_timestamp = min(list(self.keys_ts[entity][stat].keys()))
177 keys = [result[key] for key in statistics]
180 trigger[entity] = keys
192 for epoch in self.keys_ts[entity][statistics[0]].keys():
193 keys = [
201 trigger[entity][epoch] = keys
/rocksdb-6.9/utilities/option_change_migration/
Doption_change_migration_test.cc75 std::set<std::string> keys; in TEST_P() local
80 keys.insert(it->key().ToString()); in TEST_P()
106 for (std::string key : keys) { in TEST_P()
143 std::set<std::string> keys; in TEST_P() local
174 for (std::string key : keys) { in TEST_P()
218 std::set<std::string> keys; in TEST_P() local
249 for (std::string key : keys) { in TEST_P()
292 std::set<std::string> keys; in TEST_P() local
323 for (std::string key : keys) { in TEST_P()
382 std::set<std::string> keys; in TEST_F() local
[all …]
/rocksdb-6.9/db_stress_tool/
Dbatched_ops_stress.cc39 keys[i] += key_str; in TestPut()
43 batch.Merge(cfh, keys[i], value_slices[i]); in TestPut()
45 batch.Put(cfh, keys[i], value_slices[i]); in TestPut()
74 keys[i] += key_str; in TestDelete()
75 batch.Delete(cfh, keys[i]); in TestDelete()
131 keys[i] += key.ToString(); in TestGet()
132 key_slices[i] = keys[i]; in TestGet()
146 char expected_prefix = (keys[i])[0]; in TestGet()
178 std::array<std::string, 10> keys = {{"0", "1", "2", "3", "4", in TestMultiGet() local
180 size_t num_prefixes = keys.size(); in TestMultiGet()
[all …]
/rocksdb-6.9/util/
Dvector_iterator.h18 VectorIterator(std::vector<std::string> keys, std::vector<std::string> values, in VectorIterator() argument
20 : keys_(std::move(keys)), in VectorIterator()
76 : cmp(c), keys(ks) {} in IndexedKeyComparator()
79 return cmp->Compare((*keys)[a], (*keys)[b]) < 0; in operator()
83 return cmp->Compare((*keys)[a], b) < 0; in operator()
87 return cmp->Compare(a, (*keys)[b]) < 0; in operator()
91 const std::vector<std::string>* keys; member
/rocksdb-6.9/memtable/
Dskiplist_test.cc58 std::set<Key> keys; in TEST_F() local
64 if (keys.insert(key).second) { in TEST_F()
71 ASSERT_EQ(keys.count(i), 1U); in TEST_F()
73 ASSERT_EQ(keys.count(i), 0U); in TEST_F()
84 ASSERT_EQ(*(keys.begin()), iter.key()); in TEST_F()
88 ASSERT_EQ(*(keys.rbegin()), iter.key()); in TEST_F()
92 ASSERT_EQ(*(keys.begin()), iter.key()); in TEST_F()
96 ASSERT_EQ(*(keys.rbegin()), iter.key()); in TEST_F()
105 std::set<Key>::iterator model_iter = keys.lower_bound(i); in TEST_F()
107 if (model_iter == keys.end()) { in TEST_F()
[all …]
/rocksdb-6.9/utilities/transactions/
Dwrite_unprepared_transaction_test.cc163 std::vector<std::string> keys; in TEST_P() local
165 keys.push_back("k" + ToString(k)); in TEST_P()
167 std::shuffle(keys.begin(), keys.end(), rand); in TEST_P()
185 std::set<std::string> owned_keys(keys.begin() + id * kNumKeys, in TEST_P()
190 owned_keys.insert(keys[rnd.Uniform(kNumKeys * kNumThreads)]); in TEST_P()
264 for (const auto& key : keys) { in TEST_P()
574 int keys = 0; in TEST_P() local
575 for (iter->SeekToLast(); iter->Valid(); iter->Prev(), keys++) { in TEST_P()
579 ASSERT_EQ(keys, 3); in TEST_P()
628 int keys = 0; in TEST_P() local
[all …]
/rocksdb-6.9/docs/_posts/
D2018-11-21-delete-range.markdown13 Deleting a range of keys is a common pattern in RocksDB. Most systems built on top of
14 RocksDB have multi-component key schemas, where keys sharing a common prefix are
19 a table or index involves deleting all the keys with that prefix.
26 and it stores various data associated with the product in separate keys. When a
27 product is removed, all these keys must be deleted.
42 Another common pattern is using a custom compaction filter that drops keys in
63 of keys would be (1) simple, i.e., a single API call; (2) synchronous, i.e.,
129 find it for arbitrary keys that it covers.
134 *Lifetime of point keys and range tombstones in RocksDB*
187 between consecutive point keys).
[all …]
/rocksdb-6.9/java/jmh/src/main/java/org/rocksdb/util/
DKVUtils.java51 public static List<byte[]> keys(final int from, final int to) { in keys() method in KVUtils
52 final List<byte[]> keys = new ArrayList<>(to - from); in keys() local
54 keys.add(ba("key" + i)); in keys()
56 return keys; in keys()
/rocksdb-6.9/java/src/test/java/org/rocksdb/util/
DJNIComparatorTest.java125 final int[] keys = new int[MAX - MIN]; in readAllWithJavaComparator() local
132 keys[idx++] = thisKey; in readAllWithJavaComparator()
139 return keys; in readAllWithJavaComparator()
156 final int[] keys = new int[MAX - MIN]; in readAllWithCppComparator() local
163 keys[idx++] = thisKey; in readAllWithCppComparator()
170 return keys; in readAllWithCppComparator()

123456