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

third_party/WebKit/Source/core/svg/animation/SMILTimeContainer.cpp

 /*
  * Copyright (C) 2008 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 418 matching lines @@
 
   if (m_documentOrderIndexesDirty)
     updateDocumentOrderIndexes();
 
   HeapHashSet<ElementAttributePair> invalidKeys;
   using AnimationsVector = HeapVector<Member<SVGSMILElement>>;
   AnimationsVector animationsToApply;
   AnimationsVector scheduledAnimationsInSameGroup;
   for (const auto& entry : m_scheduledAnimations) {
     if (!entry.key.first || entry.value->isEmpty()) {
-      invalidKeys.add(entry.key);
+      invalidKeys.insert(entry.key);
       continue;
     }
 
     // Sort according to priority. Elements with later begin time have higher
     // priority.  In case of a tie, document order decides.
     // FIXME: This should also consider timing relationships between the
     // elements. Dependents have higher priority.
     copyToVector(*entry.value, scheduledAnimationsInSameGroup);
     std::sort(scheduledAnimationsInSameGroup.begin(),
               scheduledAnimationsInSameGroup.end(), PriorityCompare(elapsed));
@@ skipping 76 matching lines @@
 void SMILTimeContainer::advanceFrameForTesting() {
   setElapsed(elapsed() + initialFrameDelay);
 }
 
 DEFINE_TRACE(SMILTimeContainer) {
   visitor->trace(m_scheduledAnimations);
   visitor->trace(m_ownerSVGElement);
 }
 
 }  // namespace blink