Home
last modified time | relevance | path

Searched refs:Key (Results 1 – 25 of 58) sorted by relevance

123

/rocksdb-6.9/memtable/
Dskiplist.h143 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal()
144 bool LessThan(const Key& a, const Key& b) const { in LessThan()
171 Key const key;
205 SkipList<Key, Comparator>::NewNode(const Key& key, int height) {
228 inline const Key& SkipList<Key, Comparator>::Iterator::key() const {
251 inline void SkipList<Key, Comparator>::Iterator::Seek(const Key& target) {
301 typename SkipList<Key, Comparator>::Node* SkipList<Key, Comparator>::
335 SkipList<Key, Comparator>::FindLessThan(const Key& key, Node** prev) const {
384 uint64_t SkipList<Key, Comparator>::EstimateCount(const Key& key) const {
435 void SkipList<Key, Comparator>::Insert(const Key& key) {
[all …]
Dinlineskiplist_test.cc22 typedef uint64_t Key; typedef
29 Key rv; in Decode()
35 typedef Key DecodedType;
90 Key zero = 0; in Validate()
103 std::set<Key> keys_;
110 Key key = 10; in TEST_F()
130 std::set<Key> keys; in TEST_F()
222 Key key = i; in TEST_F()
236 Key last_key[S]; in TEST_F()
277 Key with_hint[S1]; in TEST_F()
[all …]
Dskiplist_test.cc20 typedef uint64_t Key; typedef
23 int operator()(const Key& a, const Key& b) const { in operator ()()
58 std::set<Key> keys; in TEST_F()
63 Key key = rnd.Next() % R; in TEST_F()
183 static bool IsValidKey(Key k) { in IsValidKey()
187 static Key RandomTarget(Random* rnd) { in RandomTarget()
223 SkipList<Key, TestComparator> list_;
232 const Key new_key = MakeKey(k, g); in WriteStep()
244 Key pos = RandomTarget(rnd); in ReadStep()
248 Key current; in ReadStep()
[all …]
Dinlineskiplist.h378 return node_->Key();
859 compare_(x->Key(), splice->next_[i]->Key()) >= 0)) {
864 compare_(splice->prev_[i]->Key(), x->Key()) >= 0)) {
869 compare_(x->Key(), splice->next_[i]->Key()) < 0);
871 compare_(splice->prev_[i]->Key(), x->Key()) < 0);
902 compare_(x->Key(), splice->next_[i]->Key()) >= 0)) {
907 compare_(splice->prev_[i]->Key(), x->Key()) >= 0)) {
912 compare_(x->Key(), splice->next_[i]->Key()) < 0);
914 compare_(splice->prev_[i]->Key(), x->Key()) < 0);
933 compare_(splice->prev_[i + 1]->Key(), splice->prev_[i]->Key()) <
[all …]
/rocksdb-6.9/db/
Dimport_column_family_test.cc143 sfw_cf1.Put(Key(i), Key(i) + "_val"); in TEST_F()
152 sfw_cf1.Put(Key(i), Key(i) + "_overwrite1"); in TEST_F()
161 sfw_cf1.Put(Key(i), Key(i) + "_overwrite2"); in TEST_F()
170 sfw_cf1.Put(Key(i), Key(i) + "_overwrite2"); in TEST_F()
179 sfw_cf1.Put(Key(i), Key(i) + "_overwrite3"); in TEST_F()
274 Put(1, Key(i), Key(i) + "_val"); in TEST_F()
283 Put(1, Key(i), Key(i) + "_overwrite"); in TEST_F()
289 Put(1, Key(i), Key(i) + "_overwrite2"); in TEST_F()
382 Put(1, Key(i), Key(i) + "_val"); in TEST_F()
392 Put(1, Key(i), Key(i) + "_overwrite"); in TEST_F()
[all …]
Dexternal_sst_file_test.cc1262 true_data[Key(3)] = Key(3) + "put"; in TEST_P()
1263 true_data[Key(8)] = Key(8) + "put"; in TEST_P()
1308 ASSERT_OK(Put(Key(k), Key(k))); in TEST_F()
1315 ASSERT_OK(Put(Key(k), Key(k))); in TEST_F()
1391 ASSERT_OK(Put(Key(1), Key(1))); in TEST_F()
1392 ASSERT_OK(Put(Key(9), Key(9))); in TEST_F()
1395 ASSERT_OK(Put(Key(1), Key(1))); in TEST_F()
1396 ASSERT_OK(Put(Key(9), Key(9))); in TEST_F()
1496 true_data[Key(k)] = Key(k) + "put"; in TEST_F()
1500 true_data[Key(k)] = Key(k) + "put"; in TEST_F()
[all …]
Derror_handler_fs_test.cc167 Put(Key(0), "val"); in TEST_F()
202 Put(Key(1), "val1"); in TEST_F()
216 Put(Key(2), "val2"); in TEST_F()
265 Put(Key(0), "val"); in TEST_F()
267 Put(Key(1), "val"); in TEST_F()
311 Put(Key(0), "val"); in TEST_F()
313 Put(Key(1), "val"); in TEST_F()
353 Put(Key(0), "val"); in TEST_F()
355 Put(Key(1), "val"); in TEST_F()
403 Put(Key(0), "val"); in TEST_F()
[all …]
Dexternal_sst_file_basic_test.cc161 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F()
180 s = sst_file_writer.DeleteRange(Key(100), Key(200)); in TEST_F()
189 ASSERT_EQ(Get(Key(k)), Key(k) + "_val"); in TEST_F()
205 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F()
219 ASSERT_OK(sst_file_writer.Put(Key(k), Key(k) + "_val")); in TEST_F()
257 ASSERT_EQ(Get(Key(k)), Key(k) + "_val"); in TEST_F()
674 ASSERT_OK(sst_file_writer->Put(Key(i), Key(i))); in TEST_F()
685 ASSERT_OK(sst_file_writer->Put(Key(i), Key(i))); in TEST_F()
813 ASSERT_OK(sst_file_writer.DeleteRange(Key(0), Key(30))); in TEST_F()
935 ASSERT_OK(sst_file_writer.DeleteRange(Key(300), Key(400))); in TEST_F()
[all …]
Ddb_compaction_test.cc303 db_size[0] = Size(Key(0), Key(kTestSize - 1)); in TEST_P()
310 db_size[1] = Size(Key(0), Key(kTestSize - 1)); in TEST_P()
469 ASSERT_OK(Put(Key(k), Key(k))); in TEST_F()
483 ASSERT_EQ(Key(k), Get(Key(k))); in TEST_F()
510 ASSERT_EQ(Key(1), Get(Key(1))); in TEST_F()
532 ASSERT_EQ(Key(1), Get(Key(1))); in TEST_F()
563 db_size[0] = Size(Key(0), Key(kTestSize - 1)); in TEST_P()
574 db_size[1] = Size(Key(0), Key(kTestSize - 1)); in TEST_P()
590 db_size[2] = Size(Key(0), Key(kTestSize - 1)); in TEST_P()
681 db_size[0] = Size(Key(0), Key(kTestSize - 1)); in TEST_F()
[all …]
Ddb_dynamic_level_test.cc37 ASSERT_NE("NOT_FOUND", Get(Key(i))); in TEST_F()
38 ASSERT_NE("NOT_FOUND", Get(Key(kNKeys * 2 + i))); in TEST_F()
86 ASSERT_OK(Delete(Key(kNKeys + keys[i / 10]))); in TEST_F()
387 ASSERT_OK(Put(Key(i), value)); in TEST_F()
396 std::string value = Get(Key(i)); in TEST_F()
427 ASSERT_NE("NOT_FOUND", Get(Key(kMaxKey + i))); in TEST_F()
429 ASSERT_EQ("NOT_FOUND", Get(Key(i))); in TEST_F()
431 ASSERT_NE("NOT_FOUND", Get(Key(i))); in TEST_F()
444 ASSERT_OK(Put(Key(i), RandomString(&rnd, 102))); in TEST_F()
446 ASSERT_OK(Delete(Key(i / 10))); in TEST_F()
[all …]
Ddb_universal_compaction_test.cc693 ASSERT_OK(Put(1, Key(i % num_keys), Key(i))); in TEST_P()
699 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
738 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
804 ASSERT_OK(Put(1, Key(i % num_keys), Key(i))); in TEST_P()
813 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
819 ASSERT_EQ(Get(1, Key(i % num_keys)), Key(i)); in TEST_P()
1195 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
1241 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
1944 Delete(Key(i)); in TEST_F()
2053 Delete(Key(i)); in TEST_F()
[all …]
Ddb_range_del_test.cc105 db_->DeleteRange(WriteOptions(), db_->DefaultColumnFamily(), Key(0), Key(1)); in TEST_F()
361 Key(mid - 5), Key(mid + 5)); in TEST_F()
421 Key(mid - 5), Key(mid + 5)); in TEST_F()
1002 auto begin_str = Key(0), end_str = Key(1); in TEST_F()
1044 Key(0), Key(2 * kNumFilesPerLevel)); in TEST_F()
1081 auto begin_str = Key(3); in TEST_F()
1100 auto begin_str = Key(0); in TEST_F()
1273 key = Key(0); in TEST_F()
1286 Key(0), Key(kMaxKey + 1))); in TEST_F()
1383 Key(0), Key(kNumKeys + 1))); in TEST_F()
[all …]
Ddb_bloom_filter_test.cc458 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
462 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_P()
472 ASSERT_EQ(Key(i), Get(1, Key(i))); in TEST_P()
540 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_F()
548 ASSERT_EQ(Key(i), Get(1, Key(i))); in TEST_F()
576 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_F()
588 ASSERT_EQ(Key(i), Get(1, Key(i))); in TEST_F()
602 ASSERT_EQ(Key(i), Get(1, Key(i))); in TEST_F()
626 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_F()
700 ASSERT_OK(Put(1, Key(i), Key(i))); in TEST_F()
[all …]
Ddb_test.cc1391 end = Key(600); in TEST_F()
1401 end = Key(600); in TEST_F()
1407 end = Key(1020); in TEST_F()
1431 end = Key(300); in TEST_F()
1437 end = Key(1080); in TEST_F()
1443 end = Key(2300); in TEST_F()
1449 end = Key(1080); in TEST_F()
1465 end = Key(1080); in TEST_F()
1480 start = Key(1); in TEST_F()
1569 end = Key(600); in TEST_F()
[all …]
Ddb_wal_test.cc736 ASSERT_OK(Put(2, Key(1), DummyString(1))); in TEST_F()
746 ASSERT_OK(Put(1, Key(1), DummyString(1))); in TEST_F()
747 ASSERT_OK(Put(1, Key(1), DummyString(1))); in TEST_F()
784 ASSERT_OK(Put(0, Key(1), DummyString(1))); in TEST_F()
785 ASSERT_OK(Put(1, Key(1), DummyString(1))); in TEST_F()
786 ASSERT_OK(Put(2, Key(1), DummyString(1))); in TEST_F()
790 ASSERT_OK(Put(3, Key(1), DummyString(1))); in TEST_F()
803 ASSERT_OK(Put(0, Key(1), DummyString(1))); in TEST_F()
804 ASSERT_OK(Put(1, Key(1), DummyString(1))); in TEST_F()
805 ASSERT_OK(Put(2, Key(1), DummyString(1))); in TEST_F()
[all …]
Ddb_sst_test.cc109 values.push_back(Get(Key(k))); in TEST_F()
130 ASSERT_EQ(values[k], Get(Key(k))); in TEST_F()
769 ASSERT_OK(Put(Key(i), RandomString(&rnd, 50))); in TEST_F()
994 std::string k = "L2_" + Key(i); in TEST_F()
1005 std::string k = "L0_" + Key(i); in TEST_F()
1024 ASSERT_EQ(Get("L0_" + Key(i)), "L0_" + Key(i) + std::string(1000, 'a')); in TEST_F()
1025 ASSERT_EQ(Get("L2_" + Key(i)), "L2_" + Key(i) + std::string(1000, 'a')); in TEST_F()
1048 ASSERT_OK(Put(Key(j), val)); in TEST_F()
1100 ASSERT_OK(Delete(Key(i))); in TEST_F()
1141 ASSERT_OK(Put(Key(i), "val")); in TEST_F()
[all …]
Ddb_test2.cc2209 std::string key = Key(i); in TEST_F()
2237 std::string key = Key(i); in TEST_F()
2274 ASSERT_OK(Put(Key(0), "a")); in TEST_F()
2275 ASSERT_OK(Put(Key(5), "a")); in TEST_F()
2278 ASSERT_OK(Put(Key(10), "a")); in TEST_F()
2349 ASSERT_OK(Put(Key(0), "a")); in TEST_F()
2350 ASSERT_OK(Put(Key(5), "a")); in TEST_F()
2363 std::string k1 = Key(6); in TEST_F()
2364 std::string k2 = Key(9); in TEST_F()
2725 ASSERT_OK(Put(Key(0), "a")); in TEST_F()
[all …]
Ddb_merge_operator_test.cc242 std::string key = Key(key_id % 35); in TEST_P()
329 std::string k = Key(j); in TEST_P()
386 db_->Merge(WriteOptions(), Key(k), Key(k)); in TEST_P()
410 iter->Seek(Key(i)); in TEST_P()
412 ASSERT_EQ(iter->key(), Key(i)); in TEST_P()
413 ASSERT_EQ(iter->value(), Key(i)); in TEST_P()
622 std::string key = Key(rnd.Next() % kKeyRange); in TEST_P()
631 std::string key = Key(rnd.Next() % kKeyRange); in TEST_P()
642 std::string key = Key(rnd.Next() % kKeyRange); in TEST_P()
651 std::string key = Key(rnd.Next() % kKeyRange); in TEST_P()
Dforward_iterator_bench.cc59 struct Key { struct
60 Key() {} in Key() function
61 Key(uint64_t shard_in, uint64_t seqno_in) in Key() function
84 Key upper_bound; argument
124 state.upper_bound = Key(shard, std::numeric_limits<uint64_t>::max()); in readOnceFromShard()
150 Key from(shard, state.last_read.load() + 1); in readOnceFromShard()
161 assert(it->key().size() == sizeof(Key)); in readOnceFromShard()
162 Key key; in readOnceFromShard()
244 Key key(shard, seqno); in run()
Ddb_table_properties_test.cc267 Put(Key(0), "val"); in TEST_F()
274 Delete(Key(i)); in TEST_F()
276 Put(Key(i), "val"); in TEST_F()
296 Delete(Key(i)); in TEST_F()
298 Put(Key(i), "val"); in TEST_F()
316 Delete(Key(i)); in TEST_F()
318 Put(Key(i), "val"); in TEST_F()
/rocksdb-6.9/util/
Dbloom_test.cc157 Add(Key(i, buffer)); in TEST_F()
193 Add(Key(key, buffer)); in TEST_F()
200 Add(Key(key, buffer)); in TEST_F()
207 Add(Key(key, buffer)); in TEST_F()
214 Add(Key(key, buffer)); in TEST_F()
221 Add(Key(key, buffer)); in TEST_F()
228 Add(Key(key, buffer)); in TEST_F()
237 Add(Key(key, buffer)); in TEST_F()
244 Add(Key(key, buffer)); in TEST_F()
470 Add(Key(i, buffer)); in TEST_P()
[all …]
/rocksdb-6.9/third-party/folly/folly/synchronization/
DParkingLot.h175 template <typename Key, typename D, typename ToPark, typename PreWait>
186 typename Key,
193 const Key key,
200 typename Key,
207 const Key key, in park_for()
231 template <typename Key, typename Unparker>
232 void unpark(const Key key, Unparker&& func);
237 typename Key,
244 const Key bits, in park_until()
285 template <typename Key, typename Func>
[all …]
/rocksdb-6.9/db/compaction/
Dcompaction_job_stats_test.cc72 std::string Key(uint64_t key, int length) { in Key() function
358 ASSERT_OK(Put(cf, Slice(Key(key, key_size)), in MakeTableWithKeyValues()
382 ASSERT_OK(Delete(cf, Key(key, key_size))); in SelectivelyDeleteKeys()
394 ASSERT_OK(Delete(cf, Key(smallest+1, key_size))); in SelectivelyDeleteKeys()
397 ASSERT_OK(Delete(cf, Key(smallest-1, key_size))); in SelectivelyDeleteKeys()
401 ASSERT_OK(Delete(cf, Key(smallest-9, key_size))); in SelectivelyDeleteKeys()
687 smallest_key = Key(start_key, 10); in TEST_P()
745 smallest_key = Key(start_key, 10); in TEST_P()
769 smallest_key = Key(key_base, 10); in TEST_P()
795 ASSERT_OK(Put(1, Slice(Key(key_base + i, 10)), in TEST_P()
[all …]
/rocksdb-6.9/db_stress_tool/
Dno_batched_ops_stress.cc39 std::string seek_key = Key(start); in VerifyDb()
49 std::string keystr = Key(i); in VerifyDb()
89 std::string keystr = Key(i); in VerifyDb()
144 std::string key_str = Key(rand_keys[0]); in TestGet()
193 key_str.emplace_back(Key(rand_keys[i])); in TestMultiGet()
267 std::string key_str = Key(rand_keys[0]); in TestPrefixScan()
320 std::string key_str = Key(rand_key); in TestPut()
325 std::string key_str2 = Key(rand_key); in TestPut()
402 std::string key_str = Key(rand_key); in TestDelete()
490 std::string keystr = Key(rand_key); in TestDeleteRange()
[all …]
/rocksdb-6.9/examples/
Dmulti_processes_example.cc74 static std::string Key(uint64_t k) { in Key() function
101 static uint64_t Key(std::string key) { in Key() function
212 Slice key = Key(curr_key + static_cast<uint64_t>(i)); in RunPrimary()
300 Slice key = Key(std::rand() % kMaxKey); in RunSecondary()
325 uint64_t curr_max_key = Key(iter->key().ToString()); in RunSecondary()
361 Key(iter->key().ToString()), Key(iter1->key().ToString())); in RunSecondary()

123