Update some uses of UTF conversions in chrome/browser to use the base:: namespace.

chrome/browser/autocomplete/bookmark_provider_unittest.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/autocomplete/bookmark_provider.h"
 
 #include <algorithm>
 #include <string>
 #include <vector>
 
@@ skipping 64 matching lines @@
   DCHECK(profile_.get());
   provider_ = new BookmarkProvider(this, profile_.get());
   DCHECK(provider_.get());
   provider_->set_bookmark_model_for_testing(model_.get());
 
   const BookmarkNode* other_node = model_->other_node();
   for (size_t i = 0; i < ARRAYSIZE_UNSAFE(bookmark_provider_test_data); ++i) {
     const BookmarksTestInfo& cur(bookmark_provider_test_data[i]);
     const GURL url(cur.url);
     model_->AddURL(other_node, other_node->child_count(),
-                   ASCIIToUTF16(cur.title), url);
+                   base::ASCIIToUTF16(cur.title), url);
   }
 }
 
 // Structures and functions supporting the BookmarkProviderTest.Positions
 // unit test.
 
 struct TestBookmarkPosition {
   TestBookmarkPosition(size_t begin, size_t end)
       : begin(begin), end(end) {}
 
@@ skipping 15 matching lines @@
   }
   position_string += "}\n";
   return position_string;
 }
 
 // Return the positions in |matches| as a formatted string for unit test
 // diagnostic output.
 base::string16 MatchesAsString16(const ACMatches& matches) {
   base::string16 matches_string;
   for (ACMatches::const_iterator i = matches.begin(); i != matches.end(); ++i) {
-    matches_string.append(ASCIIToUTF16("    '"));
+    matches_string.append(base::ASCIIToUTF16("    '"));
     matches_string.append(i->description);
-    matches_string.append(ASCIIToUTF16("'\n"));
+    matches_string.append(base::ASCIIToUTF16("'\n"));
   }
   return matches_string;
 }
 
 // Comparison function for sorting search terms by descending length.
 bool TestBookmarkPositionsEqual(const TestBookmarkPosition& pos_a,
                                 const TestBookmarkPosition& pos_b) {
   return pos_a.begin == pos_b.begin && pos_a.end == pos_b.end;
 }
 
@@ skipping 101 matching lines @@
     {"\"carry carbo\"",       0, {{{0, 0}}}},
     // This set uses duplicated and/or overlaps search terms in the title.
     {"frank",                 1, {{{0, 5}, {8, 13}, {16, 21}, {0, 0}}}},
     {"frankly",               1, {{{0, 7}, {8, 15}, {0, 0}}}},
     {"frankly frankly",       1, {{{0, 7}, {8, 15}, {0, 0}}}},
     {"foobar foo",            1, {{{0, 6}, {7, 13}, {0, 0}}}},
     {"foo foobar",            1, {{{0, 6}, {7, 13}, {0, 0}}}},
   };
 
   for (size_t i = 0; i < ARRAYSIZE_UNSAFE(query_data); ++i) {
-    AutocompleteInput input(ASCIIToUTF16(query_data[i].query),
+    AutocompleteInput input(base::ASCIIToUTF16(query_data[i].query),
                             base::string16::npos, base::string16(), GURL(),
                             AutocompleteInput::INVALID_SPEC, false, false,
                             false, AutocompleteInput::ALL_MATCHES);
     provider_->Start(input, false);
     const ACMatches& matches(provider_->matches());
     // Validate number of results is as expected.
     EXPECT_LE(matches.size(), query_data[i].match_count)
         << "One or more of the following matches were unexpected:\n"
         << MatchesAsString16(matches)
         << "For query '" << query_data[i].query << "'.";
@@ skipping 53 matching lines @@
     {"worms",     2, {"burning worms #2",    // boosted
                       "burning worms #1"}},  // not boosted
     // Ranking of prefix matches with URL boost. Note that a query of
     // "worm burn" will have the same results.
     {"burn worm", 3, {"burning worms #2",    // boosted
                       "worming burns #20",   // boosted
                       "burning worms #1"}},  // not boosted but shorter
   };
 
   for (size_t i = 0; i < ARRAYSIZE_UNSAFE(query_data); ++i) {
-    AutocompleteInput input(ASCIIToUTF16(query_data[i].query),
+    AutocompleteInput input(base::ASCIIToUTF16(query_data[i].query),
                             base::string16::npos, base::string16(), GURL(),
                             AutocompleteInput::INVALID_SPEC, false, false,
                             false, AutocompleteInput::ALL_MATCHES);
     provider_->Start(input, false);
     const ACMatches& matches(provider_->matches());
     // Validate number and content of results is as expected.
     for (size_t j = 0; j < std::max(query_data[i].match_count, matches.size());
          ++j) {
       EXPECT_LT(j, query_data[i].match_count) << "    Unexpected match '"
-          << UTF16ToUTF8(matches[j].description) << "' for query: '"
+          << base::UTF16ToUTF8(matches[j].description) << "' for query: '"
           <<  query_data[i].query << "'.";
       if (j >= query_data[i].match_count)
         continue;
       EXPECT_LT(j, matches.size()) << "    Missing match '"
           << query_data[i].matches[j] << "' for query: '"
           << query_data[i].query << "'.";
       if (j >= matches.size())
         continue;
-      EXPECT_EQ(query_data[i].matches[j], UTF16ToUTF8(matches[j].description))
+      EXPECT_EQ(query_data[i].matches[j],
+                base::UTF16ToUTF8(matches[j].description))
           << "    Mismatch at [" << base::IntToString(j) << "] for query '"
           << query_data[i].query << "'.";
       EXPECT_FALSE(matches[j].allowed_to_be_default_match);
     }
   }
 }