Removes the link in the omnibox for searching history.

chrome/browser/autocomplete/autocomplete_match.cc

 // Copyright (c) 2010 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 "base/logging.h"
 #include "chrome/browser/autocomplete/autocomplete_match.h"
 #include "grit/theme_resources.h"
 
 // AutocompleteMatch ----------------------------------------------------------
 
@@ skipping 33 matching lines @@
     "url-what-you-typed",
     "history-url",
     "history-title",
     "history-body",
     "history-keyword",
     "navsuggest",
     "search-what-you-typed",
     "search-history",
     "search-suggest",
     "search-other-engine",
-    "open-history-page",
   };
   DCHECK(arraysize(strings) == NUM_TYPES);
   return strings[type];
 }
 
 // static
 int AutocompleteMatch::TypeToIcon(Type type) {
   int icons[NUM_TYPES] = {
     IDR_OMNIBOX_HTTP,
     IDR_OMNIBOX_HTTP,
     IDR_OMNIBOX_HISTORY,
     IDR_OMNIBOX_HISTORY,
     IDR_OMNIBOX_HISTORY,
     IDR_OMNIBOX_HTTP,
     IDR_OMNIBOX_SEARCH,
     IDR_OMNIBOX_SEARCH,
     IDR_OMNIBOX_SEARCH,
     IDR_OMNIBOX_SEARCH,
-    IDR_OMNIBOX_MORE,
   };
   DCHECK(arraysize(icons) == NUM_TYPES);
   return icons[type];
 }
 
 // static
 bool AutocompleteMatch::MoreRelevant(const AutocompleteMatch& elem1,
                                      const AutocompleteMatch& elem2) {
   // For equal-relevance matches, we sort alphabetically, so that providers
   // who return multiple elements at the same priority get a "stable" sort
   // across multiple updates.
   if (elem1.relevance == elem2.relevance)
     return elem1.contents > elem2.contents;
 
   // A negative relevance indicates the real relevance can be determined by

[Peter Kasting, 2011/01/19 20:02:36]

Nit: The negative stuff can all go away?

   // negating the value. If both relevances are negative, negate the result
   // so that we end up with positive relevances, then negative relevances with
   // the negative relevances sorted by absolute values.
   const bool result = elem1.relevance > elem2.relevance;
   return (elem1.relevance < 0 && elem2.relevance < 0) ? !result : result;
 }
 
 // static
 bool AutocompleteMatch::DestinationSortFunc(const AutocompleteMatch& elem1,
                                             const AutocompleteMatch& elem2) {
@@ skipping 80 matching lines @@
   // The classifications should always be sorted.
   size_t last_offset = classifications[0].offset;
   for (ACMatchClassifications::const_iterator i(classifications.begin() + 1);
        i != classifications.end(); ++i) {
     DCHECK(i->offset > last_offset) << "Classification unsorted";
     DCHECK(i->offset < text.length()) << "Classification out of bounds";
     last_offset = i->offset;
   }
 }
 #endif