base: Use stl utilities from the base namespace

base/memory/scoped_vector.h

 // 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.
 
 #ifndef BASE_MEMORY_SCOPED_VECTOR_H_
 #define BASE_MEMORY_SCOPED_VECTOR_H_
 
 #include <stddef.h>
 
 #include <memory>
@@ skipping 71 matching lines @@
   void release(std::vector<T*>* out) {
     out->swap(v_);
     v_.clear();
   }
 
   void reserve(size_t capacity) { v_.reserve(capacity); }
 
   // Resize, deleting elements in the disappearing range if we are shrinking.
   void resize(size_t new_size) {
     if (v_.size() > new_size)
-      STLDeleteContainerPointers(v_.begin() + new_size, v_.end());
+      base::STLDeleteContainerPointers(v_.begin() + new_size, v_.end());
     v_.resize(new_size);
   }
 
   template<typename InputIterator>
   void assign(InputIterator begin, InputIterator end) {
     v_.assign(begin, end);
   }
 
-  void clear() { STLDeleteElements(&v_); }
+  void clear() { base::STLDeleteElements(&v_); }
 
   // Like |clear()|, but doesn't delete any elements.
   void weak_clear() { v_.clear(); }
 
   // Lets the ScopedVector take ownership of |x|.
   iterator insert(iterator position, T* x) {
     return v_.insert(position, x);
   }
 
   iterator insert(iterator position, std::unique_ptr<T> x) {
     return v_.insert(position, x.release());
   }
 
   // Lets the ScopedVector take ownership of elements in [first,last).
   template<typename InputIterator>
   void insert(iterator position, InputIterator first, InputIterator last) {
     v_.insert(position, first, last);
   }
 
   iterator erase(iterator position) {
     delete *position;
     return v_.erase(position);
   }
 
   iterator erase(iterator first, iterator last) {
-    STLDeleteContainerPointers(first, last);
+    base::STLDeleteContainerPointers(first, last);
     return v_.erase(first, last);
   }
 
   // Like |erase()|, but doesn't delete the element at |position|.
   iterator weak_erase(iterator position) {
     return v_.erase(position);
   }
 
   // Like |erase()|, but doesn't delete the elements in [first, last).
   iterator weak_erase(iterator first, iterator last) {
     return v_.erase(first, last);
   }
 
  private:
   std::vector<T*> v_;
 
   DISALLOW_COPY_AND_ASSIGN(ScopedVector);
 };
 
 #endif  // BASE_MEMORY_SCOPED_VECTOR_H_