Move prefix_set and parts of s_b_util into a new component safe_browsing_db.

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 "chrome/browser/safe_browsing/prefix_set.h"
+#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"
 
@@ skipping 330 matching lines @@
 
 void PrefixSet::AddRun(SBPrefix index_prefix,
                        const uint16* run_begin, const uint16* run_end) {
   // Preempt organic capacity decisions for |delta_| once strong estimates can
   // be made.
   if (index_prefix > kEstimateThreshold &&
       deltas_.capacity() < deltas_.size() + (run_end - run_begin)) {
     deltas_.reserve(EstimateFinalCount(index_prefix, deltas_.size()));
   }
 
-  index_.push_back(std::make_pair(index_prefix, deltas_.size()));
+  index_.push_back(
+      std::make_pair(index_prefix, static_cast<uint32>(deltas_.size())));
   deltas_.insert(deltas_.end(), run_begin, run_end);
 }
 
 PrefixSetBuilder::PrefixSetBuilder()
     : prefix_set_(new PrefixSet()) {
 }
 
 PrefixSetBuilder::PrefixSetBuilder(const std::vector<SBPrefix>& prefixes)
     : prefix_set_(new PrefixSet()) {
   for (size_t i = 0; i < prefixes.size(); ++i) {
@@ skipping 72 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