| /leveldb-1.20/db/ |
| H A D | skiplist.h | 120 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal()
150 Key const key;
184 SkipList<Key,Comparator>::NewNode(const Key& key, int height) {
202 inline const Key& SkipList<Key,Comparator>::Iterator::key() const {
225 inline void SkipList<Key,Comparator>::Iterator::Seek(const Key& target) {
256 bool SkipList<Key,Comparator>::KeyIsAfterNode(const Key& key, Node* n) const {
262 typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindGreaterOrEqual(const Key& ke…
285 SkipList<Key,Comparator>::FindLessThan(const Key& key) const {
305 typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindLast()
337 void SkipList<Key,Comparator>::Insert(const Key& key) {
[all …]
|
| H A D | autocompact_test.cc | 36 std::string Key(int i) { in Key() function in leveldb::AutoCompactTest
64 ASSERT_OK(db_->Put(WriteOptions(), Key(i), value)); in DoReads()
70 ASSERT_OK(db_->Delete(WriteOptions(), Key(i))); in DoReads()
75 const int64_t initial_size = Size(Key(0), Key(n)); in DoReads()
76 const int64_t initial_other_size = Size(Key(n), Key(kCount)); in DoReads()
79 std::string limit_key = Key(n); in DoReads()
91 uint64_t size = Size(Key(0), Key(n)); in DoReads()
93 read+1, size/1048576.0, Size(Key(n), Key(kCount))/1048576.0); in DoReads()
101 const int64_t final_other_size = Size(Key(n), Key(kCount)); in DoReads()
|
| H A D | skiplist_test.cc | 15 typedef uint64_t Key; typedef
18 int operator()(const Key& a, const Key& b) const { in operator ()()
34 SkipList<Key, Comparator> list(cmp, &arena); in TEST()
51 std::set<Key> keys; in TEST()
56 Key key = rnd.Next() % R; in TEST()
169 static bool IsValidKey(Key k) { in IsValidKey()
173 static Key RandomTarget(Random* rnd) { in RandomTarget()
211 SkipList<Key, Comparator> list_;
220 const Key key = MakeKey(k, g); in WriteStep()
232 Key pos = RandomTarget(rnd); in ReadStep()
[all …]
|
| H A D | db_test.cc | 924 static std::string Key(int i) { in Key() function
939 ASSERT_OK(Put(Key(i), Key(i) + std::string(1000, 'v'))); in TEST()
945 ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i))); in TEST()
951 ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i))); in TEST()
1115 ASSERT_TRUE(Between(Size(Key(i), Key(i+10)), S1*10, S2*10)); in TEST()
1143 ASSERT_OK(Put(Key(2), big1)); in TEST()
1169 ASSERT_TRUE(Between(Size(Key(3), Key(5)), 110000, 111000)); in TEST()
1185 ASSERT_OK(Put(Key(i), Key(i) + std::string(100000, 'v'))); // 100K values in TEST()
1722 ASSERT_OK(Put(Key(i), Key(i))); in TEST()
1726 ASSERT_OK(Put(Key(i), Key(i))); in TEST()
[all …]
|
| H A D | corruption_test.cc | 75 Slice key = Key(i, &key_space); in Build()
188 Slice Key(int i, std::string* storage) { in Key() function in leveldb::CorruptionTest
350 Status s = db_->Put(WriteOptions(), Key(5, &tmp1), Value(5, &tmp2)); in TEST()
361 ASSERT_OK(db_->Put(WriteOptions(), Key(1000, &tmp1), Value(1000, &tmp2))); in TEST()
363 ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v)); in TEST()
366 ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v)); in TEST()
|
| H A D | fault_injection_test.cc | 398 Slice key = Key(i, &key_space); in Build()
408 Slice key = Key(i, &key_space); in ReadValue()
437 Slice Key(int i, std::string* storage) const { in Key() function in leveldb::FaultInjectionTest
|
| /leveldb-1.20/util/ |
| H A D | bloom_test.cc | 16 static Slice Key(int i, char* buffer) { in Key() function
81 if (Matches(Key(i + 1000000000, buffer))) { in FalsePositiveRate()
126 Add(Key(i, buffer)); in TEST()
135 ASSERT_TRUE(Matches(Key(i, buffer))) in TEST()
|
| /leveldb-1.20/doc/ |
| H A D | index.md | 374 ### Key Layout
|