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

chrome/browser/search/search.h

Index: chrome/browser/search/search.h
diff --git a/chrome/browser/search/search.h b/chrome/browser/search/search.h
index 8d2a8cb7ba47a01d9126e754e0431d4ec10e40db..9e68ab1a1cbebd0dea11f938171d3e7fbd046961 100644
--- a/chrome/browser/search/search.h
+++ b/chrome/browser/search/search.h
@@ -11,6 +11,7 @@
 
 #include "base/basictypes.h"
 #include "base/string16.h"
+#include "chrome/common/instant_types.h"
 
 class GURL;
 class Profile;
@@ -222,6 +223,11 @@ bool DefaultSearchProviderSupportsInstant(Profile* profile);
 // 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_