Searched refs:inputs_ (Results 1 – 2 of 2) sorted by relevance
256 for (size_t i = 1; i < inputs_.size(); ++i) { in Compaction()257 assert(inputs_[i].level > inputs_[i - 1].level); 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()391 for (size_t j = 0; j < inputs_[i].size(); j++) { 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()496 for (const auto& level_files : inputs_) { in OutputFilePreallocationSize()529 return inputs_.back().level != output_level_ || inputs_.back().empty(); in IsOutputLevelEmpty()[all …]
92 return inputs_[compaction_input_level].level;101 size_t num_input_levels() const { return inputs_.size(); } in num_input_levels()112 if (compaction_input_level < inputs_.size()) { in num_input_files()113 return inputs_[compaction_input_level].size(); in num_input_files()129 assert(compaction_input_level < inputs_.size()); in input()130 return inputs_[compaction_input_level][i]; in input()135 assert(compaction_input_level < inputs_.size()); in boundaries()145 assert(compaction_input_level < inputs_.size()); in inputs()146 return &inputs_[compaction_input_level].files; in inputs()149 const std::vector<CompactionInputFiles>* inputs() { return &inputs_; } in inputs()[all …]