Rip out browser-side RID caching for most visited items.

chrome/browser/search/search.h

 // Copyright 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.
 
 #ifndef CHROME_BROWSER_SEARCH_SEARCH_H_
 #define CHROME_BROWSER_SEARCH_SEARCH_H_
 
 #include <string>
 #include <utility>
 #include <vector>
 
 #include "base/basictypes.h"
 #include "base/string16.h"
+#include "chrome/common/instant_types.h"
 
 class GURL;
 class Profile;
 class TemplateURL;
 class TemplateURLRef;
 
 namespace content {
 class NavigationEntry;
 class WebContents;
 }
@@ skipping 191 matching lines @@
                                        int start_margin);
 
 // Returns whether the default search provider has a valid Instant URL in its
 // template. Exposed for testing only.
 bool DefaultSearchProviderSupportsInstant(Profile* profile);
 
 // Let tests reset the gate that prevents metrics from being sent more than
 // once.
 void ResetInstantExtendedOptInStateGateForTest();
 
+// Returns true if |new_items| and |old_items| are equal.

[Jered, 2013/05/31 17:34:33]

Instead of "new" and "old", you can just call these items_a and items_b or
something (the names should reflect that the test is symmetric.)

[kmadhusu, 2013/06/04 02:36:01]

Done.

+bool AreMostVisitedItemsEqual(
+    const std::vector<InstantMostVisitedItem>& new_items,
+    const std::vector<InstantMostVisitedItem>& old_items);
+
 }  // namespace chrome
 
 #endif  // CHROME_BROWSER_SEARCH_SEARCH_H_