Exposing Node.firstChild and Node.lastChild.

tools/dom/templates/html/impl/impl_Node.darttemplate

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 part of $LIBRARYNAME;
 
 /**
  * Lazy implementation of the child nodes of an element that does not request
  * the actual child nodes of an element until strictly necessary greatly
  * improving performance for the typical cases where it is not required.
@@ skipping 16 matching lines @@
     return result;
   }
   Node get single {
     int l = this.length;
     if (l == 0) throw new StateError("No elements");
     if (l > 1) throw new StateError("More than one element");
     return JS('Node|Null', '#.firstChild', _this);
   }
 $else
   Node get first {
-    Node result = _this.$dom_firstChild;
+    Node result = _this.firstChild;
     if (result == null) throw new StateError("No elements");
     return result;
   }
   Node get last {
-    Node result = _this.$dom_lastChild;
+    Node result = _this.lastChild;
     if (result == null) throw new StateError("No elements");
     return result;
   }
   Node get single {
     int l = this.length;
     if (l == 0) throw new StateError("No elements");
     if (l > 1) throw new StateError("More than one element");
-    return _this.$dom_firstChild;
+    return _this.firstChild;
   }
 $endif
 
   void add(Node value) {
     _this.append(value);
   }
 
   void addAll(Iterable<Node> iterable) {
     if (iterable is _ChildNodeListLazy) {
       _ChildNodeListLazy otherList = iterable;
       if (!identical(otherList._this, _this)) {
         // Optimized route for copying between nodes.
         for (var i = 0, len = otherList.length; i < len; ++i) {
-          // Should use $dom_firstChild, Bug 8886.
-          _this.append(otherList[0]);
+          _this.append(otherList._this.firstChild);
         }
       }
       return;
     }
     for (Node node in iterable) {
       _this.append(node);
     }
   }
 
   void insert(int index, Node node) {
@@ skipping 37 matching lines @@
     Node node = object;
     if (!identical(_this, node.parentNode)) return false;
     _this.$dom_removeChild(node);
     return true;
   }
 
   void _filter(bool test(Node node), bool removeMatching) {
     // This implementation of removeWhere/retainWhere is more efficient
     // than the default in ListBase. Child nodes can be removed in constant
     // time.
-    Node child = _this.$dom_firstChild;
+    Node child = _this.firstChild;
     while (child != null) {
       Node nextChild = child.nextNode;
       if (test(child) == removeMatching) {
         _this.$dom_removeChild(child);
       }
       child = nextChild;
     }
   }
 
   void removeWhere(bool test(Node node)) {
@@ skipping 96 matching lines @@
    */
   Node insertAllBefore(Iterable<Node> newNodes, Node refChild) {
     if (newNodes is _ChildNodeListLazy) {
       _ChildNodeListLazy otherList = newNodes;
       if (identical(otherList._this, this)) {
         throw new ArgumentError(newNodes);
       }
 
       // Optimized route for copying between nodes.
       for (var i = 0, len = otherList.length; i < len; ++i) {
-        // Should use $dom_firstChild, Bug 8886.
-        this.insertBefore(otherList[0], refChild);
+        this.insertBefore(otherList._this.firstChild, refChild);
       }
     } else {
       for (var node in newNodes) {
         this.insertBefore(node, refChild);
       }
     }
   }
 
   /**
    * Print out a String representation of this Node.
@@ skipping 22 matching lines @@
   TemplateInstance _templateInstance;
 
   /** Gets the template instance that instantiated this node, if any. */
   @Experimental
   TemplateInstance get templateInstance =>
       _templateInstance != null ? _templateInstance :
       (parent != null ? parent.templateInstance : null);
 
 $!MEMBERS
 }