| OLD | NEW |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, 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 /** | 6 /** |
| 7 * An entry in a doubly linked list. It contains a pointer to the next | 7 * An entry in a doubly linked list. It contains a pointer to the next |
| 8 * entry, the previous entry, and the boxed element. | 8 * entry, the previous entry, and the boxed element. |
| 9 */ | 9 */ |
| 10 class DoubleLinkedQueueEntry<E> { | 10 class DoubleLinkedQueueEntry<E> { |
| (...skipping 243 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 254 } | 254 } |
| 255 | 255 |
| 256 E next() { | 256 E next() { |
| 257 if (!hasNext()) { | 257 if (!hasNext()) { |
| 258 throw const NoMoreElementsException(); | 258 throw const NoMoreElementsException(); |
| 259 } | 259 } |
| 260 _currentEntry = _currentEntry._next; | 260 _currentEntry = _currentEntry._next; |
| 261 return _currentEntry.element; | 261 return _currentEntry.element; |
| 262 } | 262 } |
| 263 } | 263 } |
| OLD | NEW |