components: Add out-of-line copy ctors for complex classes.

components/omnibox/browser/url_index_private_data.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 "components/omnibox/browser/url_index_private_data.h"
 
 #include <stdint.h>
 
 #include <functional>
 #include <iterator>
@@ skipping 1249 matching lines @@
 
 URLIndexPrivateData::SearchTermCacheItem::SearchTermCacheItem(
     const WordIDSet& word_id_set,
     const HistoryIDSet& history_id_set)
     : word_id_set_(word_id_set), history_id_set_(history_id_set), used_(true) {
 }
 
 URLIndexPrivateData::SearchTermCacheItem::SearchTermCacheItem() : used_(true) {
 }
 
+URLIndexPrivateData::SearchTermCacheItem::SearchTermCacheItem(
+    const SearchTermCacheItem& other) = default;
+
 URLIndexPrivateData::SearchTermCacheItem::~SearchTermCacheItem() {
 }
 
 // URLIndexPrivateData::AddHistoryMatch ----------------------------------------
 
 URLIndexPrivateData::AddHistoryMatch::AddHistoryMatch(
     bookmarks::BookmarkModel* bookmark_model,
     const URLIndexPrivateData& private_data,
     const std::string& languages,
     const base::string16& lower_string,
@@ skipping 17 matching lines @@
       continue;
     // Find the first word start. If the iterator didn't find a word break, set
     // an offset of term size. For example, the offset for "://" should be 3,
     // indicating that the word-part is missing.
     while (iter.Advance() && !iter.IsWord()) {}
 
     lower_terms_to_word_starts_offsets_[i] = iter.prev();
   }
 }
 
+URLIndexPrivateData::AddHistoryMatch::AddHistoryMatch(
+    const AddHistoryMatch& other) = default;
+
 URLIndexPrivateData::AddHistoryMatch::~AddHistoryMatch() {
 }
 
 void URLIndexPrivateData::AddHistoryMatch::operator()(
     const HistoryID history_id) {
   HistoryInfoMap::const_iterator hist_pos =
       private_data_.history_info_map_.find(history_id);
   if (hist_pos != private_data_.history_info_map_.end()) {
     const history::URLRow& hist_item = hist_pos->second.url_row;
     const VisitInfoVector& visits = hist_pos->second.visits;
@@ skipping 35 matching lines @@
   // First cut: typed count, visit count, recency.
   // TODO(mrossetti): This is too simplistic. Consider an approach which ranks
   // recently visited (within the last 12/24 hours) as highly important. Get
   // input from mpearson.
   if (r1.typed_count() != r2.typed_count())
     return (r1.typed_count() > r2.typed_count());
   if (r1.visit_count() != r2.visit_count())
     return (r1.visit_count() > r2.visit_count());
   return (r1.last_visit() > r2.last_visit());
 }