Migrate WTF::HashMap::add() to ::insert()

third_party/WebKit/Source/platform/heap/HeapCompactTest.cpp

 // Copyright 2016 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 "platform/heap/HeapCompact.h"
 
 #include "platform/heap/Handle.h"
 #include "platform/heap/SparseHeapBitmap.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "wtf/Deque.h"
@@ skipping 217 matching lines @@
   for (size_t i = 0; i < vector->size(); ++i)
     EXPECT_EQ(val, (*vector)[i]);
 }
 
 TEST(HeapCompactTest, CompactHashMap) {
   clearOutOldGarbage();
 
   Persistent<IntMap> intMap = new IntMap();
   for (size_t i = 0; i < 100; ++i) {
     IntWrapper* val = IntWrapper::create(i);
-    intMap->add(val, 100 - i);
+    intMap->insert(val, 100 - i);
   }
 
   EXPECT_EQ(100u, intMap->size());
   for (auto k : *intMap)
     EXPECT_EQ(k.key->value(), 100 - k.value);
 
   performHeapCompaction();
 
   for (auto k : *intMap)
     EXPECT_EQ(k.key->value(), 100 - k.value);
 }
 
 TEST(HeapCompactTest, CompactVectorPartHashMap) {
   clearOutOldGarbage();
 
   using IntMapVector = HeapVector<IntMap>;
 
   Persistent<IntMapVector> intMapVector = new IntMapVector();
   for (size_t i = 0; i < 10; ++i) {
     IntMap map;
     for (size_t j = 0; j < 10; ++j) {
       IntWrapper* val = IntWrapper::create(j);
-      map.add(val, 10 - j);
+      map.insert(val, 10 - j);
     }
     intMapVector->push_back(map);
   }
 
   EXPECT_EQ(10u, intMapVector->size());
   for (auto map : *intMapVector) {
     EXPECT_EQ(10u, map.size());
     for (auto k : map) {
       EXPECT_EQ(k.key->value(), 10 - k.value);
     }
@@ skipping 14 matching lines @@
   clearOutOldGarbage();
 
   using IntVectorMap = HeapHashMap<int, IntVector>;
 
   Persistent<IntVectorMap> intVectorMap = new IntVectorMap();
   for (size_t i = 0; i < 10; ++i) {
     IntVector vector;
     for (size_t j = 0; j < 10; ++j) {
       vector.push_back(IntWrapper::create(j));
     }
-    intVectorMap->add(1 + i, vector);
+    intVectorMap->insert(1 + i, vector);
   }
 
   EXPECT_EQ(10u, intVectorMap->size());
   for (const IntVector& intVector : intVectorMap->values()) {
     EXPECT_EQ(10u, intVector.size());
     for (size_t i = 0; i < intVector.size(); ++i) {
       EXPECT_EQ(static_cast<int>(i), intVector[i]->value());
     }
   }
 
@@ skipping 145 matching lines @@
 
   expected = 0;
   for (const Inner* v : *set) {
     EXPECT_EQ(1u, v->size());
     EXPECT_EQ(expected, (*v->begin())->value());
     expected++;
   }
 }
 
 }  // namespace blink