Fine-tune HQP Candidate Result Scoring

chrome/browser/autocomplete/history_quick_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/history_quick_provider.h"
 
 #include <algorithm>
 #include <functional>
 #include <set>
 #include <string>
@@ skipping 29 matching lines @@
   {"http://www.google.com/", "Google", 3, 3, 0},
   {"http://slashdot.org/favorite_page.html", "Favorite page", 200, 100, 0},
   {"http://kerneltrap.org/not_very_popular.html", "Less popular", 4, 0, 0},
   {"http://freshmeat.net/unpopular.html", "Unpopular", 1, 1, 0},
   {"http://news.google.com/?ned=us&topic=n", "Google News - U.S.", 2, 2, 0},
   {"http://news.google.com/", "Google News", 1, 1, 0},
   {"http://foo.com/", "Dir", 200, 100, 0},
   {"http://foo.com/dir/", "Dir", 2, 1, 10},
   {"http://foo.com/dir/another/", "Dir", 5, 1, 0},
   {"http://foo.com/dir/another/again/", "Dir", 5, 1, 0},
-  {"http://foo.com/dir/another/again/myfile.html", "File", 10, 2, 0},
+  {"http://foo.com/dir/another/again/myfile.html", "File", 3, 2, 0},
   {"http://visitedest.com/y/a", "VA", 10, 1, 20},
   {"http://visitedest.com/y/b", "VB", 9, 1, 20},
   {"http://visitedest.com/x/c", "VC", 8, 1, 20},
   {"http://visitedest.com/x/d", "VD", 7, 1, 20},
   {"http://visitedest.com/y/e", "VE", 6, 1, 20},
   {"http://typeredest.com/y/a", "TA", 3, 5, 0},
   {"http://typeredest.com/y/b", "TB", 3, 4, 0},
   {"http://typeredest.com/x/c", "TC", 3, 3, 0},
   {"http://typeredest.com/x/d", "TD", 3, 2, 0},
   {"http://typeredest.com/y/e", "TE", 3, 1, 0},
@@ skipping 195 matching lines @@
           ASCIIToUTF16("slashdot.org/favorite_page.html"));
 }
 
 TEST_F(HistoryQuickProviderTest, MultiMatch) {
   std::vector<std::string> expected_urls;
   // Scores high because of typed_count.
   expected_urls.push_back("http://foo.com/");
   // Scores high because of visit count.
   expected_urls.push_back("http://foo.com/dir/another/");
   // Scores high because of high visit count.
-  expected_urls.push_back("http://foo.com/dir/another/again/myfile.html");
+  expected_urls.push_back("http://foo.com/dir/another/again/");
   RunTest(ASCIIToUTF16("foo"), expected_urls, "http://foo.com/", true,
           ASCIIToUTF16("foo.com"));
 }
 
 TEST_F(HistoryQuickProviderTest, StartRelativeMatch) {
   std::vector<std::string> expected_urls;
   expected_urls.push_back("http://xyzabcdefghijklmnopqrstuvw.com/a");
   expected_urls.push_back("http://abcxyzdefghijklmnopqrstuvw.com/a");
   expected_urls.push_back("http://abcdefxyzghijklmnopqrstuvw.com/a");
   RunTest(ASCIIToUTF16("xyz"), expected_urls,
@@ skipping 171 matching lines @@
             kMaxNonInliningScore - 1);
   EXPECT_EQ(next_score, kMaxNonInliningScore - 2);
 
   // Low score, can inline, not clamped.
   next_score = 1500;
   match.raw_score = 500;
   match.can_inline = true;
   EXPECT_EQ(HistoryQuickProvider::CalculateRelevance(match, &next_score), 500);
   EXPECT_EQ(next_score, 499);
 }