Use C++11 range-based loop for core/layout

Source/core/layout/svg/LayoutSVGResourceContainer.cpp

 /*
  * Copyright (C) Research In Motion Limited 2010. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 92 matching lines @@
         return;
 
     if (m_invalidationMask & mode)
         return;
 
     m_invalidationMask |= mode;
     m_isInvalidating = true;
     bool needsLayout = mode == LayoutAndBoundariesInvalidation;
     bool markForInvalidation = mode != ParentOnlyInvalidation;
 
-    HashSet<LayoutObject*>::iterator end = m_clients.end();
-    for (HashSet<LayoutObject*>::iterator it = m_clients.begin(); it != end; ++it) {
-        LayoutObject* client = *it;
+    for (auto* client : m_clients) {
         if (client->isSVGResourceContainer()) {
             toLayoutSVGResourceContainer(client)->removeAllClientsFromCache(markForInvalidation);
             continue;
         }
 
         if (markForInvalidation)
             markClientForInvalidation(client, mode);
 
         LayoutSVGResourceContainer::markForLayoutAndParentResourceInvalidation(client, needsLayout);
     }
 
     markAllClientLayersForInvalidation();
 
     m_isInvalidating = false;
 }
 
 void LayoutSVGResourceContainer::markAllClientLayersForInvalidation()
 {
-    HashSet<DeprecatedPaintLayer*>::iterator layerEnd = m_clientLayers.end();
-    for (HashSet<DeprecatedPaintLayer*>::iterator it = m_clientLayers.begin(); it != layerEnd; ++it)
-        (*it)->filterNeedsPaintInvalidation();
+    for (auto* layer : m_clientLayers)
+        layer->filterNeedsPaintInvalidation();
 }
 
 void LayoutSVGResourceContainer::markClientForInvalidation(LayoutObject* client, InvalidationMode mode)
 {
     ASSERT(client);
     ASSERT(!m_clients.isEmpty());
 
     switch (mode) {
     case LayoutAndBoundariesInvalidation:
     case BoundariesInvalidation:
@@ skipping 103 matching lines @@
     if (!dependencies)
         return;
 
     // We allow cycles in SVGDocumentExtensions reference sets in order to avoid expensive
     // reference graph adjustments on changes, so we need to break possible cycles here.
     // This strong reference is safe, as it is guaranteed that this set will be emptied
     // at the end of recursion.
     typedef WillBeHeapHashSet<RawPtrWillBeMember<SVGElement>> SVGElementSet;
     DEFINE_STATIC_LOCAL(OwnPtrWillBePersistent<SVGElementSet>, invalidatingDependencies, (adoptPtrWillBeNoop(new SVGElementSet)));
 
-    SVGElementSet::iterator end = dependencies->end();
-    for (SVGElementSet::iterator it = dependencies->begin(); it != end; ++it) {
-        if (LayoutObject* layoutObject = (*it)->layoutObject()) {
-            if (UNLIKELY(!invalidatingDependencies->add(*it).isNewEntry)) {
+    for (auto* element : *dependencies) {
+        if (LayoutObject* layoutObject = element->layoutObject()) {
+            if (UNLIKELY(!invalidatingDependencies->add(element).isNewEntry)) {
                 // Reference cycle: we are in process of invalidating this dependant.
                 continue;
             }
 
             LayoutSVGResourceContainer::markForLayoutAndParentResourceInvalidation(layoutObject, needsLayout);
-            invalidatingDependencies->remove(*it);
+            invalidatingDependencies->remove(element);
         }
     }
 }
 
 void LayoutSVGResourceContainer::markForLayoutAndParentResourceInvalidation(LayoutObject* object, bool needsLayout)
 {
     ASSERT(object);
     ASSERT(object->node());
 
     if (needsLayout && !object->documentBeingDestroyed())
@@ skipping 10 matching lines @@
             // This will process the rest of the ancestors.
             toLayoutSVGResourceContainer(current)->removeAllClientsFromCache();
             break;
         }
 
         current = current->parent();
     }
 }
 
 }