Make iterator for Element's attributes more lightweight

Source/core/dom/Node.cpp

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2008 Nokia Corporation and/or its subsidiary(-ies)
  * Copyright (C) 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
@@ skipping 1309 matching lines @@
     const AtomicString& namespaceURI = namespaceURIMaybeEmpty.isEmpty() ? nullAtom : namespaceURIMaybeEmpty;
 
     switch (nodeType()) {
         case ELEMENT_NODE: {
             const Element& element = toElement(*this);
 
             if (element.prefix().isNull())
                 return element.namespaceURI() == namespaceURI;
 
             if (element.hasAttributes()) {
-                AttributeIteratorAccessor attributes = element.attributesIterator();
-                AttributeConstIterator end = attributes.end();
-                for (AttributeConstIterator it = attributes.begin(); it != end; ++it) {
+                AttributeCollection attributes = element.attributes();
+                AttributeCollection::const_iterator end = attributes.end();
+                for (AttributeCollection::const_iterator it = attributes.begin(); it != end; ++it) {
                     if (it->localName() == xmlnsAtom)
                         return it->value() == namespaceURI;
                 }
             }
 
             if (Element* parent = parentElement())
                 return parent->isDefaultNamespace(namespaceURI);
 
             return false;
         }
@@ skipping 62 matching lines @@
         return nullAtom;
 
     switch (nodeType()) {
         case ELEMENT_NODE: {
             const Element& element = toElement(*this);
 
             if (!element.namespaceURI().isNull() && element.prefix() == prefix)
                 return element.namespaceURI();
 
             if (element.hasAttributes()) {
-                AttributeIteratorAccessor attributes = element.attributesIterator();
-                AttributeConstIterator end = attributes.end();
-                for (AttributeConstIterator it = attributes.begin(); it != end; ++it) {
+                AttributeCollection attributes = element.attributes();
+                AttributeCollection::const_iterator end = attributes.end();
+                for (AttributeCollection::const_iterator it = attributes.begin(); it != end; ++it) {
                     if (it->prefix() == xmlnsAtom && it->localName() == prefix) {
                         if (!it->value().isEmpty())
                             return it->value();
                         return nullAtom;
                     }
                     if (it->localName() == xmlnsAtom && prefix.isNull()) {
                         if (!it->value().isEmpty())
                             return it->value();
                         return nullAtom;
                     }
@@ skipping 140 matching lines @@
     Vector<const Node*, 16> chain2;
     if (attr1)
         chain1.append(attr1);
     if (attr2)
         chain2.append(attr2);
 
     if (attr1 && attr2 && start1 == start2 && start1) {
         // 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();
         owner1->synchronizeAllAttributes();
-        AttributeIteratorAccessor attributes = owner1->attributesIterator();
-        AttributeConstIterator end = attributes.end();
-        for (AttributeConstIterator it = attributes.begin(); it != end; ++it) {
+        AttributeCollection attributes = owner1->attributes();
+        AttributeCollection::const_iterator end = attributes.end();
+        for (AttributeCollection::const_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,
             // when comparing two attributes of the same element, and inserting or removing additional attributes might change
             // the order between existing attributes.
             if (attr1->qualifiedName() == it->name())
                 return DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC | DOCUMENT_POSITION_FOLLOWING;
             if (attr2->qualifiedName() == it->name())
                 return DOCUMENT_POSITION_IMPLEMENTATION_SPECIFIC | DOCUMENT_POSITION_PRECEDING;
         }
@@ skipping 981 matching lines @@
         node->showTreeForThis();
 }
 
 void showNodePath(const WebCore::Node* node)
 {
     if (node)
         node->showNodePathForThis();
 }
 
 #endif