Sort experimental app list search result groups.

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 "ui/app_list/search/mixer.h"
 
 #include <algorithm>
 #include <map>
 #include <set>
 #include <string>
@@ skipping 193 matching lines @@
 
   // Add items back to |ui_results| in the order of |new_results|.
   for (const SortData& sort_data : new_results) {
     const SearchResult& new_result = *sort_data.result;
     IdToResultMap::const_iterator ui_result_it =
         ui_results_map.find(new_result.id());
     if (ui_result_it != ui_results_map.end()) {
       // Update and use the old result if it exists.
       SearchResult* ui_result = ui_result_it->second;
       UpdateResult(new_result, ui_result);
+      ui_result->set_relevance(sort_data.score);
 
       // |ui_results| takes back ownership from |ui_results_map| here.
       ui_results->Add(ui_result);
 
       // Remove the item from the map so that it ends up only with unused
       // results.
       ui_results_map.erase(ui_result->id());
     } else {
+      scoped_ptr<SearchResult> result_copy = new_result.Duplicate();
+      result_copy->set_relevance(sort_data.score);
       // Copy the result from |new_results| otherwise.
-      ui_results->Add(new_result.Duplicate().release());
+      ui_results->Add(result_copy.release());
     }
   }
 
   // Delete the results remaining in the map as they are not in the new results.
   for (const auto& ui_result : ui_results_map) {
     delete ui_result.second;
   }
 }
 
 void Mixer::RemoveDuplicates(SortedResults* results) {
@@ skipping 13 matching lines @@
   results->swap(final);
 }
 
 void Mixer::FetchResults(bool is_voice_query,
                          const KnownResults& known_results) {
   for (const auto& item : groups_)
     item.second->FetchResults(is_voice_query, known_results);
 }
 
 }  // namespace app_list