Enhance chrome://omnibox Presentation

chrome/browser/autocomplete/autocomplete_match.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/autocomplete/autocomplete_match.h"
 
+#include "base/i18n/time_formatting.h"
 #include "base/logging.h"
 #include "base/string_number_conversions.h"
 #include "base/string_util.h"
+#include "base/string16.h"
+#include "base/stringprintf.h"
+#include "base/time.h"
+#include "base/utf_string_conversions.h"
 #include "chrome/browser/autocomplete/autocomplete_provider.h"
 #include "chrome/browser/search_engines/template_url.h"
 #include "chrome/browser/search_engines/template_url_service.h"
 #include "chrome/browser/search_engines/template_url_service_factory.h"
 #include "grit/theme_resources.h"
 
 // AutocompleteMatch ----------------------------------------------------------
 
 // static
 const char16 AutocompleteMatch::kInvalidChars[] = {
@@ skipping 48 matching lines @@
       transition(match.transition),
       is_history_what_you_typed_match(match.is_history_what_you_typed_match),
       type(match.type),
       associated_keyword(match.associated_keyword.get() ?
           new AutocompleteMatch(*match.associated_keyword) : NULL),
       keyword(match.keyword),
       starred(match.starred),
       from_previous(match.from_previous),
       search_terms_args(match.search_terms_args.get() ?
           new TemplateURLRef::SearchTermsArgs(*match.search_terms_args) :
-          NULL) {
+          NULL),
+      additional_info(match.additional_info) {
 }
 
 AutocompleteMatch::~AutocompleteMatch() {
 }
 
 AutocompleteMatch& AutocompleteMatch::operator=(
     const AutocompleteMatch& match) {
   if (this == &match)
     return *this;
 
@@ skipping 12 matching lines @@
   transition = match.transition;
   is_history_what_you_typed_match = match.is_history_what_you_typed_match;
   type = match.type;
   associated_keyword.reset(match.associated_keyword.get() ?
       new AutocompleteMatch(*match.associated_keyword) : NULL);
   keyword = match.keyword;
   starred = match.starred;
   from_previous = match.from_previous;
   search_terms_args.reset(match.search_terms_args.get() ?
       new TemplateURLRef::SearchTermsArgs(*match.search_terms_args) : NULL);
+  additional_info = match.additional_info;
   return *this;
 }
 
 // static
 std::string AutocompleteMatch::TypeToString(Type type) {
   const char* strings[] = {
     "url-what-you-typed",
     "history-url",
     "history-title",
     "history-body",
@@ skipping 191 matching lines @@
   return (t_url && t_url->SupportsReplacement()) ? keyword : string16();
 }
 
 TemplateURL* AutocompleteMatch::GetTemplateURL(Profile* profile) const {
   DCHECK(profile);
   return keyword.empty() ? NULL :
       TemplateURLServiceFactory::GetForProfile(profile)->
           GetTemplateURLForKeyword(keyword);
 }
 
+void AutocompleteMatch::RecordAdditionalInfo(const std::string& property,
+                                             const std::string& value) {
+  DCHECK(property.size());
+  DCHECK(value.size());
+  additional_info[property] = value;
+}
+
+void AutocompleteMatch::RecordAdditionalInfo(const std::string& property,
+                                             int value) {
+  RecordAdditionalInfo(property, StringPrintf("%d", value));
+}
+
+void AutocompleteMatch::RecordAdditionalInfo(const std::string& property,
+                                             const base::Time& value) {
+  RecordAdditionalInfo(property,
+                       UTF16ToUTF8(base::TimeFormatShortDateAndTime(value)));
+}
+
 #ifndef NDEBUG
 void AutocompleteMatch::Validate() const {
   ValidateClassifications(contents, contents_class);
   ValidateClassifications(description, description_class);
 }
 
 void AutocompleteMatch::ValidateClassifications(
     const string16& text,
     const ACMatchClassifications& classifications) const {
   if (text.empty()) {
@@ skipping 17 matching lines @@
         << " is unsorted in relation to last offset of " << last_offset
         << ". Provider: " << (provider ? provider->name() : "None") << ".";
     DCHECK_LT(i->offset, text.length())
         << " Classification of [" << i->offset << "," << text.length()
         << "] is out of bounds for \"" << text << "\". Provider: "
         << (provider ? provider->name() : "None") << ".";
     last_offset = i->offset;
   }
 }
 #endif