Home
last modified time | relevance | path

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

/leveldb-1.20/table/
H A Dtable_test.cc160 ++it) { in Finish()
197 ++it) { in FinishImpl()
198 builder.Add(it->first, it->second); in FinishImpl()
237 ++it) { in FinishImpl()
238 builder.Add(it->first, it->second); in FinishImpl()
334 ++it) { in FinishImpl()
335 memtable_->Add(seq, kTypeValue, it->first, it->second); in FinishImpl()
366 ++it) { in FinishImpl()
368 batch.Put(it->first, it->second); in FinishImpl()
591 return "'" + it->first + "->" + it->second + "'"; in ToString()
[all …]
/leveldb-1.20/db/
H A Dbuilder.cc67 Iterator* it = table_cache->NewIterator(ReadOptions(), in BuildTable() local
70 s = it->status(); in BuildTable()
71 delete it; in BuildTable()
H A Dfault_injection_test.cc268 for (std::map<std::string, FileState>::const_iterator it = in DropUnsyncedFileData() local
270 s.ok() && it != db_file_state_.end(); ++it) { in DropUnsyncedFileData()
271 const FileState& state = it->second; in DropUnsyncedFileData()
342 std::set<std::string>::const_iterator it; in DeleteFilesCreatedAfterLastDirSync() local
343 for (it = new_files.begin(); s.ok() && it != new_files.end(); ++it) { in DeleteFilesCreatedAfterLastDirSync()
344 s = DeleteFile(*it); in DeleteFilesCreatedAfterLastDirSync()
H A Dversion_set.cc648 for (FileSet::const_iterator it = added->begin(); in ~Builder() local
649 it != added->end(); ++it) { in ~Builder()
650 to_unref.push_back(*it); in ~Builder()
/leveldb-1.20/doc/
H A Dindex.md14 shows how to open a database, creating it if necessary:
117 before it is considered done.
151 for (it->SeekToFirst(); it->Valid(); it->Next()) {
152 cout << it->key().ToString() << ": " << it->value().ToString() << endl;
155 delete it;
162 for (it->Seek(start);
163 it->Valid() && it->key().ToString() < limit;
164 it->Next()) {
173 for (it->SeekToLast(); it->Valid(); it->Prev()) {
204 The return value of the `it->key()` and `it->value()` calls above are instances
[all …]
H A Dlog_format.md15 A record never starts within the last six bytes of a block (since it won't fit).
72 so it is a shortcoming of the current implementation, not necessarily the
H A Dimpl.md15 (approximately 4MB by default), it is converted to a sorted table (see below)
77 When the size of level L exceeds its limit, we compact it in a background
82 is special (files in it may overlap each other), we treat compactions from
161 * We could open all sstables here, but it is probably better to be lazy...
/leveldb-1.20/
H A DCONTRIBUTING.md17 instructions for how to sign and return it.
24 Please don't mix more than one logical change per submission, because it makes
34 If your contribution contains code, please make sure that it follows
H A DREADME.md23 …SQL database. It does not have a relational data model, it does not support SQL queries, and it h…
130 read from disk. If we supply enough cache to the leveldb so it can hold the