Deprecate LinkedList.

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 "collection.dart";
 
 /**
  * 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 99 matching lines @@
     if (_nextLink != null) _nextLink._previousLink = _previousLink;
     _nextLink = null;
     _previousLink = null;
   }
 }
 
 /**
  * An entry in a doubly linked list. It contains a pointer to the next
  * entry, the previous entry, and the boxed element.
  */
+@deprecated
 class DoubleLinkedQueueEntry<E> extends _DoubleLink<DoubleLinkedQueueEntry<E>> {
   /// The element in the queue.
   E element;
 
   DoubleLinkedQueueEntry(this.element);
 
   /// Appends the given [e] as entry just after this entry.
   void append(E e) {
     new DoubleLinkedQueueEntry<E>(e)._link(this, _nextLink);
   }
@@ skipping 115 matching lines @@
 
   /** Hit by, e.g., [DoubleLinkedQueue.first] if the queue is empty. */
   E get _element {
     throw IterableElementError.noElement();
   }
 }
 
 /**
  * A [Queue] implementation based on a double-linked list.
  *
+ * Deprecated. Use [ListQueue] or `DoubleLinkedQueue` from package
+ * `collection`, instead. [https://pub.dartlang.org/packages/collection]
+ *
  * Allows constant time add, remove-at-ends and peek operations.
  */
+@deprecated
 class DoubleLinkedQueue<E> extends Iterable<E> implements Queue<E> {
   _DoubleLinkedQueueSentinel<E> _sentinel;
   int _elementCount = 0;
 
   DoubleLinkedQueue() {
     _sentinel = new _DoubleLinkedQueueSentinel<E>(this);
   }
 
   /**
    * Creates a double-linked queue containing all [elements].
@@ skipping 605 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;
   }
 }