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 |
5 /** | 7 /** |
6 * A [Queue] is a collection that can be manipulated at both ends. One | 8 * 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 | 9 * can iterate over the elements of a queue through [forEach] or with |
8 * an [Iterator]. | 10 * an [Iterator]. |
9 */ | 11 */ |
10 abstract class Queue<E> extends Collection<E> { | 12 abstract class Queue<E> extends Collection<E> { |
11 | 13 |
12 /** | 14 /** |
13 * Creates a queue. | 15 * Creates a queue. |
14 */ | 16 */ |
(...skipping 314 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
329 } | 331 } |
330 | 332 |
331 E next() { | 333 E next() { |
332 if (!hasNext) { | 334 if (!hasNext) { |
333 throw new StateError("No more elements"); | 335 throw new StateError("No more elements"); |
334 } | 336 } |
335 _currentEntry = _currentEntry._next; | 337 _currentEntry = _currentEntry._next; |
336 return _currentEntry.element; | 338 return _currentEntry.element; |
337 } | 339 } |
338 } | 340 } |
OLD | NEW |