Lines Matching refs:prefixes
67 // |include_whitelist_hashes| is true we will generate additional path-prefixes
111 // Get the prefixes matching the download |urls|.
113 std::vector<SBPrefix>* prefixes) {
119 prefixes->push_back(full_hashes[i].prefix);
262 // |prefixes|. For now, |prefixes| is useful while debugging
264 std::vector<SBPrefix> prefixes;
266 prefixes.push_back(add_prefixes[i].prefix);
269 std::sort(prefixes.begin(), prefixes.end());
270 prefixes.erase(std::unique(prefixes.begin(), prefixes.end()),
271 prefixes.end());
274 prefix_set(new safe_browsing::PrefixSet(prefixes));
280 if (restored.size() == prefixes.size() &&
281 std::equal(prefixes.begin(), prefixes.end(), restored.begin()))
288 if (restored.size() != prefixes.size())
367 // Find elements in |restored| which are not in |prefixes|.
370 prefixes.begin(), prefixes.end(),
375 // Find elements in |prefixes| which are not in |restored|.
377 std::set_difference(prefixes.begin(), prefixes.end(),
619 // the original prefixes and manually search for it, to check if
622 // |GetPrefixes()| returns the same prefixes as were passed to
642 // If all the prefixes are cached as 'misses', don't issue a GetHash.
660 const std::vector<SBPrefix>& prefixes,
667 for (size_t j = 0; j < prefixes.size(); ++j) {
668 const SBPrefix& prefix = prefixes[j];
687 std::vector<SBPrefix> prefixes;
688 GetDownloadUrlPrefixes(urls, &prefixes);
690 prefixes,
702 std::vector<SBPrefix> prefixes(1, prefix);
705 prefixes,
727 // Helper to insert entries for all of the prefixes or full hashes in
742 // No prefixes, use host instead.
797 // Helper to insert entries for all of the prefixes or full hashes in
812 // No prefixes, use host instead.
926 const std::vector<SBPrefix>& prefixes,
932 prefix_miss_cache_.insert(prefixes.begin(), prefixes.end());
1047 // Note: prefixes will not be empty. The current data store implementation
1049 std::vector<SBAddPrefix> prefixes;
1053 &prefixes,