216   Slice GetPrefix(const Slice& internal_key) const {  in GetPrefix()
217     return transform_->Transform(ExtractUserKey(internal_key));  in GetPrefix()
238   bool KeyIsAfterNode(const Slice& internal_key, const Node* n) const {  in KeyIsAfterNode()  argument
240     return (n != nullptr) && (compare_(n->key, internal_key) < 0);  in KeyIsAfterNode()
248   bool KeyIsAfterOrAtNode(const Slice& internal_key, const Node* n) const {  in KeyIsAfterOrAtNode()  argument
250     return (n != nullptr) && (compare_(n->key, internal_key) <= 0);  in KeyIsAfterOrAtNode()
293     void Seek(const Slice& internal_key, const char* memtable_key) override {  in Seek()  argument
296               memtable_key : EncodeKey(&tmp_, internal_key);  in Seek()
301     void SeekForPrev(const Slice& internal_key,  in SeekForPrev()  argument
305                                     : EncodeKey(&tmp_, internal_key);  in SeekForPrev()
361     void Seek(const Slice& internal_key,  in Seek()  argument
364                                                               internal_key);  in Seek()
574   Slice internal_key = GetLengthPrefixedSlice(x->key);  in Insert()  local
575   auto transformed = GetPrefix(internal_key);  in Insert()
669       if (KeyIsAfterNode(internal_key, cur)) {  in Insert()
694   Slice internal_key = GetLengthPrefixedSlice(key);  in Contains()  local
696   auto transformed = GetPrefix(internal_key);  in Contains()
706     return LinkListContains(GetLinkListFirstNode(bucket), internal_key);  in Contains()
732       for (iter.Seek(k.internal_key(), nullptr);  in Get()