Use C++11 range based iteration for invalidation sets.

Source/core/css/invalidation/DescendantInvalidationSet.cpp

 /*
  * Copyright (C) 2014 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 38 matching lines @@
         return true;
 
     if (m_tagNames && m_tagNames->contains(element.tagQName().localName()))
         return true;
 
     if (element.hasID() && m_ids && m_ids->contains(element.idForStyleResolution()))
         return true;
 
     if (element.hasClass() && m_classes) {
         const SpaceSplitString& classNames = element.classNames();
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_classes->begin(); it != m_classes->end(); ++it) {
-            if (classNames.contains(*it))
+        for (const auto& className : *m_classes) {
+            if (classNames.contains(className))
                 return true;
         }
     }
 
     if (element.hasAttributes() && m_attributes) {
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_attributes->begin(); it != m_attributes->end(); ++it) {
-            if (element.hasAttribute(*it))
+        for (const auto& attribute : *m_attributes) {
+            if (element.hasAttribute(attribute))
                 return true;
         }
     }
 
     return false;
 }
 
 void DescendantInvalidationSet::combine(const DescendantInvalidationSet& other)
 {
     // No longer bother combining data structures, since the whole subtree is deemed invalid.
     if (wholeSubtreeInvalid())
         return;
 
     if (other.wholeSubtreeInvalid()) {
         setWholeSubtreeInvalid();
         return;
     }
 
     if (other.customPseudoInvalid())
         setCustomPseudoInvalid();
 
     if (other.treeBoundaryCrossing())
         setTreeBoundaryCrossing();
 
     if (other.m_classes) {
-        WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_classes->end();
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_classes->begin(); it != end; ++it)
-            addClass(*it);
+        for (const auto& className : *other.m_classes)
+            addClass(className);
     }
 
     if (other.m_ids) {
-        WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_ids->end();
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_ids->begin(); it != end; ++it)
-            addId(*it);
+        for (const auto& id : *other.m_ids)
+            addId(id);
     }
 
     if (other.m_tagNames) {
-        WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_tagNames->end();
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_tagNames->begin(); it != end; ++it)
-            addTagName(*it);
+        for (const auto& tagName : *other.m_tagNames)
+            addTagName(tagName);
     }
 
     if (other.m_attributes) {
-        WillBeHeapHashSet<AtomicString>::const_iterator end = other.m_attributes->end();
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = other.m_attributes->begin(); it != end; ++it)
-            addAttribute(*it);
+        for (const auto& attribute : *other.m_attributes)
+            addAttribute(attribute);
     }
 }
 
 WillBeHeapHashSet<AtomicString>& DescendantInvalidationSet::ensureClassSet()
 {
     if (!m_classes)
         m_classes = adoptPtrWillBeNoop(new WillBeHeapHashSet<AtomicString>);
     return *m_classes;
 }
 
@@ skipping 73 matching lines @@
 void DescendantInvalidationSet::show() const
 {
     fprintf(stderr, "DescendantInvalidationSet { ");
     if (m_allDescendantsMightBeInvalid)
         fprintf(stderr, "* ");
     if (m_customPseudoInvalid)
         fprintf(stderr, "::custom ");
     if (m_treeBoundaryCrossing)
         fprintf(stderr, "::shadow/deep/ ");
     if (m_ids) {
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_ids->begin(); it != m_ids->end(); ++it)
-            fprintf(stderr, "#%s ", (*it).ascii().data());
+        for (const auto& id : *m_ids)
+            fprintf(stderr, "#%s ", id.ascii().data());
     }
     if (m_classes) {
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_classes->begin(); it != m_classes->end(); ++it)
-            fprintf(stderr, ".%s ", (*it).ascii().data());
+        for (const auto& className : *m_classes)
+            fprintf(stderr, ".%s ", className.ascii().data());
     }
     if (m_tagNames) {
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_tagNames->begin(); it != m_tagNames->end(); ++it)
-            fprintf(stderr, "<%s> ", (*it).ascii().data());
+        for (const auto& tagName : *m_tagNames)
+            fprintf(stderr, "<%s> ", tagName.ascii().data());
     }
     if (m_attributes) {
-        for (WillBeHeapHashSet<AtomicString>::const_iterator it = m_attributes->begin(); it != m_attributes->end(); ++it)
-            fprintf(stderr, "[%s] ", (*it).ascii().data());
+        for (const auto& attribute : *m_attributes)
+            fprintf(stderr, "[%s] ", attribute.ascii().data());
     }
     fprintf(stderr, "}\n");
 }
 #endif // NDEBUG
 
 } // namespace blink