Lines Matching refs:restored
276 std::vector<SBPrefix> restored;
277 prefix_set->GetPrefixes(&restored);
280 if (restored.size() == prefixes.size() &&
281 std::equal(prefixes.begin(), prefixes.end(), restored.begin()))
288 if (restored.size() != prefixes.size())
308 // Check whether |restored| is unsorted, or has duplication.
309 if (restored.size()) {
312 SBPrefix prev = restored[0];
313 for (size_t i = 0; i < restored.size(); prev = restored[i], ++i) {
314 if (prev > restored[i]) {
317 prev - restored[i]);
324 UMA_HISTOGRAM_COUNTS("SB2.PrefixSetUnsortedSize", restored.size());
326 i * 100 / restored.size());
340 if (prev == restored[i])
352 // Fix the problems noted. If |restored| was unsorted, then
355 std::sort(restored.begin(), restored.end());
357 restored.erase(std::unique(restored.begin(), restored.end()),
358 restored.end());
367 // Find elements in |restored| which are not in |prefixes|.
369 std::set_difference(restored.begin(), restored.end(),
375 // Find elements in |prefixes| which are not in |restored|.
378 restored.begin(), restored.end(),
604 std::vector<SBPrefix> restored;
626 if (restored.empty())
627 prefix_set_->GetPrefixes(&restored);
632 if (std::binary_search(restored.begin(), restored.end(),
