components: Use stl utilities from the base namespace

components/history/core/browser/visit_tracker.cc

 // Copyright (c) 2006-2008 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/visit_tracker.h"
 
 #include <stddef.h>
 
 #include "base/stl_util.h"
 
 namespace history {
 
 // When the list gets longer than 'MaxItems', CleanupTransitionList will resize
 // the list down to 'ResizeTo' size. This is so we only do few block moves of
 // the data rather than constantly shuffle stuff around in the vector.
 static const size_t kMaxItemsInTransitionList = 96;
 static const size_t kResizeBigTransitionListTo = 64;
 static_assert(kResizeBigTransitionListTo < kMaxItemsInTransitionList,
               "maxium number of items must be larger than we are resizing to");
 
 VisitTracker::VisitTracker() {
 }
 
 VisitTracker::~VisitTracker() {
-  STLDeleteContainerPairSecondPointers(contexts_.begin(), contexts_.end());
+  base::STLDeleteContainerPairSecondPointers(contexts_.begin(),
+                                             contexts_.end());
 }
 
 // This function is potentially slow because it may do up to two brute-force
 // searches of the transitions list. This transitions list is kept to a
 // relatively small number by CleanupTransitionList so it shouldn't be a big
 // deal. However, if this ends up being noticable for performance, we may want
 // to optimize lookup.
 VisitID VisitTracker::GetLastVisit(ContextID context_id,
                                    int nav_entry_id,
                                    const GURL& referrer) {
@@ skipping 65 matching lines @@
 
 void VisitTracker::CleanupTransitionList(TransitionList* transitions) {
   if (transitions->size() <= kMaxItemsInTransitionList)
     return;  // Nothing to do.
 
   transitions->erase(transitions->begin(),
                      transitions->begin() + kResizeBigTransitionListTo);
 }
 
 }  // namespace history