Lines Matching refs:index_
45 // more than |min_runs| entries in |index_|, but there generally
48 index_.reserve(min_runs);
54 index_.push_back(std::make_pair(prev_prefix, deltas_.size()));
70 index_.push_back(std::make_pair(sorted_prefixes[i], deltas_.size()));
84 const size_t bits_used = index_.size() * sizeof(index_[0]) * CHAR_BIT +
86 const size_t unique_prefixes = index_.size() + deltas_.size();
97 index_.swap(*index);
104 if (index_.empty())
107 // Find the first position after |prefix| in |index_|.
109 iter = std::upper_bound(index_.begin(), index_.end(),
114 if (iter == index_.begin())
118 const size_t bound = (iter == index_.end() ? deltas_.size() : iter->second);
123 // All prefixes in |index_| are in the set.
137 prefixes->reserve(index_.size() + deltas_.size());
139 for (size_t ii = 0; ii < index_.size(); ++ii) {
140 // The deltas for this |index_| entry run to the next index entry,
143 (ii + 1 < index_.size()) ? index_[ii + 1].second : deltas_.size();
145 SBPrefix current = index_[ii].first;
147 for (size_t di = index_[ii].second; di < deltas_end; ++di) {
236 header.index_size = static_cast<uint32>(index_.size());
240 if (static_cast<size_t>(header.index_size) != index_.size() ||
263 if (index_.size()) {
264 const size_t index_bytes = sizeof(index_[0]) * index_.size();
265 written = fwrite(&(index_[0]), sizeof(index_[0]), index_.size(),
267 if (written != index_.size())
271 reinterpret_cast<const char*>(&(index_[0])),