Move Range code to gfx.

chrome/browser/ui/app_list/search/tokenized_string_match_unittest.cc

 // Copyright 2013 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 "base/basictypes.h"
 #include "base/strings/utf_string_conversions.h"
 #include "chrome/browser/ui/app_list/search/tokenized_string_match.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace app_list {
 namespace test {
 
 // Returns a string of |text| marked the hits in |match| using block bracket.
 // e.g. text= "Text", hits = [{0,1}], returns "[T]ext".
 std::string MatchHit(const string16& text,
                      const TokenizedStringMatch& match) {
   string16 marked = text;
 
   const TokenizedStringMatch::Hits& hits = match.hits();
   for (TokenizedStringMatch::Hits::const_reverse_iterator it = hits.rbegin();
        it != hits.rend(); ++it) {
-    const ui::Range& hit = *it;
+    const gfx::Range& hit = *it;
     marked.insert(hit.end(), 1, ']');
     marked.insert(hit.start(), 1, '[');
   }
 
   return UTF16ToUTF8(marked);
 }
 
 TEST(TokenizedStringMatchTest, NotMatch) {
   struct {
     const char* text;
@@ skipping 71 matching lines @@
     EXPECT_LT(match_low.relevance(), match_high.relevance())
         << "Test case " << i
         << " : text=" << kTestCases[i].text
         << ", query_low=" << kTestCases[i].query_low
         << ", query_high=" << kTestCases[i].query_high;
   }
 }
 
 }  // namespace test
 }  // namespace app_list