Migrate WTF::HashSet::add() to ::insert() [continued]

third_party/WebKit/Source/core/layout/GridTrackSizingAlgorithm.cpp

 // Copyright 2017 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 "core/layout/GridTrackSizingAlgorithm.h"
 
 #include "core/layout/Grid.h"
 #include "core/layout/LayoutGrid.h"
 #include "platform/LengthFunctions.h"
 
@@ skipping 1109 matching lines @@
 }
 
 void GridTrackSizingAlgorithm::resolveIntrinsicTrackSizes() {
   Vector<GridItemWithSpan> itemsSortedByIncreasingSpan;
   if (m_grid.hasGridItems()) {
     HashSet<LayoutBox*> itemsSet;
     for (const auto& trackIndex : m_contentSizedTracksIndex) {
       GridIterator iterator(m_grid, m_direction, trackIndex);
       GridTrack& track = tracks(m_direction)[trackIndex];
       while (LayoutBox* gridItem = iterator.nextGridItem()) {
-        if (itemsSet.add(gridItem).isNewEntry) {
+        if (itemsSet.insert(gridItem).isNewEntry) {
           const GridSpan& span = m_grid.gridItemSpan(*gridItem, m_direction);
           if (span.integerSpan() == 1) {
             sizeTrackToFitNonSpanningItem(span, *gridItem, track);
           } else if (!spanningItemCrossesFlexibleSizedTracks(span)) {
             itemsSortedByIncreasingSpan.push_back(
                 GridItemWithSpan(*gridItem, span));
           }
         }
       }
     }
@@ skipping 101 matching lines @@
       continue;
     LayoutUnit baseSize = tracks[index].baseSize();
     double flexFactor =
         gridTrackSize(m_direction, index).maxTrackBreadth().flex();
     // treating all such tracks as inflexible.
     if (baseSize > hypotheticalFactorUnitSize * flexFactor) {
       leftOverSpace -= baseSize;
       flexFactorSum -= flexFactor;
       if (!additionalTracksToTreatAsInflexible)
         additionalTracksToTreatAsInflexible = WTF::makeUnique<TrackIndexSet>();
-      additionalTracksToTreatAsInflexible->add(index);
+      additionalTracksToTreatAsInflexible->insert(index);
       validFlexFactorUnit = false;
     }
   }
   if (!validFlexFactorUnit) {
     return computeFlexFactorUnitSize(
         tracks, flexFactorSum, leftOverSpace, flexibleTracksIndexes,
         std::move(additionalTracksToTreatAsInflexible));
   }
   return hypotheticalFactorUnitSize;
 }
@@ skipping 162 matching lines @@
   DCHECK(m_algorithm.isValidTransition());
   DCHECK(!m_algorithm.m_needsSetup);
 }
 
 GridTrackSizingAlgorithm::StateMachine::~StateMachine() {
   m_algorithm.advanceNextState();
   m_algorithm.m_needsSetup = true;
 }
 
 }  // namespace blink