Some C++11 cleanup of history types.

components/history/core/browser/url_database.cc

 // Copyright 2014 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/history/core/browser/url_database.h"
 
 #include <limits>
 #include <string>
 #include <vector>
 
@@ skipping 44 matching lines @@
   replacements.ClearUsername();
   replacements.ClearPassword();
 
   return (gurl.ReplaceComponents(replacements)).spec();
 }
 
 // Convenience to fill a URLRow. Must be in sync with the fields in
 // kURLRowFields.
 void URLDatabase::FillURLRow(sql::Statement& s, URLRow* i) {
   DCHECK(i);
-  i->id_ = s.ColumnInt64(0);
-  i->url_ = GURL(s.ColumnString(1));
-  i->title_ = s.ColumnString16(2);
-  i->visit_count_ = s.ColumnInt(3);
-  i->typed_count_ = s.ColumnInt(4);
-  i->last_visit_ = base::Time::FromInternalValue(s.ColumnInt64(5));
-  i->hidden_ = s.ColumnInt(6) != 0;
+  i->set_id(s.ColumnInt64(0));
+  i->set_url(GURL(s.ColumnString(1)));
+  i->set_title(s.ColumnString16(2));
+  i->set_visit_count(s.ColumnInt(3));
+  i->set_typed_count(s.ColumnInt(4));
+  i->set_last_visit(base::Time::FromInternalValue(s.ColumnInt64(5)));
+  i->set_hidden(s.ColumnInt(6) != 0);
 }
 
 bool URLDatabase::GetURLRow(URLID url_id, URLRow* info) {
   // TODO(brettw) We need check for empty URLs to handle the case where
   // there are old URLs in the database that are empty that got in before
   // we added any checks. We should eventually be able to remove it
   // when all inputs are using GURL (which prohibit empty input).
   sql::Statement statement(GetDB().GetCachedStatement(SQL_FROM_HERE,
       "SELECT" HISTORY_URL_ROW_FIELDS "FROM urls WHERE id=?"));
   statement.BindInt64(0, url_id);
@@ skipping 558 matching lines @@
 bool RowQualifiesAsSignificant(const URLRow& row,
                                const base::Time& threshold) {
   const base::Time& real_threshold =
       threshold.is_null() ? AutocompleteAgeThreshold() : threshold;
   return (row.typed_count() >= kLowQualityMatchTypedLimit) ||
          (row.visit_count() >= kLowQualityMatchVisitLimit) ||
          (row.last_visit() >= real_threshold);
 }
 
 }  // namespace history