Chromium Code Reviews| Index: components/safe_browsing_db/prefix_set.cc |
| diff --git a/components/safe_browsing_db/prefix_set.cc b/components/safe_browsing_db/prefix_set.cc |
| index e6b4ecc029c7e3d9f7846691d8894d4e08fa2a30..0fb44a1d995df49ccb42b529d6be1e9c6c38e1d1 100644 |
| --- a/components/safe_browsing_db/prefix_set.cc |
| +++ b/components/safe_browsing_db/prefix_set.cc |
| @@ -13,7 +13,7 @@ |
| #include "base/metrics/histogram.h" |
| #include "base/metrics/sparse_histogram.h" |
| -namespace { |
| +namespace safe_browsing { |
|
Nathan Parker
2015/11/05 22:00:53
anon-namespace
vakh (old account. dont use)
2015/11/07 01:22:57
Done.
|
| // |kMagic| should be reasonably unique, and not match itself across |
| // endianness changes. I generated this value with: |
| @@ -74,10 +74,6 @@ size_t EstimateFinalCount(SBPrefix current_prefix, size_t current_count) { |
| return estimated_prefix_count + estimated_prefix_count / 100; |
| } |
| -} // namespace |
| - |
| -namespace safe_browsing { |
| - |
| // For |std::upper_bound()| to find a prefix w/in a vector of pairs. |
| // static |
| bool PrefixSet::PrefixLess(const IndexPair& a, const IndexPair& b) { |