Growable typed data buffers.

sdk/lib/collection/list.dart

 // Copyright (c) 2013, 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 dart.collection;
 
 /**
  * Abstract implementation of a list.
  *
  * All operations are defined in terms of `length`, `operator[]`,
@@ skipping 444 matching lines @@
     setRange(index, this.length - 1, this, index + 1);
     length--;
     return result;
   }
 
   void insertAll(int index, Iterable<E> iterable) {
     if (index < 0 || index > length) {
       throw new RangeError.range(index, 0, length);
     }
     // TODO(floitsch): we can probably detect more cases.
+    // TODO(lrn): How about having a marker interface that promises that length

[floitsch, 2013/10/15 15:28:05]

That should be done now.

+    // is efficient? List implements EfficientLength.
     if (iterable is! List && iterable is! Set && iterable is! SubListIterable) {
       iterable = iterable.toList();
     }
     int insertionLength = iterable.length;
     // There might be errors after the length change, in which case the list
     // will end up being modified but the operation not complete. Unless we
     // always go through a "toList" we can't really avoid that.
     this.length += insertionLength;
     setRange(index + insertionLength, this.length, this, index);
     setAll(index, iterable);
@@ skipping 23 matching lines @@
       result.writeAll(this, ', ');
       result.write(']');
      } finally {
        assert(identical(_toStringList.last, this));
        _toStringList.removeLast();
      }
 
     return result.toString();
   }
 }