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 part of $LIBRARYNAME; | 5 part of $LIBRARYNAME; |
6 | 6 |
7 /** | 7 /** |
8 * Lazy implementation of the child nodes of an element that does not request | 8 * Lazy implementation of the child nodes of an element that does not request |
9 * the actual child nodes of an element until strictly necessary greatly | 9 * the actual child nodes of an element until strictly necessary greatly |
10 * improving performance for the typical cases where it is not required. | 10 * improving performance for the typical cases where it is not required. |
(...skipping 127 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
138 } | 138 } |
139 | 139 |
140 String join([String separator]) { | 140 String join([String separator]) { |
141 return IterableMixinWorkaround.joinList(this, separator); | 141 return IterableMixinWorkaround.joinList(this, separator); |
142 } | 142 } |
143 | 143 |
144 Iterable map(f(Node element)) { | 144 Iterable map(f(Node element)) { |
145 return IterableMixinWorkaround.mapList(this, f); | 145 return IterableMixinWorkaround.mapList(this, f); |
146 } | 146 } |
147 | 147 |
148 List mappedBy(f(Node element)) { | |
149 return IterableMixinWorkaround.mappedByList(this, f); | |
150 } | |
151 | |
152 Iterable<Node> where(bool f(Node element)) { | 148 Iterable<Node> where(bool f(Node element)) { |
153 return IterableMixinWorkaround.where(this, f); | 149 return IterableMixinWorkaround.where(this, f); |
154 } | 150 } |
155 | 151 |
156 Iterable expand(Iterable f(Node element)) { | 152 Iterable expand(Iterable f(Node element)) { |
157 return IterableMixinWorkaround.expand(this, f); | 153 return IterableMixinWorkaround.expand(this, f); |
158 } | 154 } |
159 | 155 |
160 bool every(bool f(Node element)) => IterableMixinWorkaround.every(this, f); | 156 bool every(bool f(Node element)) => IterableMixinWorkaround.every(this, f); |
161 | 157 |
(...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
193 } | 189 } |
194 | 190 |
195 Node singleMatching(bool test(Node value)) { | 191 Node singleMatching(bool test(Node value)) { |
196 return IterableMixinWorkaround.singleMatching(this, test); | 192 return IterableMixinWorkaround.singleMatching(this, test); |
197 } | 193 } |
198 | 194 |
199 Node elementAt(int index) { | 195 Node elementAt(int index) { |
200 return this[index]; | 196 return this[index]; |
201 } | 197 } |
202 | 198 |
203 List<Node> get reversed { | 199 Iterable<Node> get reversed { |
204 return IterableMixinWorkaround.reversedList(this); | 200 return IterableMixinWorkaround.reversedList(this); |
205 } | 201 } |
206 | 202 |
207 // TODO(jacobr): this could be implemented for child node lists. | 203 // TODO(jacobr): this could be implemented for child node lists. |
208 // The exception we throw here is misleading. | 204 // The exception we throw here is misleading. |
209 void sort([int compare(Node a, Node b)]) { | 205 void sort([int compare(Node a, Node b)]) { |
210 throw new UnsupportedError("Cannot sort immutable List."); | 206 throw new UnsupportedError("Cannot sort immutable List."); |
211 } | 207 } |
212 | 208 |
213 int indexOf(Node element, [int start = 0]) => | 209 int indexOf(Node element, [int start = 0]) => |
(...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
283 final Node parent = this.parentNode; | 279 final Node parent = this.parentNode; |
284 parent.$dom_replaceChild(otherNode, this); | 280 parent.$dom_replaceChild(otherNode, this); |
285 } catch (e) { | 281 } catch (e) { |
286 | 282 |
287 }; | 283 }; |
288 return this; | 284 return this; |
289 } | 285 } |
290 | 286 |
291 $!MEMBERS | 287 $!MEMBERS |
292 } | 288 } |
OLD | NEW |