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

Source/core/layout/svg/SVGResourcesCycleSolver.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 68 matching lines @@
         if (node != resource && node->isSVGResourceContainer()) {
             node = node->nextInPreOrderAfterChildren(resource);
             continue;
         }
         if (SVGResources* nodeResources = SVGResourcesCache::cachedResourcesForLayoutObject(node)) {
             // Fetch all the resources referenced by |node|.
             ResourceSet nodeSet;
             nodeResources->buildSetOfResources(nodeSet);
 
             // Iterate resources referenced by |node|.
-            ResourceSet::iterator end = nodeSet.end();
-            for (ResourceSet::iterator it = nodeSet.begin(); it != end; ++it) {
-                if (m_activeResources.contains(*it) || resourceContainsCycles(*it))
+            for (auto* node : nodeSet) {
+                if (m_activeResources.contains(node) || resourceContainsCycles(node))
                     return true;
             }
         }
         node = node->nextInPreOrder(resource);
     }
 
     // No cycles found in (or from) this resource. Add it to the "DAG cache".
     m_dagCache.add(resource);
     return false;
 }
 
 void SVGResourcesCycleSolver::resolveCycles()
 {
     ASSERT(m_activeResources.isEmpty());
 
     // If the starting LayoutObject is a resource container itself, then add it
     // to the active set (to break direct self-references.)
     if (m_layoutObject->isSVGResourceContainer())
         m_activeResources.add(toLayoutSVGResourceContainer(m_layoutObject));
 
     ResourceSet localResources;
     m_resources->buildSetOfResources(localResources);
 
     // This performs a depth-first search for a back-edge in all the
     // (potentially disjoint) graphs formed by the resources referenced by
     // |m_layoutObject|.
-    ResourceSet::iterator end = localResources.end();
-    for (ResourceSet::iterator it = localResources.begin(); it != end; ++it) {
-        if (m_activeResources.contains(*it) || resourceContainsCycles(*it))
-            breakCycle(*it);
+    for (auto* localResource : localResources) {
+        if (m_activeResources.contains(localResource) || resourceContainsCycles(localResource))
+            breakCycle(localResource);
     }
 
     m_activeResources.clear();
 }
 
 void SVGResourcesCycleSolver::breakCycle(LayoutSVGResourceContainer* resourceLeadingToCycle)
 {
     ASSERT(resourceLeadingToCycle);
     if (resourceLeadingToCycle == m_resources->linkedResource()) {
         m_resources->resetLinkedResource();
@@ skipping 31 matching lines @@
         ASSERT(resourceLeadingToCycle == m_resources->clipper());
         m_resources->resetClipper();
         break;
     default:
         ASSERT_NOT_REACHED();
         break;
     }
 }
 
 }