Move code in components/safe_browsing_db and chrome/browser/s_b/ under the safe_browsing namespace.

components/safe_browsing_db/prefix_set.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "components/safe_browsing_db/prefix_set.h"
 
 #include <algorithm>
 
 #include "base/files/file_util.h"
 #include "base/files/scoped_file.h"
 #include "base/logging.h"
 #include "base/md5.h"
 #include "base/metrics/histogram.h"
 #include "base/metrics/sparse_histogram.h"
 
+namespace safe_browsing {
+
 namespace {
 
 // |kMagic| should be reasonably unique, and not match itself across
 // endianness changes.  I generated this value with:
 // md5 -qs chrome/browser/safe_browsing/prefix_set.cc | colrm 9
 static uint32 kMagic = 0x864088dd;
 
 // Version history:
 // Version 1: b6cb7cfe/r74487 by shess@chromium.org on 2011-02-10
 // Version 2: 2b59b0a6/r253924 by shess@chromium.org on 2014-02-27
@@ skipping 43 matching lines @@
       (static_cast<uint64>(current_count) << 32) / current_prefix);
 
   // The estimate has an error bar, if the final total is below the estimate, no
   // harm, but if it is above a capacity resize will happen at nearly 100%.  Add
   // some slop to make sure all cases are covered.
   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) {
   return a.first < b.first;
 }
 
 PrefixSet::PrefixSet() {
 }
 
 PrefixSet::PrefixSet(IndexVector* index,
@@ skipping 349 matching lines @@
   }
   buffer_.push_back(prefix);
 
   // Flush buffer when a run can be constructed.  +1 for the index item, and +1
   // to leave at least one item in the buffer for dropping duplicates.
   if (buffer_.size() > PrefixSet::kMaxRun + 2)
     EmitRun();
 }
 
 }  // namespace safe_browsing