| 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 html; | 5 part of html; |
| 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 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 182 } | 182 } |
| 183 | 183 |
| 184 Node singleMatching(bool test(Node value)) { | 184 Node singleMatching(bool test(Node value)) { |
| 185 return IterableMixinWorkaround.singleMatching(this, test); | 185 return IterableMixinWorkaround.singleMatching(this, test); |
| 186 } | 186 } |
| 187 | 187 |
| 188 Node elementAt(int index) { | 188 Node elementAt(int index) { |
| 189 return this[index]; | 189 return this[index]; |
| 190 } | 190 } |
| 191 | 191 |
| 192 List<Node> get reversed => | 192 List<Node> get reversed { |
| 193 new ReversedListView<Node>(this, 0, null); | 193 return IterableMixinWorkaround.reversedList(this); |
| 194 } |
| 194 | 195 |
| 195 // TODO(jacobr): this could be implemented for child node lists. | 196 // TODO(jacobr): this could be implemented for child node lists. |
| 196 // The exception we throw here is misleading. | 197 // The exception we throw here is misleading. |
| 197 void sort([int compare(Node a, Node b)]) { | 198 void sort([int compare(Node a, Node b)]) { |
| 198 throw new UnsupportedError("Cannot sort immutable List."); | 199 throw new UnsupportedError("Cannot sort immutable List."); |
| 199 } | 200 } |
| 200 | 201 |
| 201 int indexOf(Node element, [int start = 0]) => | 202 int indexOf(Node element, [int start = 0]) => |
| 202 Lists.indexOf(this, element, start, this.length); | 203 Lists.indexOf(this, element, start, this.length); |
| 203 | 204 |
| (...skipping 67 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 271 final Node parent = this.parentNode; | 272 final Node parent = this.parentNode; |
| 272 parent.$dom_replaceChild(otherNode, this); | 273 parent.$dom_replaceChild(otherNode, this); |
| 273 } catch (e) { | 274 } catch (e) { |
| 274 | 275 |
| 275 }; | 276 }; |
| 276 return this; | 277 return this; |
| 277 } | 278 } |
| 278 | 279 |
| 279 $!MEMBERS | 280 $!MEMBERS |
| 280 } | 281 } |
| OLD | NEW |