| 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 part of dart.core; | |
| 6 | |
| 7 /** | 5 /** |
| 8 * 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 |
| 9 * 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 |
| 10 * an [Iterator]. | 8 * an [Iterator]. |
| 11 */ | 9 */ |
| 12 abstract class Queue<E> extends Collection<E> { | 10 abstract class Queue<E> extends Collection<E> { |
| 13 | 11 |
| 14 /** | 12 /** |
| 15 * Creates a queue. | 13 * Creates a queue. |
| 16 */ | 14 */ |
| (...skipping 314 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 331 } | 329 } |
| 332 | 330 |
| 333 E next() { | 331 E next() { |
| 334 if (!hasNext) { | 332 if (!hasNext) { |
| 335 throw new StateError("No more elements"); | 333 throw new StateError("No more elements"); |
| 336 } | 334 } |
| 337 _currentEntry = _currentEntry._next; | 335 _currentEntry = _currentEntry._next; |
| 338 return _currentEntry.element; | 336 return _currentEntry.element; |
| 339 } | 337 } |
| 340 } | 338 } |
| OLD | NEW |