base: Move SplitString functions into the base namespace and update the callers.

chrome/browser/safe_browsing/chunk_range.cc

 // Copyright (c) 2010 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.
 //
 // Implementation of ChunkRange class.
 
 #include "chrome/browser/safe_browsing/chunk_range.h"
 
 #include "base/logging.h"
 #include "base/string_number_conversions.h"
@@ skipping 60 matching lines @@
   }
 }
 
 bool StringToRanges(const std::string& input,
                     std::vector<ChunkRange>* ranges) {
   DCHECK(ranges);
 
   // Crack the string into chunk parts, then crack each part looking for a
   // range.
   std::vector<std::string> chunk_parts;
-  SplitString(input, ',', &chunk_parts);
+  base::SplitString(input, ',', &chunk_parts);
 
   for (size_t i = 0; i < chunk_parts.size(); ++i) {
     std::vector<std::string> chunk_ranges;
-    SplitString(chunk_parts[i], '-', &chunk_ranges);
+    base::SplitString(chunk_parts[i], '-', &chunk_ranges);
     int start = atoi(chunk_ranges[0].c_str());
     int stop = start;
     if (chunk_ranges.size() == 2)
       stop = atoi(chunk_ranges[1].c_str());
     if (start == 0 || stop == 0) {
       // atoi error, since chunk numbers are guaranteed to never be 0.
       ranges->clear();
       return false;
     }
     ranges->push_back(ChunkRange(start, stop));
@@ skipping 19 matching lines @@
 
     // Adjust our mid point.
     if (chunk.stop() < chunk_number)
       low = mid + 1;
     else
       high = mid - 1;
   }
 
   return false;
 }