| OLD | NEW |
|---|
| 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
| 4 | 4 |
| 5 /** | 5 /** |
| 6 * A [Queue] is a collection that can be manipulated at both ends. One | 6 * A [Queue] is a collection that can be manipulated at both ends. One |
| 7 * can iterate over the elements of a queue through [forEach] or with | 7 * can iterate over the elements of a queue through [forEach] or with |
| 8 * an [Iterator]. | 8 * an [Iterator]. |
| 9 */ | 9 */ |
| 10 interface Queue<E> extends Collection<E> default DoubleLinkedQueue<E> { | 10 interface Queue<E> extends Collection<E> default DoubleLinkedQueue<E> { |
| (...skipping 52 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 63 * Returns the last element of the queue. Throws an | 63 * Returns the last element of the queue. Throws an |
| 64 * [EmptyQueueException] exception if this queue is empty. | 64 * [EmptyQueueException] exception if this queue is empty. |
| 65 */ | 65 */ |
| 66 E last(); | 66 E last(); |
| 67 | 67 |
| 68 /** | 68 /** |
| 69 * Removes all elements in the queue. The size of the queue becomes zero. | 69 * Removes all elements in the queue. The size of the queue becomes zero. |
| 70 */ | 70 */ |
| 71 void clear(); | 71 void clear(); |
| 72 } | 72 } |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 10890030:
Move core and coreimpl from corelib/ to lib/core and lib/coreimpl. (Closed)
Base URL: https://dart.googlecode.com/svn/branches/bleeding_edge/dart