Morph the APIs for Node, ParentNode, and Element closer to the specs

sky/engine/core/dom/ContainerNode.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, 2013 Apple Inc. 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.
@@ skipping 33 matching lines @@
 namespace blink {
 
 #if ENABLE(ASSERT)
 unsigned EventDispatchForbiddenScope::s_count = 0;
 #endif
 
 static void collectChildrenAndRemoveFromOldParent(Node& node, NodeVector& nodes, ExceptionState& exceptionState)
 {
     if (node.isDocumentFragment()) {
         DocumentFragment& fragment = toDocumentFragment(node);
-        getChildNodes(fragment, nodes);
+        appendChildNodes(fragment, nodes);
         fragment.removeChildren();
         return;
     }
     nodes.append(&node);
     if (ContainerNode* oldParent = node.parentNode())
         oldParent->removeChild(&node, exceptionState);
 }
 
 void ContainerNode::removeDetachedChildren()
 {
@@ skipping 253 matching lines @@
 {
     ASSERT(child.parentNode() == this);
     ChildListMutationScope(*this).willRemoveChild(child);
     child.notifyMutationObserversNodeWillDetach();
     document().nodeWillBeRemoved(child); // e.g. mutation event listener can create a new range.
 }
 
 void ContainerNode::willRemoveChildren()
 {
     NodeVector children;
-    getChildNodes(*this, children);
+    appendChildNodes(*this, children);
 
     ChildListMutationScope mutation(*this);
     for (NodeVector::const_iterator it = children.begin(); it != children.end(); ++it) {
         ASSERT(*it);
         Node& child = **it;
         mutation.willRemoveChild(child);
         child.notifyMutationObserversNodeWillDetach();
     }
 }
 
@@ skipping 523 matching lines @@
         setNeedsStyleRecalc(LocalStyleChange);
         return;
     }
 
     if (styleChangeType() < SubtreeStyleChange) {
         if (renderStyle()->affectedByHover())
             setNeedsStyleRecalc(LocalStyleChange);
     }
 }
 
+Element* ContainerNode::firstElementChild() const
+{
+    return ElementTraversal::firstChild(*this);
+}
+
+Element* ContainerNode::lastElementChild() const
+{
+    return ElementTraversal::lastChild(*this);
+}
+
+Vector<RefPtr<Node>> ContainerNode::getChildNodes() const
+{
+    Vector<RefPtr<Node>> result;
+    for (Node* node = firstChild(); node; node = node->nextSibling())
+        result.append(node);
+    return result;
+}
+
+Vector<RefPtr<Element>> ContainerNode::getChildElements() const
+{
+    Vector<RefPtr<Element>> result;
+    for (Element* element = ElementTraversal::firstWithin(*this); element; element = ElementTraversal::next(*element, this))
+        result.append(element);
+    return result;
+}
+
+void ContainerNode::append(Vector<RefPtr<Node>>& nodes, ExceptionState& es)
+{
+    RefPtr<ContainerNode> protect(this);
+    for (auto& node : nodes) {
+        appendChild(node.release(), es);
+        if (es.had_exception())
+            return;
+    }
+}
+
+void ContainerNode::prepend(Vector<RefPtr<Node>>& nodes, ExceptionState& es)
+{
+    RefPtr<ContainerNode> protect(this);
+    RefPtr<Node> refChild = m_firstChild;
+    for (auto& node : nodes) {
+        insertBefore(node.release(), refChild.get(), es);
+        if (es.had_exception())
+            return;
+    }
+}
+
+PassRefPtr<Node> ContainerNode::prependChild(PassRefPtr<Node> node, ExceptionState& es)
+{
+    return insertBefore(node, m_firstChild, es);
+}
+
+PassRefPtr<Node> ContainerNode::setChild(PassRefPtr<Node> node, ExceptionState& es)
+{
+    RefPtr<ContainerNode> protect(this);
+    removeChildren();
+    return appendChild(node, es);
+}
+
+void ContainerNode::setChildren(Vector<RefPtr<Node>>& nodes, ExceptionState& es)
+{
+    RefPtr<ContainerNode> protect(this);
+    removeChildren();
+    append(nodes, es);
+}
+
 unsigned ContainerNode::countChildren() const
 {
     unsigned count = 0;
     Node *n;
     for (n = firstChild(); n; n = n->nextSibling())
         count++;
     return count;
 }
 
 PassRefPtr<Element> ContainerNode::querySelector(const AtomicString& selectors, ExceptionState& exceptionState)
@@ skipping 63 matching lines @@
         return true;
 
     if (node->isElementNode() && toElement(node)->shadow())
         return true;
 
     return false;
 }
 #endif
 
 } // namespace blink