New analyzer snapshot.

editor/util/plugins/com.google.dart.java2dart/resources/ast_include.dart

 
 /**
  * Instances of the class {@code NodeList} represent a list of AST nodes that have a common parent.
  */
 class NodeList<E extends ASTNode> extends Object with ListMixin<E> {
   /**
    * Create an empty list with the given owner. This is a convenience method that allows the
    * compiler to determine the correct value of the type argument [E] without needing to
    * explicitly specify it.
    *
@@ skipping 18 matching lines @@
    * @param owner the node that is the parent of each of the elements in the list
    */
   NodeList(this.owner);
 
   /**
    * Use the given visitor to visit each of the nodes in this list.
    *
    * @param visitor the visitor to be used to visit the elements of this list
    */
   accept(ASTVisitor visitor) {
-    for (E element in _elements) {
-      element.accept(visitor);
+    var length = _elements.length;
+    for (var i = 0; i < length; i++) {
+      _elements[i].accept(visitor);
     }
   }
   void add(E node) {
     insert(length, node);
   }
   void insert(int index, E node) {
     int length = _elements.length;
     if (index < 0 || index > length) {
       throw new RangeError("Index: ${index}, Size: ${_elements.length}");
     }
     owner.becomeParentOf(node);
     if (length == 0) {
       _elements = <E> [node];
     } else {
-      List<E> newElements = new List<E>(length + 1);
-      JavaSystem.arraycopy(_elements, 0, newElements, 0, index);
-      newElements[index] = node;
-      JavaSystem.arraycopy(_elements, index, newElements, index + 1, length - index);
-      _elements = newElements;
+      _elements.insert(index, node);
     }
   }
   bool addAll(Iterable<E> nodes) {
     if (nodes != null && !nodes.isEmpty) {
-      int oldCount = _elements.length;
-      int newCount = nodes.length;
-      List<E> newElements = new List<E>(oldCount + newCount);
-      JavaSystem.arraycopy(_elements, 0, newElements, 0, oldCount);
-      int index = oldCount;
+      _elements.addAll(nodes);
       for (E node in nodes) {
         owner.becomeParentOf(node);
-        newElements[index++] = node;
       }
-      _elements = newElements;
       return true;
     }
     return false;
   }
   E operator[](int index) {
     if (index < 0 || index >= _elements.length) {
       throw new RangeError("Index: ${index}, Size: ${_elements.length}");
     }
     return _elements[index] as E;
   }
@@ skipping 24 matching lines @@
   E removeAt(int index) {
     if (index < 0 || index >= _elements.length) {
       throw new RangeError("Index: ${index}, Size: ${_elements.length}");
     }
     E removedNode = _elements[index] as E;
     int length = _elements.length;
     if (length == 1) {
       _elements = ASTNode.EMPTY_ARRAY;
       return removedNode;
     }
-    List<E> newElements = new List<E>(length - 1);
-    JavaSystem.arraycopy(_elements, 0, newElements, 0, index);
-    JavaSystem.arraycopy(_elements, index + 1, newElements, index, length - index - 1);
-    _elements = newElements;
+    _elements.removeAt(index);
     return removedNode;
   }
   void operator[]=(int index, E node) {
     if (index < 0 || index >= _elements.length) {
       throw new RangeError("Index: ${index}, Size: ${_elements.length}");
     }
-    _elements[index] as E;
     owner.becomeParentOf(node);
     _elements[index] = node;
   }
   int get length => _elements.length;
 }