Move InMemoryURLIndex into chrome/browser/autocomplete

components/history/core/browser/in_memory_url_index_types_unittest.cc

Index: components/history/core/browser/in_memory_url_index_types_unittest.cc
diff --git a/components/history/core/browser/in_memory_url_index_types_unittest.cc b/components/history/core/browser/in_memory_url_index_types_unittest.cc
deleted file mode 100644
index c10f1c0043cf22e5061d4188b572063b9e81fbce..0000000000000000000000000000000000000000
--- a/components/history/core/browser/in_memory_url_index_types_unittest.cc
+++ /dev/null
@@ -1,150 +0,0 @@
-// 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 "components/history/core/browser/in_memory_url_index_types.h"
-
-#include <algorithm>
-
-#include "base/strings/string16.h"
-#include "base/strings/utf_string_conversions.h"
-#include "testing/gtest/include/gtest/gtest.h"
-
-using base::UTF8ToUTF16;
-
-namespace history {
-
-// Helper function for verifying that the contents of a C++ iterable container
-// of ints matches a C array ints.
-template <typename T>
-bool IntArraysEqual(const size_t* expected,
-                    size_t expected_size,
-                    const T& actual) {
-  if (expected_size != actual.size())
-    return false;
-  for (size_t i = 0; i < expected_size; ++i)
-    if (expected[i] != actual[i])
-      return false;
-  return true;
-}
-
-class InMemoryURLIndexTypesTest : public testing::Test {
-};
-
-TEST_F(InMemoryURLIndexTypesTest, StaticFunctions) {
-  // Test String16VectorFromString16
-  base::string16 string_a(
-      base::UTF8ToUTF16("http://www.google.com/ frammy  the brammy"));
-  WordStarts actual_starts_a;
-  String16Vector string_vec =
-      String16VectorFromString16(string_a, false, &actual_starts_a);
-  ASSERT_EQ(7U, string_vec.size());
-  // See if we got the words we expected.
-  EXPECT_EQ(UTF8ToUTF16("http"), string_vec[0]);
-  EXPECT_EQ(UTF8ToUTF16("www"), string_vec[1]);
-  EXPECT_EQ(UTF8ToUTF16("google"), string_vec[2]);
-  EXPECT_EQ(UTF8ToUTF16("com"), string_vec[3]);
-  EXPECT_EQ(UTF8ToUTF16("frammy"), string_vec[4]);
-  EXPECT_EQ(UTF8ToUTF16("the"), string_vec[5]);
-  EXPECT_EQ(UTF8ToUTF16("brammy"), string_vec[6]);
-  // Verify the word starts.
-  size_t expected_starts_a[] = {0, 7, 11, 18, 23, 31, 35};
-  EXPECT_TRUE(IntArraysEqual(expected_starts_a, arraysize(expected_starts_a),
-                             actual_starts_a));
-
-  WordStarts actual_starts_b;
-  string_vec = String16VectorFromString16(string_a, true, &actual_starts_b);
-  ASSERT_EQ(5U, string_vec.size());
-  EXPECT_EQ(UTF8ToUTF16("http://"), string_vec[0]);
-  EXPECT_EQ(UTF8ToUTF16("www.google.com/"), string_vec[1]);
-  EXPECT_EQ(UTF8ToUTF16("frammy"), string_vec[2]);
-  EXPECT_EQ(UTF8ToUTF16("the"), string_vec[3]);
-  EXPECT_EQ(UTF8ToUTF16("brammy"), string_vec[4]);
-  size_t expected_starts_b[] = {0, 7, 23, 31, 35};
-  EXPECT_TRUE(IntArraysEqual(expected_starts_b, arraysize(expected_starts_b),
-                             actual_starts_b));
-
-  base::string16 string_c(base::ASCIIToUTF16(
-      " funky%20string-with=@strange   sequences, intended(to exceed)"));
-  WordStarts actual_starts_c;
-  string_vec = String16VectorFromString16(string_c, false, &actual_starts_c);
-  ASSERT_EQ(8U, string_vec.size());
-  // Note that we stop collecting words and word starts at kMaxSignificantChars.
-  size_t expected_starts_c[] = {1, 7, 16, 22, 32, 43, 52, 55};
-  EXPECT_TRUE(IntArraysEqual(expected_starts_c, arraysize(expected_starts_c),
-                             actual_starts_c));
-
-  // Test String16SetFromString16
-  base::string16 string_d(base::ASCIIToUTF16(
-      "http://web.google.com/search Google Web Search"));
-  WordStarts actual_starts_d;
-  String16Set string_set = String16SetFromString16(string_d, &actual_starts_d);
-  EXPECT_EQ(5U, string_set.size());
-  // See if we got the words we expected.
-  EXPECT_TRUE(string_set.find(UTF8ToUTF16("com")) != string_set.end());
-  EXPECT_TRUE(string_set.find(UTF8ToUTF16("google")) != string_set.end());
-  EXPECT_TRUE(string_set.find(UTF8ToUTF16("http")) != string_set.end());
-  EXPECT_TRUE(string_set.find(UTF8ToUTF16("search")) != string_set.end());
-  EXPECT_TRUE(string_set.find(UTF8ToUTF16("web")) != string_set.end());
-  size_t expected_starts_d[] = {0, 7, 11, 18, 22, 29, 36, 40};
-  EXPECT_TRUE(IntArraysEqual(expected_starts_d, arraysize(expected_starts_d),
-                             actual_starts_d));
-
-  // Test SortAndDeoverlapMatches
-  TermMatches matches_e;
-  matches_e.push_back(TermMatch(1, 13, 10));
-  matches_e.push_back(TermMatch(2, 23, 10));
-  matches_e.push_back(TermMatch(3, 3, 10));
-  matches_e.push_back(TermMatch(4, 40, 5));
-  TermMatches matches_f = SortAndDeoverlapMatches(matches_e);
-  // Nothing should have been eliminated.
-  EXPECT_EQ(matches_e.size(), matches_f.size());
-  // The order should now be 3, 1, 2, 4.
-  EXPECT_EQ(3, matches_f[0].term_num);
-  EXPECT_EQ(1, matches_f[1].term_num);
-  EXPECT_EQ(2, matches_f[2].term_num);
-  EXPECT_EQ(4, matches_f[3].term_num);
-  matches_e.push_back(TermMatch(5, 18, 10));
-  matches_e.push_back(TermMatch(6, 38, 5));
-  matches_f = SortAndDeoverlapMatches(matches_e);
-  // Two matches should have been eliminated.
-  EXPECT_EQ(matches_e.size() - 2, matches_f.size());
-  // The order should now be 3, 1, 2, 6.
-  EXPECT_EQ(3, matches_f[0].term_num);
-  EXPECT_EQ(1, matches_f[1].term_num);
-  EXPECT_EQ(2, matches_f[2].term_num);
-  EXPECT_EQ(6, matches_f[3].term_num);
-
-  // Test MatchTermInString
-  TermMatches matches_g = MatchTermInString(
-      UTF8ToUTF16("x"), UTF8ToUTF16("axbxcxdxex fxgx/hxixjx.kx"), 123);
-  const size_t expected_offsets[] = { 1, 3, 5, 7, 9, 12, 14, 17, 19, 21, 24 };
-  ASSERT_EQ(arraysize(expected_offsets), matches_g.size());
-  for (size_t i = 0; i < arraysize(expected_offsets); ++i)
-    EXPECT_EQ(expected_offsets[i], matches_g[i].offset);
-}
-
-TEST_F(InMemoryURLIndexTypesTest, OffsetsAndTermMatches) {
-  // Test OffsetsFromTermMatches
-  TermMatches matches_a;
-  matches_a.push_back(TermMatch(1, 1, 2));
-  matches_a.push_back(TermMatch(2, 4, 3));
-  matches_a.push_back(TermMatch(3, 9, 1));
-  matches_a.push_back(TermMatch(3, 10, 1));
-  matches_a.push_back(TermMatch(4, 14, 5));
-  std::vector<size_t> offsets = OffsetsFromTermMatches(matches_a);
-  const size_t expected_offsets_a[] = {1, 3, 4, 7, 9, 10, 10, 11, 14, 19};
-  ASSERT_EQ(offsets.size(), arraysize(expected_offsets_a));
-  for (size_t i = 0; i < offsets.size(); ++i)
-    EXPECT_EQ(expected_offsets_a[i], offsets[i]);
-
-  // Test ReplaceOffsetsInTermMatches
-  offsets[4] = base::string16::npos;  // offset of third term
-  TermMatches matches_b = ReplaceOffsetsInTermMatches(matches_a, offsets);
-  const size_t expected_offsets_b[] = {1, 4, 10, 14};
-  ASSERT_EQ(arraysize(expected_offsets_b), matches_b.size());
-  for (size_t i = 0; i < matches_b.size(); ++i)
-    EXPECT_EQ(expected_offsets_b[i], matches_b[i].offset);
-}
-
-}  // namespace history