233       inputs_(PopulateWithAtomicBoundaries(vstorage, std::move(_inputs))),  in Compaction()
236       bottommost_level_(IsBottommostLevel(output_level_, vstorage, inputs_)),  in Compaction()
237       is_full_compaction_(IsFullCompaction(vstorage, inputs_)),  in Compaction()
256   for (size_t i = 1; i < inputs_.size(); ++i) {  in Compaction()
257     assert(inputs_[i].level > inputs_[i - 1].level);  in Compaction()
265       DoGenerateLevelFilesBrief(&input_levels_[which], inputs_[which].files,  in Compaction()
270   GetBoundaryKeys(vstorage, inputs_, &smallest_user_key_, &largest_user_key_);  in Compaction()
331   for (const auto& file : inputs_.front().files) {  in IsTrivialMove()
350     for (size_t i = 0; i < inputs_[which].size(); i++) {  in AddInputDeletions()
351       out_edit->DeleteFile(level(which), inputs_[which][i]->fd.GetNumber());  in AddInputDeletions()
391     for (size_t j = 0; j < inputs_[i].size(); j++) {  in MarkFilesBeingCompacted()
392       assert(mark_as_compacted ? !inputs_[i][j]->being_compacted  in MarkFilesBeingCompacted()
393                                : inputs_[i][j]->being_compacted);  in MarkFilesBeingCompacted()
394       inputs_[i][j]->being_compacted = mark_as_compacted;  in MarkFilesBeingCompacted()
406   for (auto& input_level : inputs_) {  in InputLevelSummary()
430   for (auto& input_level : inputs_) {  in CalculateTotalInputSize()
484         InputSummary(inputs_[level_iter].files, output + write, len - write);  in Summary()
496   for (const auto& level_files : inputs_) {  in OutputFilePreallocationSize()
529   return inputs_.back().level != output_level_ || inputs_.back().empty();  in IsOutputLevelEmpty()
548   for (const auto& level_files : inputs_) {  in MinInputFileOldestAncesterTime()