net: Use stl utilities from the base namespace

net/quic/core/interval_test.cc

 // Copyright 2015 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.
 //
 // ----------------------------------------------------------------------
 //
 // Unittest for the Interval class.
 //
 // Author: Will Neveitt (wneveitt@google.com)
 // ----------------------------------------------------------------------
@@ skipping 193 matching lines @@
   EXPECT_TRUE(!d.Contains(99));
   EXPECT_TRUE(!d.Contains(201));
 
   // Difference:
   vector<Interval<int64_t>*> diff;
 
   EXPECT_TRUE(!d.Difference(empty, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(200u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
   EXPECT_TRUE(!empty.Difference(d, &diff) && diff.empty());
 
   EXPECT_TRUE(d.Difference(d, &diff) && diff.empty());
   EXPECT_TRUE(!d.Difference(d1, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(200u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   Interval<int64_t> lo;
   Interval<int64_t> hi;
 
   EXPECT_TRUE(d.Difference(d2, &lo, &hi));
   EXPECT_TRUE(lo.Empty());
   EXPECT_EQ(110u, hi.min());
   EXPECT_EQ(200u, hi.max());
   EXPECT_TRUE(d.Difference(d2, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(110u, diff[0]->min());
   EXPECT_EQ(200u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_TRUE(d.Difference(d3, &lo, &hi));
   EXPECT_EQ(100u, lo.min());
   EXPECT_EQ(110u, lo.max());
   EXPECT_EQ(180u, hi.min());
   EXPECT_EQ(200u, hi.max());
   EXPECT_TRUE(d.Difference(d3, &diff));
   EXPECT_EQ(2u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(110u, diff[0]->max());
   EXPECT_EQ(180u, diff[1]->min());
   EXPECT_EQ(200u, diff[1]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_TRUE(d.Difference(d4, &lo, &hi));
   EXPECT_EQ(100u, lo.min());
   EXPECT_EQ(180u, lo.max());
   EXPECT_TRUE(hi.Empty());
   EXPECT_TRUE(d.Difference(d4, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(180u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_FALSE(d.Difference(d5, &lo, &hi));
   EXPECT_EQ(100u, lo.min());
   EXPECT_EQ(200u, lo.max());
   EXPECT_TRUE(hi.Empty());
   EXPECT_FALSE(d.Difference(d5, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(200u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_TRUE(d.Difference(d6, &lo, &hi));
   EXPECT_TRUE(lo.Empty());
   EXPECT_EQ(150u, hi.min());
   EXPECT_EQ(200u, hi.max());
   EXPECT_TRUE(d.Difference(d6, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(150u, diff[0]->min());
   EXPECT_EQ(200u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_TRUE(d.Difference(d7, &lo, &hi));
   EXPECT_EQ(100u, lo.min());
   EXPECT_EQ(150u, lo.max());
   EXPECT_TRUE(hi.Empty());
   EXPECT_TRUE(d.Difference(d7, &diff));
   EXPECT_EQ(1u, diff.size());
   EXPECT_EQ(100u, diff[0]->min());
   EXPECT_EQ(150u, diff[0]->max());
-  STLDeleteElements(&diff);
+  base::STLDeleteElements(&diff);
 
   EXPECT_TRUE(d.Difference(d8, &lo, &hi));
   EXPECT_TRUE(lo.Empty());
   EXPECT_TRUE(hi.Empty());
   EXPECT_TRUE(d.Difference(d8, &diff) && diff.empty());
 }
 
 TEST_F(IntervalTest, Length) {
   const Interval<int> empty1;
   const Interval<int> empty2(1, 1);
@@ skipping 25 matching lines @@
   const Interval<pair<int, int>> d2({1, 2}, {4, 3});
   EXPECT_EQ("a", d1.min());
   EXPECT_EQ("b", d1.max());
   EXPECT_EQ(std::make_pair(1, 2), d2.min());
   EXPECT_EQ(std::make_pair(4, 3), d2.max());
 }
 
 }  // unnamed namespace
 }  // namespace test
 }  // namespace net