components: Use stl utilities from the base namespace

components/query_parser/query_parser.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/query_parser/query_parser.h"
 
 #include <algorithm>
 
 #include "base/compiler_specific.h"
 #include "base/i18n/break_iterator.h"
@@ skipping 166 matching lines @@
 
   QueryNodeStarVector children_;
 
  private:
   DISALLOW_COPY_AND_ASSIGN(QueryNodeList);
 };
 
 QueryNodeList::QueryNodeList() {}
 
 QueryNodeList::~QueryNodeList() {
-  STLDeleteElements(&children_);
+  base::STLDeleteElements(&children_);
 }
 
 void QueryNodeList::AddChild(QueryNode* node) {
   children_.push_back(node);
 }
 
 void QueryNodeList::RemoveEmptySubnodes() {
   for (size_t i = 0; i < children_.size(); ++i) {
     if (children_[i]->IsWord())
       continue;
@@ skipping 278 matching lines @@
 void QueryParser::SortAndCoalesceMatchPositions(
     Snippet::MatchPositions* matches) {
   std::sort(matches->begin(), matches->end(), &CompareMatchPosition);
   // WARNING: we don't use iterator here as CoalesceMatchesFrom may remove
   // from matches.
   for (size_t i = 0; i < matches->size(); ++i)
     CoalesceMatchesFrom(i, matches);
 }
 
 }  // namespace query_parser