net: Use stl utilities from the base namespace

net/base/expiring_cache_unittest.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 "net/base/expiring_cache.h"
 
 #include <functional>
 #include <string>
 
 #include "base/stl_util.h"
@@ skipping 101 matching lines @@
   }
   EXPECT_EQ(8U, cache.size());
 
   // Add two negative (instantly expired) entries at t=0 that expire at t=0.
   for (int i = 0; i < 2; ++i) {
     std::string name = base::StringPrintf("negative%d", i);
     cache.Put(name, "I was never valid.", now, now);
   }
   EXPECT_EQ(10U, cache.size());
 
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid0"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid1"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid2"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid3"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid4"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "expired0"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "expired1"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "expired2"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "negative0"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "negative1"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid0"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid1"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid2"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid3"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid4"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "expired0"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "expired1"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "expired2"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "negative0"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "negative1"));
 
   // Shrink the new max constraints bound and compact. The "negative" and
   // "expired" entries should be dropped.
   cache.max_entries_ = 6;
   cache.Compact(now);
   EXPECT_EQ(5U, cache.size());
 
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid0"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid1"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid2"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid3"));
-  EXPECT_TRUE(ContainsKey(cache.entries_, "valid4"));
-  EXPECT_FALSE(ContainsKey(cache.entries_, "expired0"));
-  EXPECT_FALSE(ContainsKey(cache.entries_, "expired1"));
-  EXPECT_FALSE(ContainsKey(cache.entries_, "expired2"));
-  EXPECT_FALSE(ContainsKey(cache.entries_, "negative0"));
-  EXPECT_FALSE(ContainsKey(cache.entries_, "negative1"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid0"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid1"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid2"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid3"));
+  EXPECT_TRUE(base::ContainsKey(cache.entries_, "valid4"));
+  EXPECT_FALSE(base::ContainsKey(cache.entries_, "expired0"));
+  EXPECT_FALSE(base::ContainsKey(cache.entries_, "expired1"));
+  EXPECT_FALSE(base::ContainsKey(cache.entries_, "expired2"));
+  EXPECT_FALSE(base::ContainsKey(cache.entries_, "negative0"));
+  EXPECT_FALSE(base::ContainsKey(cache.entries_, "negative1"));
 
   // Shrink further -- this time the compact will start dropping valid entries
   // to make space.
   cache.max_entries_ = 4;
   cache.Compact(now);
   EXPECT_EQ(3U, cache.size());
 }
 
 // Add entries while the cache is at capacity, causing evictions.
 TEST(ExpiringCacheTest, SetWithCompact) {
@@ skipping 143 matching lines @@
   // should be able to add something at kHeatDeath that expires at kMuchLater.
   cache.Put("test7", "foo7", kHeatDeath, kMuchLater);
   EXPECT_EQ(1U, cache.size());
   EXPECT_THAT(cache.Get("test7", kNow), Pointee(StrEq("foo7")));
   EXPECT_THAT(cache.Get("test7", kLater), Pointee(StrEq("foo7")));
   EXPECT_THAT(cache.Get("test7", kHeatDeath), Pointee(StrEq("foo7")));
   EXPECT_FALSE(cache.Get("test7", kMuchLater));
 }
 
 }  // namespace net