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

chrome/browser/safe_browsing/safe_browsing_store.cc

 // Copyright (c) 2011 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 "chrome/browser/safe_browsing/safe_browsing_store.h"
 
 #include <algorithm>
 
 #include "base/logging.h"
 
-namespace {
+namespace safe_browsing {
 
 // Return |true| if the range is sorted by the given comparator.

[Nathan Parker, 2015/11/05 22:00:53]

anon namespace

[vakh (old account. dont use), 2015/11/07 01:22:56]

Done.

 template <typename CTI, typename LESS>
 bool sorted(CTI beg, CTI end, LESS less) {
   while ((end - beg) > 2) {
     CTI n = beg++;
     if (less(*beg, *n))
       return false;
   }
   return true;
 }
 
@@ skipping 57 matching lines @@
   for (typename ItemsT::iterator iter = end_iter;
        iter != items->end(); ++iter) {
     if (del_set.count(iter->chunk_id) == 0) {
       *end_iter = *iter;
       ++end_iter;
     }
   }
   items->erase(end_iter, items->end());
 }
 
-}  // namespace
-
 void SBProcessSubs(SBAddPrefixes* add_prefixes,
                    SBSubPrefixes* sub_prefixes,
                    std::vector<SBAddFullHash>* add_full_hashes,
                    std::vector<SBSubFullHash>* sub_full_hashes,
                    const base::hash_set<int32>& add_chunks_deleted,
                    const base::hash_set<int32>& sub_chunks_deleted) {
   // It is possible to structure templates and template
   // specializations such that the following calls work without having
   // to qualify things.  It becomes very arbitrary, though, and less
   // clear how things are working.
@@ skipping 19 matching lines @@
                SBAddPrefixHashLess<SBSubFullHash,SBAddFullHash>);
 
   // Remove items from the deleted chunks.  This is done after other
   // processing to allow subs to knock out adds (and be removed) even
   // if the add's chunk is deleted.
   RemoveDeleted(add_prefixes, add_chunks_deleted);
   RemoveDeleted(sub_prefixes, sub_chunks_deleted);
   RemoveDeleted(add_full_hashes, add_chunks_deleted);
   RemoveDeleted(sub_full_hashes, sub_chunks_deleted);
 }
+
+}  // namespace safe_browsing