Use C++11 range-based loop for core/xml and core/loader

Source/core/xml/XPathNodeSet.cpp

 /*
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  *
  * 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
@@ skipping 217 matching lines @@
 
     for (Node& n : NodeTraversal::startsAt(findRootNode(m_nodes.first().get()))) {
         if (nodes.contains(&n))
             sortedNodes.append(&n);
 
         if (!containsAttributeNodes || !n.isElementNode())
             continue;
 
         Element* element = toElement(&n);
         AttributeCollection attributes = element->attributes();
-        AttributeCollection::iterator end = attributes.end();
-        for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it) {
-            RefPtrWillBeRawPtr<Attr> attr = element->attrIfExists(it->name());
+        for (auto& attribute : attributes) {
+            RefPtrWillBeRawPtr<Attr> attr = element->attrIfExists(attribute.name());
             if (attr && nodes.contains(attr.get()))
                 sortedNodes.append(attr);
         }
     }
 
     ASSERT(sortedNodes.size() == nodeCount);
     const_cast<WillBeHeapVector<RefPtrWillBeMember<Node> >&>(m_nodes).swap(sortedNodes);
 }
 
 void NodeSet::reverse()
@@ skipping 24 matching lines @@
 Node* NodeSet::anyNode() const
 {
     if (isEmpty())
         return 0;
 
     return m_nodes.at(0).get();
 }
 
 }
 }