| /rocksdb-6.9/memtable/ |
| D | vectorrep.cc | 52 const KeyComparator& compare_; member in ROCKSDB_NAMESPACE::__anonfd4f76000111::VectorRep::Iterator
106 const KeyComparator& compare_; member in ROCKSDB_NAMESPACE::__anonfd4f76000111::VectorRep
142 compare_(compare) { in VectorRep()
152 compare_(compare), in Iterator()
160 std::sort(bucket_->begin(), bucket_->end(), Compare(compare_)); in DoSort()
167 std::sort(bucket_->begin(), bucket_->end(), Compare(compare_)); in DoSort()
223 return compare_(a, b) < 0; in Seek()
279 return new Iterator(this, bucket_, compare_); in GetIterator()
281 return new (mem) Iterator(this, bucket_, compare_); in GetIterator()
287 return new Iterator(nullptr, tmp, compare_); in GetIterator()
[all …]
|
| D | inlineskiplist.h | 201 Comparator const compare_; variable
222 return (compare_(a, b) == 0); in Equal()
226 return (compare_(a, b) < 0); in LessThan()
449 return (n != nullptr) && (compare_(n->Key(), key) < 0);
457 return (n != nullptr) && (compare_(n->Key(), key) < 0);
471 const DecodedKey key_decoded = compare_.decode_key(key);
483 : compare_(next->Key(), key_decoded);
513 const DecodedKey key_decoded = compare_.decode_key(key);
598 compare_(cmp),
928 compare_(key, splice->next_[i]->Key()) < 0);
[all …]
|
| D | skiplist.h | 121 Comparator const compare_; variable
143 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal()
145 return (compare_(a, b) < 0); in LessThan()
297 return (n != nullptr) && (compare_(n->key, key) < 0);
319 ? 1 : compare_(next->key, key);
390 assert(x == head_ || compare_(x->key, key) < 0);
392 if (next == nullptr || compare_(next->key, key) >= 0) {
414 compare_(cmp),
|
| D | hash_linklist_rep.cc | 203 const MemTableRep::KeyComparator& compare_; member in ROCKSDB_NAMESPACE::__anoncfd1c5190111::HashLinkListRep
233 return (compare_(b, a) == 0); in Equal()
236 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal()
240 return (n != nullptr) && (compare_(n->key, internal_key) < 0); in KeyIsAfterNode()
245 return (n != nullptr) && (compare_(n->key, key) < 0); in KeyIsAfterNode()
250 return (n != nullptr) && (compare_(n->key, internal_key) <= 0); in KeyIsAfterOrAtNode()
255 return (n != nullptr) && (compare_(n->key, key) <= 0); in KeyIsAfterOrAtNode()
505 compare_(compare), in HashLinkListRep()
635 SkipListBucketHeader(compare_, allocator_, header->GetNumEntries() + 1); in Insert()
743 auto list = new MemtableSkipList(compare_, new_arena); in GetIterator()
|
| D | stl_wrappers.h | 20 const MemTableRep::KeyComparator& compare_;
22 : compare_(compare) {} in Base()
28 return compare_(a, b) < 0; in operator()
|
| D | hash_skiplist_rep.cc | 63 const MemTableRep::KeyComparator& compare_; member in ROCKSDB_NAMESPACE::__anon252bdc020111::HashSkipListRep
241 compare_(compare), in HashSkipListRep()
261 bucket = new (addr) Bucket(compare_, allocator_, skiplist_height_, in GetInitializedBucket()
305 auto list = new Bucket(compare_, new_arena); in GetIterator()
|
| /rocksdb-6.9/db/ |
| D | c.cc | 259 int (*compare_)( member
268 return (*compare_)(state_, a.data(), a.size(), b.data(), b.size()); in Compare()
3028 result->compare_ = compare; in rocksdb_comparator_create()
|