Migrate WTF::LinkedHashSet/ListHashSet/HashTable::remove() to ::erase()

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

 /*
  * Copyright (C) 2013 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 3046 matching lines @@
 
   EXPECT_EQ(set1->end(), it);
   EXPECT_EQ(constSet.end(), cit);
   EXPECT_EQ(set1->rend(), reverse);
   EXPECT_EQ(constSet.rend(), creverse);
 
   typename Set::iterator iX(set2->begin());
   EXPECT_EQ(set2->end(), iX);
 
   if (strong)
-    set1->remove(keepNumbersAlive[0]);
+    set1->erase(keepNumbersAlive[0]);
 
   keepNumbersAlive[0] = nullptr;
 
   preciselyCollectGarbage();
 
   EXPECT_EQ(2u + (strong ? 1u : 0u), set1->size());
 
   EXPECT_EQ(2 + (strong ? 0 : 1), IntWrapper::s_destructorCalls);
 
   typename Set::iterator i2(set1->begin());
@@ skipping 412 matching lines @@
               count++;
           } else if (collectionNumber == weakSetIndex && firstAlive) {
             ASSERT_TRUE(weakSet->contains(keepNumbersAlive[i]));
             if (deleteAfterwards)
               weakSet->erase(keepNumbersAlive[i]);
             else
               count++;
           } else if (collectionNumber == weakOrderedSetIndex && firstAlive) {
             ASSERT_TRUE(weakOrderedSet->contains(keepNumbersAlive[i]));
             if (deleteAfterwards)
-              weakOrderedSet->remove(keepNumbersAlive[i]);
+              weakOrderedSet->erase(keepNumbersAlive[i]);
             else
               count++;
           }
         }
         if (addAfterwards) {
           for (int i = 1000; i < 1100; i++) {
             IntWrapper* wrapped = IntWrapper::create(i);
             keepNumbersAlive.push_back(wrapped);
             weakStrong->insert(wrapped, wrapped);
             strongWeak->insert(wrapped, wrapped);
@@ skipping 2834 matching lines @@
       "HeapVector");
   static_assert(
       WTF::IsGarbageCollectedType<HeapDeque<Member<IntWrapper>>>::value,
       "HeapDeque");
   static_assert(WTF::IsGarbageCollectedType<
                     HeapTerminatedArray<Member<IntWrapper>>>::value,
                 "HeapTerminatedArray");
 }
 
 }  // namespace blink