Drop const_iterator for AttributeCollection

Source/core/dom/Node.cpp

Index: Source/core/dom/Node.cpp
diff --git a/Source/core/dom/Node.cpp b/Source/core/dom/Node.cpp
index 03d6285314aa16d6dfbae508bfe14f4ef8509451..19c2cc0cfecd019f70ed76f2247f9c11b7588de5 100644
--- a/Source/core/dom/Node.cpp
+++ b/Source/core/dom/Node.cpp
@@ -1271,8 +1271,8 @@ bool Node::isDefaultNamespace(const AtomicString& namespaceURIMaybeEmpty) const
                 return element.namespaceURI() == namespaceURI;
 
             AttributeCollection attributes = element.attributes();
-            AttributeCollection::const_iterator end = attributes.end();
-            for (AttributeCollection::const_iterator it = attributes.begin(); it != end; ++it) {
+            AttributeCollection::iterator end = attributes.end();
+            for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it) {
                 if (it->localName() == xmlnsAtom)
                     return it->value() == namespaceURI;
             }
@@ -1354,8 +1354,8 @@ const AtomicString& Node::lookupNamespaceURI(const String& prefix) const
                 return element.namespaceURI();
 
             AttributeCollection attributes = element.attributes();
-            AttributeCollection::const_iterator end = attributes.end();
-            for (AttributeCollection::const_iterator it = attributes.begin(); it != end; ++it) {
+            AttributeCollection::iterator end = attributes.end();
+            for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it) {
                 if (it->prefix() == xmlnsAtom && it->localName() == prefix) {
                     if (!it->value().isEmpty())
                         return it->value();
@@ -1515,8 +1515,8 @@ unsigned short Node::compareDocumentPosition(const Node* otherNode, ShadowTreesT
         // We are comparing two attributes on the same node. Crawl our attribute map and see which one we hit first.
         const Element* owner1 = attr1->ownerElement();
         AttributeCollection attributes = owner1->attributes();
-        AttributeCollection::const_iterator end = attributes.end();
-        for (AttributeCollection::const_iterator it = attributes.begin(); it != end; ++it) {
+        AttributeCollection::iterator end = attributes.end();
+        for (AttributeCollection::iterator it = attributes.begin(); it != end; ++it) {
             // If neither of the two determining nodes is a child node and nodeType is the same for both determining nodes, then an
             // implementation-dependent order between the determining nodes is returned. This order is stable as long as no nodes of
             // the same nodeType are inserted into or removed from the direct container. This would be the case, for example,