Update dart2js unit tests to new library API.

dart/sdk/lib/_internal/compiler/implementation/tree/nodes.dart

 // 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 tree;
 
 abstract class Visitor<R> {
   const Visitor();
 
   R visitNode(Node node);
@@ skipping 270 matching lines @@
   Send asSend() => this;
 
   accept(Visitor visitor) => visitor.visitSend(this);
 
   visitChildren(Visitor visitor) {
     if (receiver != null) receiver.accept(visitor);
     if (selector != null) selector.accept(visitor);
     if (argumentsNode != null) argumentsNode.accept(visitor);
   }
 
-  int argumentCount() => (argumentsNode == null) ? -1 : argumentsNode.length;
+  int argumentCount() {
+    return (argumentsNode == null) ? -1 : argumentsNode.slowLength();
+  }
 
   bool get isSuperCall {
     return receiver != null &&
            receiver.asIdentifier() != null &&
            receiver.asIdentifier().isSuper();
   }
   bool get isOperator => selector is Operator;
   bool get isPropertyAccess => argumentsNode == null;
   bool get isFunctionObjectInvocation => selector == null;
   bool get isPrefix => argumentsNode is Prefix;
@@ skipping 101 matching lines @@
   bool isConst() {
     return identical(newToken.stringValue, 'const')
         || identical(newToken.stringValue, '@');
   }
 
   Token getBeginToken() => newToken;
 
   Token getEndToken() => send.getEndToken();
 }
 
-class NodeList extends Node implements Iterable<Node> {
+class NodeList extends Node {
   final Link<Node> nodes;
   final Token beginToken;
   final Token endToken;
   final SourceString delimiter;
   bool get isEmpty => nodes.isEmpty;
 
   NodeList([this.beginToken, this.nodes, this.endToken, this.delimiter]);
 
   Iterator<Node> get iterator => nodes.iterator;
 
   NodeList.singleton(Node node) : this(null, const Link<Node>().prepend(node));
   NodeList.empty() : this(null, const Link<Node>());
 
   NodeList asNodeList() => this;
 
-  int get length {
+  int slowLength() {
     int result = 0;
     for (Link<Node> cursor = nodes; !cursor.isEmpty; cursor = cursor.tail) {
       result++;
     }
     return result;
   }
 
   accept(Visitor visitor) => visitor.visitNodeList(this);
 
   visitChildren(Visitor visitor) {
@@ skipping 22 matching lines @@
     if (endToken != null) return endToken;
     if (nodes != null) {
       Link<Node> link = nodes;
       if (link.isEmpty) return beginToken;
       while (!link.tail.isEmpty) link = link.tail;
       if (link.head.getEndToken() != null) return link.head.getEndToken();
       if (link.head.getBeginToken() != null) return link.head.getBeginToken();
     }
     return beginToken;
   }
-
-  // ------------------- Iterable methods -------------------------------------
-  //
-  // TODO(floitsch): these functions should be pulled in through a mixin
-  // mechanism.
-  Iterable mappedBy(f(Node element)) => new MappedIterable(this, f);
-
-  Iterable<Node> where(bool f(Node element))
-      => new WhereIterable<Node>(this, f);
-
-  bool contains(Node element) {
-    for (Node e in this) {
-      if (e == element) return true;
-    }
-    return false;
-  }
-
-  void forEach(void f(Node element)) {
-    for (Node element in this) f(element);
-  }
-
-  String join([String separator]) => Collections.join(this, separator);
-
-  dynamic reduce(var initialValue,
-                 dynamic combine(var previousValue, Node element)) {
-    var value = initialValue;
-    for (Node element in this) value = combine(value, element);
-    return value;
-  }
-
-  bool every(bool f(Node element)) {
-    for (Node element in this) {
-      if (!f(element)) return false;
-    }
-    return true;
-  }
-
-  bool any(bool f(Node element)) {
-    for (Node element in this) {
-      if (f(element)) return true;
-    }
-    return false;
-  }
-
-  List<Node> toList() => new List<Node>.from(this);
-
-  Set<Node> toSet() => new Set<Node>.from(this);
-
-  Iterable<Node> take(int n) => new TakeIterable<Node>(this, n);
-
-  Iterable<Node> takeWhile(bool test(Node value)) {
-    return new TakeWhileIterable<Node>(this, test);
-  }
-
-  Iterable<Node> skip(int n) => new SkipIterable<Node>(this, n);
-
-  Iterable<Node> skipWhile(bool test(Node value)) {
-    return new SkipWhileIterable<Node>(this, test);
-  }
-
-  Node get first {
-    return Collections.first(this);
-  }
-
-  Node get last {
-    return Collections.last(this);
-  }
-
-  Node get single {
-    return Collections.single(this);
-  }
-
-  Node min([int compare(Node a, Node b)]) => Collections.min(this, compare);
-
-  Node max([int compare(Node a, Node b)]) => Collections.max(this, compare);
-
-  Node firstMatching(bool test(Node value), {Node orElse()}) {
-    return Collections.firstMatching(this, test, orElse);
-  }
-
-  Node lastMatching(bool test(Node value), {Node orElse()}) {
-    return Collections.lastMatching(this, test, orElse);
-  }
-
-  Node singleMatching(bool test(Node value)) {
-    return Collections.singleMatching(this, test);
-  }
-
-  Node elementAt(int index) {
-    return Collections.elementAt(this, index);
-  }
 }
 
 class Block extends Statement {
   final NodeList statements;
 
   Block(this.statements);
 
   Block asBlock() => this;
 
   accept(Visitor visitor) => visitor.visitBlock(this);
@@ skipping 1516 matching lines @@
  * argument).
  *
  * TODO(ahe): This method is controversial, the team needs to discuss
  * if top-level methods are acceptable and what naming conventions to
  * use.
  */
 initializerDo(Node node, f(Node node)) {
   SendSet send = node.asSendSet();
   if (send != null) return f(send.arguments.head);
 }