Hooking the discovery API to the NTP.

chrome/browser/ui/webui/ntp/suggestions_combiner.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/ui/webui/ntp/suggestions_combiner.h"
 
 #include <algorithm>
 
 #include "base/values.h"
+#include "chrome/browser/extensions/api/discovery/suggested_links_registry.h"
+#include "chrome/browser/extensions/api/discovery/suggested_links_registry_factory.h"
 #include "chrome/browser/profiles/profile.h"
 #include "chrome/browser/ui/webui/ntp/suggestions_page_handler.h"
 #include "chrome/browser/ui/webui/ntp/suggestions_source.h"
 #include "chrome/browser/ui/webui/ntp/suggestions_source_discovery.h"
 #include "chrome/browser/ui/webui/ntp/suggestions_source_top_sites.h"
 
 namespace {
 
 static const size_t kSuggestionsCount = 8;
 
@@ skipping 34 matching lines @@
     delegate_->OnSuggestionsReady();
   }
 }
 
 void SuggestionsCombiner::SetSuggestionsCount(size_t suggestions_count) {
   suggestions_count_ = suggestions_count;
 }
 
 // static
 SuggestionsCombiner* SuggestionsCombiner::Create(
-    SuggestionsCombiner::Delegate* delegate) {
+    SuggestionsCombiner::Delegate* delegate, Profile* profile) {
   SuggestionsCombiner* combiner = new SuggestionsCombiner(delegate);
   combiner->AddSource(new SuggestionsSourceTopSites());
-  combiner->AddSource(new SuggestionsSourceDiscovery());
+
+  extensions::SuggestedLinksRegistry* registry =
+      extensions::SuggestedLinksRegistryFactory::GetForProfile(profile);
+  scoped_ptr<std::vector<std::string> > list = registry->GetExtensionIds();
+  for (std::vector<std::string>::iterator it = list->begin();
+      it != list->end(); ++it) {
+    combiner->AddSource(new SuggestionsSourceDiscovery(*it));
+  }
+
   return combiner;
 }
 
 void SuggestionsCombiner::FillPageValues() {
   int total_weight = 0;
   for (size_t i = 0; i < sources_.size(); ++i)
     total_weight += sources_[i]->GetWeight();
   DCHECK_GT(total_weight, 0);
 
   page_values_.reset(new base::ListValue());
@@ skipping 25 matching lines @@
       page_values_->GetSize() < suggestions_count_; ++i) {
 
     size_t index = next_item_index_for_source[i] + extra_items_added;
     while (page_values_->GetSize() < suggestions_count_ &&
         (item = sources_[i]->PopItem())) {
       page_values_->Insert(index++, item);
       extra_items_added++;
     }
   }
 }