Lines Matching refs:prefixes

45   // Generate a set of random prefixes to share between tests.  For
52 // Distribute clusters of prefixes.
74 // Check that all elements of |prefixes| are in |prefix_set|, and
78 const std::vector<SBPrefix> &prefixes) {
79 // The set can generate the prefixes it believes it has, so that's
81 std::set<SBPrefix> check(prefixes.begin(), prefixes.end());
87 for (size_t i = 0; i < prefixes.size(); ++i) {
88 EXPECT_TRUE(prefix_set.PrefixExists(prefixes[i]));
90 const SBPrefix left_sibling = prefixes[i] - 1;
94 const SBPrefix right_sibling = prefixes[i] + 1;
179 // Fill |prefixes| with values read from a reference file. The reference file
181 bool ReadReferencePrefixes(std::vector<SBPrefix>* prefixes) {
201 prefixes->push_back(prefix);
232 const std::vector<SBPrefix> prefixes(100, 0u);
233 PrefixSetBuilder builder(prefixes);
236 EXPECT_TRUE(prefix_set->PrefixExists(prefixes[0]));
239 // Check that |GetPrefixes()| returns the same set of prefixes as
244 EXPECT_EQ(prefixes[0], prefixes_copy[0]);
249 std::vector<SBPrefix> prefixes;
253 prefixes.push_back(0x00000000);
254 prefixes.push_back(0x0000FFFF);
255 prefixes.push_back(0x7FFF0000);
256 prefixes.push_back(0x7FFFFFFF);
257 prefixes.push_back(0x80000000);
258 prefixes.push_back(0x8000FFFF);
259 prefixes.push_back(0xFFFF0000);
260 prefixes.push_back(0xFFFFFFFF);
262 std::sort(prefixes.begin(), prefixes.end());
263 PrefixSetBuilder builder(prefixes);
266 // Check that |GetPrefixes()| returns the same set of prefixes as
270 ASSERT_EQ(prefixes_copy.size(), prefixes.size());
271 EXPECT_TRUE(std::equal(prefixes.begin(), prefixes.end(),
277 std::vector<SBPrefix> prefixes;
282 prefixes.push_back(prefix);
285 std::sort(prefixes.begin(), prefixes.end());
286 PrefixSetBuilder builder(prefixes);
289 // Check that |GetPrefixes()| returns the same set of prefixes as
293 prefixes.erase(std::unique(prefixes.begin(), prefixes.end()), prefixes.end());
294 EXPECT_EQ(prefixes_copy.size(), prefixes.size());
295 EXPECT_TRUE(std::equal(prefixes.begin(), prefixes.end(),
305 std::vector<SBPrefix> prefixes;
309 prefixes.push_back(prefix);
315 prefixes.push_back(prefix);
323 prefixes.push_back(prefix);
324 prefixes.push_back(prefix);
332 prefixes.push_back(prefix);
335 prefixes.push_back(prefix);
339 std::sort(prefixes.begin(), prefixes.end());
340 PrefixSetBuilder builder(prefixes);
343 // Check that |GetPrefixes()| returns the same set of prefixes as
347 prefixes.erase(std::unique(prefixes.begin(), prefixes.end()), prefixes.end());
348 EXPECT_EQ(prefixes_copy.size(), prefixes.size());
349 EXPECT_TRUE(std::equal(prefixes.begin(), prefixes.end(),
359 for (size_t i = 0; i < prefixes.size(); ++i) {
360 EXPECT_TRUE(prefix_set->PrefixExists(prefixes[i]));
362 EXPECT_FALSE(prefix_set->PrefixExists(prefixes[i] - 1));
363 EXPECT_FALSE(prefix_set->PrefixExists(prefixes[i] + 1));
372 // the prefixes. Leaves the path in |filename|.
382 std::vector<SBPrefix> prefixes;
383 prefixes.push_back(kHighBitClear);
384 prefixes.push_back(kHighBitSet);
386 PrefixSetBuilder builder(prefixes);
391 CheckPrefixes(*prefix_set, prefixes);
396 std::vector<SBPrefix> prefixes;
397 PrefixSetBuilder builder(prefixes);
402 CheckPrefixes(*prefix_set, prefixes);
412 std::vector<SBPrefix> prefixes(shared_prefixes_);
414 // Remove any collisions from the prefixes.
417 std::lower_bound(prefixes.begin(), prefixes.end(), hashes[i].prefix);
418 if (iter != prefixes.end() && *iter == hashes[i].prefix)
419 prefixes.erase(iter);
422 PrefixSetBuilder builder(prefixes);
427 CheckPrefixes(*prefix_set, prefixes);
607 std::vector<SBPrefix> prefixes;
608 prefixes.push_back(kHash1.prefix);
609 prefixes.push_back(kHash2.prefix);
610 std::sort(prefixes.begin(), prefixes.end());
616 PrefixSetBuilder builder(prefixes);