Home
last modified time | relevance | path

Searched refs:KeyIsAfterNode (Results 1 – 3 of 3) sorted by relevance

/rocksdb-6.9/memtable/
Dskiplist.h149 bool KeyIsAfterNode(const Key& key, Node* n) const;
295 bool SkipList<Key, Comparator>::KeyIsAfterNode(const Key& key, Node* n) const {
315 assert(x == head_ || next == nullptr || KeyIsAfterNode(next->key, x));
317 assert(x == head_ || KeyIsAfterNode(key, x));
343 assert(x == head_ || next == nullptr || KeyIsAfterNode(next->key, x));
344 assert(x == head_ || KeyIsAfterNode(key, x));
345 if (next != last_not_after && KeyIsAfterNode(key, next)) {
437 if (!KeyIsAfterNode(key, prev_[0]->NoBarrier_Next(0)) &&
438 (prev_[0] == head_ || KeyIsAfterNode(key, prev_[0]))) {
Dinlineskiplist.h231 bool KeyIsAfterNode(const char* key, Node* n) const;
232 bool KeyIsAfterNode(const DecodedKey& key, Node* n) const;
445 bool InlineSkipList<Comparator>::KeyIsAfterNode(const char* key,
453 bool InlineSkipList<Comparator>::KeyIsAfterNode(const DecodedKey& key,
480 assert(x == head_ || KeyIsAfterNode(key_decoded, x));
521 assert(x == head_ || KeyIsAfterNode(key_decoded, x));
721 KeyIsAfterNode(next->Key(), before));
722 assert(before == head_ || KeyIsAfterNode(key, before));
723 if (next == after || !KeyIsAfterNode(key, next)) {
818 !KeyIsAfterNode(key_decoded,
[all …]
Dhash_linklist_rep.cc238 bool KeyIsAfterNode(const Slice& internal_key, const Node* n) const { in KeyIsAfterNode() function in ROCKSDB_NAMESPACE::__anoncfd1c5190111::HashLinkListRep
243 bool KeyIsAfterNode(const Key& key, const Node* n) const { in KeyIsAfterNode() function in ROCKSDB_NAMESPACE::__anoncfd1c5190111::HashLinkListRep
668 KeyIsAfterNode(next->key, cur)); in Insert()
669 if (KeyIsAfterNode(internal_key, cur)) { in Insert()
812 assert((x == head) || (next == nullptr) || KeyIsAfterNode(next->key, x)); in FindGreaterOrEqualInBucket()
813 if (KeyIsAfterNode(key, x)) { in FindGreaterOrEqualInBucket()