Home
last modified time | relevance | path

Searched refs:iterator (Results 1 – 7 of 7) sorted by relevance

/leveldb-1.20/helpers/memenv/
H A Dmemenv_test.cc214 Iterator* iterator = db->NewIterator(ReadOptions()); in TEST() local
215 iterator->SeekToFirst(); in TEST()
217 ASSERT_TRUE(iterator->Valid()); in TEST()
218 ASSERT_TRUE(keys[i] == iterator->key()); in TEST()
219 ASSERT_TRUE(vals[i] == iterator->value()); in TEST()
220 iterator->Next(); in TEST()
222 ASSERT_TRUE(!iterator->Valid()); in TEST()
223 delete iterator; in TEST()
H A Dmemenv.cc127 for (std::vector<char*>::iterator i = blocks_.begin(); i != blocks_.end(); in ~FileState()
235 for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){ in ~InMemoryEnv()
303 for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){ in GetChildren()
/leveldb-1.20/
H A DREADME.md157 * **include/iterator.h**: Interface for iterating over data. You can get
158 an iterator from a DB object.
/leveldb-1.20/db/
H A Dskiplist_test.cc94 std::set<Key>::iterator model_iter = keys.lower_bound(i); in TEST()
H A Ddb_impl.cc1286 std::deque<Writer*>::iterator iter = writers_.begin(); in BuildBatchGroup()
/leveldb-1.20/doc/
H A Dimpl.md135 we will only need to worry about the O(N) complexity in the merging iterator.
H A Dindex.md363 cached contents. A per-iterator option can be used to achieve this: