app_list: Search result launch history and boost.

chrome/browser/ui/app_list/search/mixer.cc

 // Copyright 2013 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/app_list/search/mixer.h"
 
 #include <algorithm>
 #include <set>
 #include <string>
 #include <vector>
@@ skipping 88 matching lines @@
   Group(size_t max_results, double boost)
       : max_results_(max_results),
         boost_(boost) {
   }
   ~Group() {}
 
   void AddProvider(SearchProvider* provider) {
     providers_.push_back(provider);
   }
 
-  void FetchResults() {
+  void FetchResults(const KnownResults& known_results) {
     results_.clear();
 
     for (Providers::const_iterator provider_it = providers_.begin();
          provider_it != providers_.end();
          ++provider_it) {
       for (SearchProvider::Results::const_iterator
                result_it = (*provider_it)->results().begin();
                result_it != (*provider_it)->results().end();
                ++result_it) {
         DCHECK_GE((*result_it)->relevance(), 0.0);
         DCHECK_LE((*result_it)->relevance(), 1.0);
         DCHECK(!(*result_it)->id().empty());
 
+        double boost = boost_;
+        KnownResults::const_iterator known_it =
+            known_results.find((*result_it)->id());
+        if (known_it != known_results.end()) {
+          switch (known_it->second) {
+            case PERFECT_PRIMARY:
+              boost = 4.0;
+              break;
+            case PREFIX_PRIMARY:
+              boost = 3.75;
+              break;
+            case PERFECT_SECONDARY:
+              boost = 3.25;
+              break;
+            case PREFIX_SECONDARY:
+              boost = 3.0;
+              break;
+            case UNKNOWN_RESULT:
+              NOTREACHED() << "Unknown result in KnownResults?";
+              break;
+          }
+        }
+
         results_.push_back(
-            SortData(*result_it, (*result_it)->relevance() + boost_));
+            SortData(*result_it, (*result_it)->relevance() + boost));
       }
     }
 
     std::sort(results_.begin(), results_.end());
     if (max_results_ != kNoMaxResultsLimit && results_.size() > max_results_)
       results_.resize(max_results_);
   }
 
   const SortedResults& results() const { return results_; }
 
@@ skipping 16 matching lines @@
   groups_.push_back(new Group(kMaxMainGroupResults, 2.0));
   groups_.push_back(new Group(kNoMaxResultsLimit, 1.0));
   groups_.push_back(new Group(kMaxWebstoreResults, 0.0));
 }
 
 void Mixer::AddProviderToGroup(GroupId group, SearchProvider* provider) {
   size_t group_index = static_cast<size_t>(group);
   groups_[group_index]->AddProvider(provider);
 }
 
-void Mixer::MixAndPublish() {
-  FetchResults();
+void Mixer::MixAndPublish(const KnownResults& known_results) {
+  FetchResults(known_results);
 
   SortedResults results;
   results.reserve(kMaxResults);
 
   // Adds main group and web store results first.
   results.insert(results.end(),
                  groups_[MAIN_GROUP]->results().begin(),
                  groups_[MAIN_GROUP]->results().end());
   results.insert(results.end(),
                  groups_[WEBSTORE_GROUP]->results().begin(),
@@ skipping 17 matching lines @@
                  groups_[OMNIBOX_GROUP]->results().begin() + remaining_slots);
 
   std::sort(results.begin(), results.end());
   RemoveDuplicates(&results);
   if (results.size() > kMaxResults)
     results.resize(kMaxResults);
 
   Publish(results, ui_results_);
 }
 
-void Mixer::FetchResults() {
+void Mixer::FetchResults(const KnownResults& known_results) {
   for (Groups::iterator group_it = groups_.begin();
        group_it != groups_.end();
        ++group_it) {
-    (*group_it)->FetchResults();
+    (*group_it)->FetchResults(known_results);
   }
 }
 
 }  // namespace app_list