Revert 212459 "Remove TextDatabase from the history service."

trunk/src/chrome/browser/history/visit_database_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 <set>
 #include <vector>
 
 #include "base/files/file_path.h"
 #include "base/files/scoped_temp_dir.h"
 #include "base/path_service.h"
@@ skipping 11 matching lines @@
 namespace history {
 
 namespace {
 
 bool IsVisitInfoEqual(const VisitRow& a,
                       const VisitRow& b) {
   return a.visit_id == b.visit_id &&
          a.url_id == b.url_id &&
          a.visit_time == b.visit_time &&
          a.referring_visit == b.referring_visit &&
-         a.transition == b.transition;
+         a.transition == b.transition &&
+         a.is_indexed == b.is_indexed;
 }
 
 }  // namespace
 
 class VisitDatabaseTest : public PlatformTest,
                           public URLDatabase,
                           public VisitDatabase {
  public:
   VisitDatabaseTest() {
   }
@@ skipping 97 matching lines @@
   // Make something in the database.
   VisitRow original(1, Time::Now(), 23, content::PageTransitionFromInt(0), 19);
   AddVisit(&original, SOURCE_BROWSED);
 
   // Mutate that row.
   VisitRow modification(original);
   modification.url_id = 2;
   modification.transition = content::PAGE_TRANSITION_TYPED;
   modification.visit_time = Time::Now() + TimeDelta::FromDays(1);
   modification.referring_visit = 9292;
+  modification.is_indexed = true;
   UpdateVisitRow(modification);
 
   // Check that the mutated version was written.
   VisitRow final;
   GetRowForVisit(original.visit_id, &final);
   EXPECT_TRUE(IsVisitInfoEqual(modification, final));
 }
 
 // TODO(brettw) write test for GetMostRecentVisitForURL!
 
@@ skipping 218 matching lines @@
   ASSERT_EQ(1U, sources.size());
   EXPECT_EQ(SOURCE_SYNCED, sources[matches[0].visit_id]);
 
   ASSERT_TRUE(GetVisitsForURL(113, &matches));
   ASSERT_EQ(1U, matches.size());
   GetVisitsSource(matches, &sources);
   ASSERT_EQ(1U, sources.size());
   EXPECT_EQ(SOURCE_EXTENSION, sources[matches[0].visit_id]);
 }
 
+TEST_F(VisitDatabaseTest, GetIndexedVisits) {
+  // Add non-indexed visits.
+  int url_id = 111;
+  VisitRow visit_info1(
+      url_id, Time::Now(), 0, content::PAGE_TRANSITION_LINK, 0);
+  ASSERT_TRUE(AddVisit(&visit_info1, SOURCE_BROWSED));
+
+  VisitRow visit_info2(
+      url_id, Time::Now(), 0, content::PAGE_TRANSITION_TYPED, 0);
+  ASSERT_TRUE(AddVisit(&visit_info2, SOURCE_SYNCED));
+
+  std::vector<VisitRow> visits;
+  EXPECT_TRUE(GetVisitsForURL(url_id, &visits));
+  EXPECT_EQ(static_cast<size_t>(2), visits.size());
+  EXPECT_TRUE(GetIndexedVisitsForURL(url_id, &visits));
+  EXPECT_EQ(static_cast<size_t>(0), visits.size());
+
+  VisitRow visit_info3(
+      url_id, Time::Now(), 2, content::PAGE_TRANSITION_TYPED, 0);
+  visit_info3.is_indexed = true;
+  ASSERT_TRUE(AddVisit(&visit_info3, SOURCE_SYNCED));
+  EXPECT_TRUE(GetVisitsForURL(url_id, &visits));
+  EXPECT_EQ(static_cast<size_t>(3), visits.size());
+  EXPECT_TRUE(GetIndexedVisitsForURL(url_id, &visits));
+  EXPECT_EQ(static_cast<size_t>(1), visits.size());
+}
+
 }  // namespace history