base: Remove dereference structure operator (i.e ->) from ScopedVector.

chrome/browser/history/history_backend.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/history/history_backend.h"
 
 #include <list>
 #include <map>
 #include <set>
 #include <vector>
@@ skipping 1476 matching lines @@
 
   std::map<URLID, double> score_map;
   for (size_t i = 0; i < visits.size(); ++i) {
     score_map[visits[i].url_id] += filter.GetVisitScore(visits[i]);
   }
 
   // TODO(georgey): experiment with visit_segment database granularity (it is
   // currently 24 hours) to use it directly instead of using visits database,
   // which is considerably slower.
   ScopedVector<PageUsageData> data;
-  data->reserve(score_map.size());
+  data.reserve(score_map.size());
   for (std::map<URLID, double>::iterator it = score_map.begin();
        it != score_map.end(); ++it) {
     PageUsageData* pud = new PageUsageData(it->first);
     pud->SetScore(it->second);
-    data->push_back(pud);
+    data.push_back(pud);
   }
 
   // Limit to the top |result_count| results.
   std::sort(data.begin(), data.end(), PageUsageData::Predicate);
   if (result_count && static_cast<int>(data.size()) > result_count) {
     STLDeleteContainerPointers(data.begin() + result_count, data.end());
     data.resize(result_count);
   }
 
   for (size_t i = 0; i < data.size(); ++i) {
@@ skipping 971 matching lines @@
   info.url_id = visit.url_id;
   info.time = visit.visit_time;
   info.transition = visit.transition;
   // If we don't have a delegate yet during setup or shutdown, we will drop
   // these notifications.
   if (delegate_.get())
     delegate_->NotifyVisitDBObserversOnAddVisit(info);
 }
 
 }  // namespace history