Home
last modified time | relevance | path

Searched refs:Insert (Results 1 – 9 of 9) sorted by relevance

/leveldb-1.20/util/
H A Dcache_test.cc76 Insert(100, 101); in TEST()
81 Insert(200, 201); in TEST()
86 Insert(100, 102); in TEST()
100 Insert(100, 101); in TEST()
101 Insert(200, 201); in TEST()
116 Insert(100, 101); in TEST()
120 Insert(100, 102); in TEST()
141 Insert(100, 101); in TEST()
142 Insert(200, 201); in TEST()
210 Insert(1, 100); in TEST()
[all …]
H A Dcache.cc80 LRUHandle* Insert(LRUHandle* h) { in Insert() function in leveldb::__anon90b7ddab0111::HandleTable
162 Cache::Handle* Insert(const Slice& key, uint32_t hash,
269 Cache::Handle* LRUCache::Insert( in Insert() function in leveldb::__anon90b7ddab0111::LRUCache
290 FinishErase(table_.Insert(e)); in Insert()
361 virtual Handle* Insert(const Slice& key, void* value, size_t charge, in Insert() function in leveldb::__anon90b7ddab0111::ShardedLRUCache
364 return shard_[Shard(hash)].Insert(key, hash, value, charge, deleter); in Insert()
H A Denv_posix.cc316 bool Insert(const std::string& fname) { in Insert() function in leveldb::__anonf3d8c4b20111::PosixLockTable
470 } else if (!locks_.Insert(fname)) { in LockFile()
/leveldb-1.20/include/leveldb/
H A Dcache.h52 virtual Handle* Insert(const Slice& key, void* value, size_t charge,
/leveldb-1.20/db/
H A Dskiplist.h53 void Insert(const Key& key);
337 void SkipList<Key,Comparator>::Insert(const Key& key) {
H A Dskiplist_test.cc58 list.Insert(key); in TEST()
221 list_.Insert(key); in WriteStep()
H A Dtable_cache.cc76 *handle = cache_->Insert(key, tf, 1, &DeleteEntry); in FindTable()
H A Dmemtable.cc105 table_.Insert(buf); in Add()
/leveldb-1.20/table/
H A Dtable.cc193 cache_handle = block_cache->Insert( in BlockReader()