26 class VectorRep : public MemTableRep {  class
28   VectorRep(const KeyComparator& compare, Allocator* allocator, size_t count);
46   ~VectorRep() override {}  in ~VectorRep()
49     class VectorRep* vrep_;
57     explicit Iterator(class VectorRep* vrep,
109 void VectorRep::Insert(KeyHandle handle) {  in Insert()
117 bool VectorRep::Contains(const char* key) const {  in Contains()
122 void VectorRep::MarkReadOnly() {  in MarkReadOnly()
127 size_t VectorRep::ApproximateMemoryUsage() {  in ApproximateMemoryUsage()
136 VectorRep::VectorRep(const KeyComparator& compare, Allocator* allocator,  in VectorRep()  function in ROCKSDB_NAMESPACE::__anonfd4f76000111::VectorRep
146 VectorRep::Iterator::Iterator(class VectorRep* vrep,  in Iterator()
155 void VectorRep::Iterator::DoSort() const {  in DoSort()
176 bool VectorRep::Iterator::Valid() const {  in Valid()
183 const char* VectorRep::Iterator::key() const {  in key()
190 void VectorRep::Iterator::Next() {  in Next()
200 void VectorRep::Iterator::Prev() {  in Prev()
213 void VectorRep::Iterator::Seek(const Slice& user_key,  in Seek()
228 void VectorRep::Iterator::SeekForPrev(const Slice& /*user_key*/,  in SeekForPrev()
235 void VectorRep::Iterator::SeekToFirst() {  in SeekToFirst()
242 void VectorRep::Iterator::SeekToLast() {  in SeekToLast()
250 void VectorRep::Get(const LookupKey& k, void* callback_args,  in Get()
253   VectorRep* vector_rep;  in Get()
261   VectorRep::Iterator iter(vector_rep, immutable_ ? bucket_ : bucket, compare_);  in Get()
269 MemTableRep::Iterator* VectorRep::GetIterator(Arena* arena) {  in GetIterator()
298   return new VectorRep(compare, allocator, count_);  in CreateMemTableRep()