A working implementation of AQS (Assisted Query Stats).

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/logging.h"
 #include "base/string_number_conversions.h"
 #include "base/string_util.h"
 #include "chrome/browser/autocomplete/autocomplete.h"
@@ skipping 53 matching lines @@
       contents(match.contents),
       contents_class(match.contents_class),
       description(match.description),
       description_class(match.description_class),
       transition(match.transition),
       is_history_what_you_typed_match(match.is_history_what_you_typed_match),
       type(match.type),
       keyword(match.keyword),
       starred(match.starred),
       from_previous(match.from_previous) {
   if (match.associated_keyword.get())

[Peter Kasting, 2012/06/22 21:48:31]

Nit: For consistency, we could probably change these conditionals to look like
the unconditional reset() calls in operator=() below.  (The reverse change
wouldn't be safe as they need to be unconditional in operator=().)

[Bart N, 2012/06/22 22:42:01]

Actually, to satisfy both performance & consistency, I've moved this code to the
constructor's initialization list.

     associated_keyword.reset(new AutocompleteMatch(*match.associated_keyword));
+  if (match.search_terms_args.get())
+    search_terms_args.reset(
+        new TemplateURLRef::SearchTermsArgs(*match.search_terms_args));
 }
 
 AutocompleteMatch::~AutocompleteMatch() {
 }
 
 AutocompleteMatch& AutocompleteMatch::operator=(
     const AutocompleteMatch& match) {
   if (this == &match)
     return *this;
 
@@ skipping 10 matching lines @@
   description = match.description;
   description_class = match.description_class;
   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);
   return *this;
 }
 
 // static
 std::string AutocompleteMatch::TypeToString(Type type) {
   const char* strings[] = {
     "url-what-you-typed",
     "history-url",
     "history-title",
     "history-body",
@@ skipping 228 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