Update dart:collection.

tool/input_sdk/lib/collection/queue.dart

 // Copyright (c) 2011, 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;
 
 /**
  * A [Queue] is a collection that can be manipulated at both ends. One
  * can iterate over the elements of a queue through [forEach] or with
  * an [Iterator].
@@ skipping 275 matching lines @@
 
   /**
    * Creates a double-linked queue containing all [elements].
    *
    * The element order in the queue is as if the elements were added using
    * [addLast] in the order provided by [elements.iterator].
    */
   factory DoubleLinkedQueue.from(Iterable elements) {
     Queue<E> list = new DoubleLinkedQueue<E>();
     for (final e in elements) {
-      list.addLast(e as E);
+      E element = e as Object/*=E*/;
+      list.addLast(element);
     }
     return list;
   }
 
   int get length => _elementCount;
 
   void addLast(E value) {
     _sentinel._prepend(value);
     _elementCount++;
   }
@@ skipping 184 matching lines @@
    * `elements.iterator`.
    *
    * All `elements` should be assignable to [E].
    */
   factory ListQueue.from(Iterable elements) {
     if (elements is List) {
       int length = elements.length;
       ListQueue<E> queue = new ListQueue(length + 1);
       assert(queue._table.length > length);
       for (int i = 0; i < length; i++) {
-        queue._table[i] = elements[i] as E;
+        queue._table[i] = elements[i] as Object/*=E*/;
       }
       queue._tail = length;
       return queue;
     } else {
       int capacity = _INITIAL_CAPACITY;
       if (elements is EfficientLength) {
         capacity = elements.length;
       }
       ListQueue<E> result = new ListQueue<E>(capacity);
       for (final element in elements) {
-        result.addLast(element as E);
+        result.addLast(element as Object/*=E*/);
       }
       return result;
     }
   }
 
   // Iterable interface.
 
   Iterator<E> get iterator => new _ListQueueIterator<E>(this);
 
   void forEach(void action (E element)) {
@@ skipping 309 matching lines @@
     _queue._checkModification(_modificationCount);
     if (_position == _end) {
       _current = null;
       return false;
     }
     _current = _queue._table[_position];
     _position = (_position + 1) & (_queue._table.length - 1);
     return true;
   }
 }