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

chrome/browser/history/snippet_unittest.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.
 
 #include "chrome/browser/history/snippet.h"
 
 #include <algorithm>
 
 #include "base/string_split.h"
 #include "base/string_util.h"
@@ skipping 80 matching lines @@
                       const std::string& query) {
   // This function assumes that |document| does not contain
   // any character for which lowercasing changes its length. Further,
   // it's assumed that lowercasing only the ASCII-portion works for
   // |document|. We need to add more test cases and change this function
   // to be more generic depending on how we deal with 'folding for match'
   // in history.
   const std::string document_folded = StringToLowerASCII(std::string(document));
 
   std::vector<std::string> query_words;
-  SplitString(query, ' ', &query_words);
+  base::SplitString(query, ' ', &query_words);
 
   // Manually construct match_positions of the document.
   Snippet::MatchPositions match_positions;
   match_positions.clear();
   for (std::vector<std::string>::iterator qw = query_words.begin();
        qw != query_words.end(); ++qw) {
     // Insert all instances of this word into match_pairs.
     size_t ofs = 0;
     while ((ofs = document_folded.find(*qw, ofs)) != std::string::npos) {
       match_positions.push_back(std::make_pair(ofs, ofs + qw->size()));
@@ skipping 131 matching lines @@
   for (size_t i = 0; i < ARRAYSIZE_UNSAFE(data); ++i) {
     Snippet::MatchPositions matches;
     Snippet::ExtractMatchPositions(data[i].offsets_string, "0", &matches);
     EXPECT_EQ(data[i].expected_match_count, matches.size());
     for (size_t j = 0; j < data[i].expected_match_count; ++j) {
       EXPECT_EQ(data[i].expected_matches[2 * j], matches[j].first);
       EXPECT_EQ(data[i].expected_matches[2 * j + 1], matches[j].second);
     }
   }
 }