Home
last modified time | relevance | path

Searched refs:first (Results 1 – 12 of 12) sorted by relevance

/leveldb-1.20/db/
H A Dversion_edit.cc65 PutVarint32(dst, compact_pointers_[i].first); // level in EncodeTo()
73 PutVarint32(dst, iter->first); // level in EncodeTo()
80 PutVarint32(dst, new_files_[i].first); // level in EncodeTo()
237 AppendNumberTo(&r, compact_pointers_[i].first); in DebugString()
245 AppendNumberTo(&r, iter->first); in DebugString()
252 AppendNumberTo(&r, new_files_[i].first); in DebugString()
H A Ddb_impl.cc1271 Writer* first = writers_.front(); in BuildBatchGroup() local
1272 WriteBatch* result = first->batch; in BuildBatchGroup()
1275 size_t size = WriteBatchInternal::ByteSize(first->batch); in BuildBatchGroup()
1285 *last_writer = first; in BuildBatchGroup()
1290 if (w->sync && !first->sync) { in BuildBatchGroup()
1303 if (result == first->batch) { in BuildBatchGroup()
1307 WriteBatchInternal::Append(result, first->batch); in BuildBatchGroup()
H A Ddb_test.cc350 bool first = true; in AllEntriesFor() local
359 if (!first) { in AllEntriesFor()
362 first = false; in AllEntriesFor()
374 if (!first) { in AllEntriesFor()
1942 iter_ = map_->find(map_->rbegin()->first); in SeekToLast()
1950 virtual Slice key() const { return iter_->first; } in key()
H A Dversion_set.cc668 const int level = edit->compact_pointers_[i].first; in Apply()
678 const int level = iter->first; in Apply()
685 const int level = edit->new_files_[i].first; in Apply()
/leveldb-1.20/doc/
H A Dlog_format.md36 of the first fragment of a user record, LAST is the type of the last fragment of
46 **A** will be stored as a FULL record in the first block.
48 **B** will be split into three fragments: first fragment occupies the rest of
49 the first block, second fragment occupies the entirety of the second block, and
H A Dtable_format.md43 the first key in the successive data block. The value is the
72 resulting filter will be stored as the first filter in the filter
H A Dimpl.md98 The next compaction for level L will pick the first file that starts after this
H A Dindex.md250 we should sort by the first number, breaking ties by the second number. First,
/leveldb-1.20/table/
H A Dtable_test.cc161 keys->push_back(it->first); in Finish()
198 builder.Add(it->first, it->second); in FinishImpl()
238 builder.Add(it->first, it->second); in FinishImpl()
335 memtable_->Add(seq, kTypeValue, it->first, it->second); in FinishImpl()
368 batch.Put(it->first, it->second); in FinishImpl()
576 std::string last = data.rbegin()->first; in TestRandomAccess()
591 return "'" + it->first + "->" + it->second + "'"; in ToString()
600 return "'" + it->first + "->" + it->second + "'"; in ToString()
/leveldb-1.20/util/
H A Darena_test.cc55 size_t num_bytes = allocated[i].first; in TEST()
/leveldb-1.20/helpers/memenv/
H A Dmemenv.cc304 const std::string& filename = i->first; in GetChildren()
/leveldb-1.20/
H A DREADME.md48 Before any pull request will be accepted the author must first sign a