Searched refs:entries_ (Results 1 – 6 of 6) sorted by relevance
137 entries_.push_back( in AddIndexEntry()151 entries_.push_back( in AddIndexEntry()174 partition_cnt_ = entries_.size(); in Finish()179 Entry& last_entry = entries_.front(); in Finish()195 entries_.pop_front(); in Finish()198 if (UNLIKELY(entries_.empty())) { in Finish()211 Entry& entry = entries_.front(); in Finish()
96 start_.push_back(entries_.size()); in AddKey()97 entries_.append(key.data(), key.size()); in AddKey()105 prev = Slice(entries_.data() + prev_prefix_start_, prev_prefix_size_); in AddPrefix()111 prev_prefix_start_ = entries_.size(); in AddPrefix()145 start_.push_back(entries_.size()); // Simplify length computation in GenerateFilter()148 const char* base = entries_.data() + start_[i]; in GenerateFilter()159 entries_.clear(); in GenerateFilter()
68 std::string entries_; // Flattened entry contents variable
423 std::list<Entry> entries_; // list of partitioned indexes and their keys variable
18 auto entries = entries_.find(type); in FindEntry()19 if (entries != entries_.end()) { in FindEntry()31 auto &entries = entries_[type]; in AddEntry()36 for (const auto &iter : entries_) { in Dump()
87 std::unordered_map<std::string, std::vector<std::unique_ptr<Entry>>> entries_; variable