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

chrome/browser/bookmarks/bookmark_index_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 <string>
 #include <vector>
 
 #include "base/message_loop.h"
 #include "base/string_number_conversions.h"
 #include "base/string_split.h"
@@ skipping 50 matching lines @@
           break;
         }
       }
       ASSERT_TRUE(found);
     }
   }
 
   void ExtractMatchPositions(const std::string& string,
                              Snippet::MatchPositions* matches) {
     std::vector<std::string> match_strings;
-    SplitString(string, ':', &match_strings);
+    base::SplitString(string, ':', &match_strings);
     for (size_t i = 0; i < match_strings.size(); ++i) {
       std::vector<std::string> chunks;
-      SplitString(match_strings[i], ',', &chunks);
+      base::SplitString(match_strings[i], ',', &chunks);
       ASSERT_EQ(2U, chunks.size());
       matches->push_back(Snippet::MatchPosition());
       int chunks0, chunks1;
       base::StringToInt(chunks[0], &chunks0);
       base::StringToInt(chunks[1], &chunks1);
       matches->back().first = chunks0;
       matches->back().second = chunks1;
     }
   }
 
@@ skipping 43 matching lines @@
       "ab cdef ghij"},
 
     // Title with term multiple times.
     { "ab ab",                      "ab",       "ab ab"},
 
     // Make sure quotes don't do a prefix match.
     { "think",                      "\"thi\"",  ""},
   };
   for (size_t i = 0; i < ARRAYSIZE_UNSAFE(data); ++i) {
     std::vector<std::string> titles;
-    SplitString(data[i].input, ';', &titles);
+    base::SplitString(data[i].input, ';', &titles);
     AddBookmarksWithTitles(titles);
 
     std::vector<std::string> expected;
     if (!data[i].expected.empty())
-      SplitString(data[i].expected, ';', &expected);
+      base::SplitString(data[i].expected, ';', &expected);
 
     ExpectMatches(data[i].query, expected);
 
     model_.reset(new BookmarkModel(NULL));
   }
 }
 
 // Makes sure match positions are updated appropriately.
 TEST_F(BookmarkIndexTest, MatchPositions) {
   struct TestData {
@@ skipping 140 matching lines @@
 
   matches.clear();
   // Select top two matches.
   model->GetBookmarksWithTitlesMatching(ASCIIToUTF16("google"), 2, &matches);
 
   EXPECT_EQ(2, static_cast<int>(matches.size()));
   EXPECT_EQ(data[0].url, matches[0].node->GetURL());
   EXPECT_EQ(data[3].url, matches[1].node->GetURL());
 }