Migrate WTF::HashSet::add() to ::insert() [part 1 of N]

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 388 matching lines @@
 }
 
 TEST(HeapCompactTest, CompactLinkedHashSetMap) {
   using Inner = HeapHashSet<Member<IntWrapper>>;
   using OrderedHashSet = HeapLinkedHashSet<Member<Inner>>;
 
   Persistent<OrderedHashSet> set = new OrderedHashSet;
   for (int i = 0; i < 13; ++i) {
     IntWrapper* value = IntWrapper::create(i);
     Inner* inner = new Inner;
-    inner->add(value);
+    inner->insert(value);
     set->add(inner);
   }
   EXPECT_EQ(13u, set->size());
 
   int expected = 0;
   for (const Inner* v : *set) {
     EXPECT_EQ(1u, v->size());
     EXPECT_EQ(expected, (*v->begin())->value());
     expected++;
   }
@@ skipping 32 matching lines @@
 
   expected = 0;
   for (const Inner* v : *set) {
     EXPECT_EQ(1u, v->size());
     EXPECT_EQ(expected, (*v->begin())->value());
     expected++;
   }
 }
 
 }  // namespace blink