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 util_implementation; | |
6 | |
7 class LinkIterator<T> implements Iterator<T> { | 5 class LinkIterator<T> implements Iterator<T> { |
8 Link<T> current; | 6 Link<T> current; |
9 LinkIterator(Link<T> this.current); | 7 LinkIterator(Link<T> this.current); |
10 bool hasNext() => !current.isEmpty(); | 8 bool hasNext() => !current.isEmpty(); |
11 T next() { | 9 T next() { |
12 T result = current.head; | 10 T result = current.head; |
13 current = current.tail; | 11 current = current.tail; |
14 return result; | 12 return result; |
15 } | 13 } |
16 } | 14 } |
(...skipping 94 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
111 length++; | 109 length++; |
112 LinkEntry<T> entry = new LinkEntry<T>(t, null); | 110 LinkEntry<T> entry = new LinkEntry<T>(t, null); |
113 if (head == null) { | 111 if (head == null) { |
114 head = entry; | 112 head = entry; |
115 } else { | 113 } else { |
116 lastLink.tail = entry; | 114 lastLink.tail = entry; |
117 } | 115 } |
118 lastLink = entry; | 116 lastLink = entry; |
119 } | 117 } |
120 } | 118 } |
OLD | NEW |