Home
last modified time | relevance | path

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

/leveldb-1.20/db/
H A Dlog_writer.cc44 bool begin = true; in AddRecord() local
66 if (begin && end) { in AddRecord()
68 } else if (begin) { in AddRecord()
79 begin = false; in AddRecord()
H A Ddb_impl.h43 virtual void CompactRange(const Slice* begin, const Slice* end);
48 void TEST_CompactRange(int level, const Slice* begin, const Slice* end);
165 const InternalKey* begin; // NULL means beginning of key range member
H A Ddb_impl.cc344 std::sort(logs.begin(), logs.end()); in Recover()
567 void DBImpl::CompactRange(const Slice* begin, const Slice* end) { in CompactRange() argument
573 if (base->OverlapInLevel(level, begin, end)) { in CompactRange()
580 TEST_CompactRange(level, begin, end); in CompactRange()
593 if (begin == NULL) { in TEST_CompactRange()
594 manual.begin = NULL; in TEST_CompactRange()
597 manual.begin = &begin_storage; in TEST_CompactRange()
699 c = versions_->CompactRange(m->level, m->begin, m->end); in BackgroundCompaction()
707 (m->begin ? m->begin->DebugString().c_str() : "(begin)"), in BackgroundCompaction()
765 m->begin = &m->tmp_storage; in BackgroundCompaction()
[all …]
H A Dversion_set.cc304 std::sort(tmp.begin(), tmp.end(), NewestFirst); in ForEachOverlapping()
370 std::sort(tmp.begin(), tmp.end(), NewestFirst); in Get()
533 const InternalKey* begin, in GetOverlappingInputs() argument
540 if (begin != NULL) { in GetOverlappingInputs()
541 user_begin = begin->user_key(); in GetOverlappingInputs()
648 for (FileSet::const_iterator it = added->begin(); in ~Builder()
675 for (VersionEdit::DeletedFileSet::const_iterator iter = del.begin(); in Apply()
722 for (FileSet::const_iterator added_iter = added->begin(); in SaveTo()
1254 all.insert(all.end(), inputs2.begin(), inputs2.end()); in GetRange2()
1415 const InternalKey* begin, in CompactRange() argument
[all …]
H A Dversion_set.h94 const InternalKey* begin, // NULL means before all keys
239 const InternalKey* begin,
H A Dversion_edit.cc69 for (DeletedFileSet::const_iterator iter = deleted_files_.begin(); in EncodeTo()
241 for (DeletedFileSet::const_iterator iter = deleted_files_.begin(); in DebugString()
H A Dfault_injection_test.cc269 db_file_state_.begin(); in DropUnsyncedFileData()
338 std::set<std::string> new_files(new_files_since_last_dir_sync_.begin(), in DeleteFilesCreatedAfterLastDirSync()
343 for (it = new_files.begin(); s.ok() && it != new_files.end(); ++it) { in DeleteFilesCreatedAfterLastDirSync()
H A Dskiplist_test.cc77 ASSERT_EQ(*(keys.begin()), iter.key()); in TEST()
81 ASSERT_EQ(*(keys.begin()), iter.key()); in TEST()
H A Ddb_test.cc1937 virtual void SeekToFirst() { iter_ = map_->begin(); } in SeekToFirst()
/leveldb-1.20/table/
H A Dtable_test.cc158 for (KVMap::const_iterator it = data_.begin(); in Finish()
195 for (KVMap::const_iterator it = data.begin(); in FinishImpl()
235 for (KVMap::const_iterator it = data.begin(); in FinishImpl()
332 for (KVMap::const_iterator it = data.begin(); in FinishImpl()
364 for (KVMap::const_iterator it = data.begin(); in FinishImpl()
492 for (KVMap::const_iterator model_iter = data.begin(); in TestForwardScan()
523 KVMap::const_iterator model_iter = data.begin(); in TestRandomAccess()
541 model_iter = data.begin(); in TestRandomAccess()
560 if (model_iter == data.begin()) { in TestRandomAccess()
/leveldb-1.20/helpers/memenv/
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/include/leveldb/
H A Ddb.h143 virtual void CompactRange(const Slice* begin, const Slice* end) = 0;