Lines Matching refs:Buckets
87 // Figure out how many buckets we need, then compute the bucket
95 Buckets.resize(Header.bucket_count);
98 Buckets[bucket].push_back(Data[i]);
102 // Sort the contents of the buckets by hash value so that hash
105 for (size_t i = 0; i < Buckets.size(); ++i)
106 std::stable_sort(Buckets[i].begin(), Buckets[i].end(),
139 // Walk through and emit the buckets for the table. Each index is
143 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
145 if (Buckets[i].size() != 0)
149 // Buckets point in the list of hashes, not to the data. Do not
152 for (auto *HD : Buckets[i]) {
161 // Walk through the buckets and emit the individual hashes for each
165 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
166 for (HashList::const_iterator HI = Buckets[i].begin(),
167 HE = Buckets[i].end();
179 // Walk through the buckets and emit the individual offsets for each
185 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
186 for (HashList::const_iterator HI = Buckets[i].begin(),
187 HE = Buckets[i].end();
203 // Walk through the buckets and emit the full data for each element in
207 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
209 for (HashList::const_iterator HI = Buckets[i].begin(),
210 HE = Buckets[i].end();
237 if (!Buckets[i].empty())
248 // Emit the buckets.
276 O << "Buckets and Hashes: \n";
277 for (size_t i = 0, e = Buckets.size(); i < e; ++i)
278 for (HashList::const_iterator HI = Buckets[i].begin(),
279 HE = Buckets[i].end();
