| OLD | NEW |
| 1 Sky DOM APIs | 1 Sky DOM APIs |
| 2 ============ | 2 ============ |
| 3 | 3 |
| 4 ```dart | 4 ```dart |
| 5 SKY MODULE | 5 SKY MODULE |
| 6 <!-- part of sky:core --> | 6 <!-- part of dart:sky --> |
| 7 | 7 |
| 8 <script> | 8 <script> |
| 9 // ELEMENT TREE API | 9 // ELEMENT TREE API |
| 10 | 10 |
| 11 abstract class Node extends EventTarget { | 11 abstract class Node extends EventTarget { |
| 12 @override | 12 @override |
| 13 external List<EventTarget> getEventDispatchChain(); // O(N) in number of ances
tors across shadow trees | 13 external List<EventTarget> getEventDispatchChain(); // O(N) in number of ances
tors across shadow trees |
| 14 // implements EventTarget.getEventDispatchChain() | 14 // implements EventTarget.getEventDispatchChain() |
| 15 // returns the event dispatch chain (including handling shadow trees) | 15 // returns the event dispatch chain (including handling shadow trees) |
| 16 | 16 |
| (...skipping 364 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 381 external bool matches(Element element); // O(F()) | 381 external bool matches(Element element); // O(F()) |
| 382 external Element find(node root); // O(N*F())+O(M) where N is the number of de
scendants and M the average depth of the tree | 382 external Element find(node root); // O(N*F())+O(M) where N is the number of de
scendants and M the average depth of the tree |
| 383 external List<Element> findAll(Node root); // O(N*F())+O(N*M) where N is the n
umber of descendants and M the average depth of the tree | 383 external List<Element> findAll(Node root); // O(N*F())+O(N*M) where N is the n
umber of descendants and M the average depth of the tree |
| 384 // find() and findAll() throw if the root is not one of the following: | 384 // find() and findAll() throw if the root is not one of the following: |
| 385 // - Element | 385 // - Element |
| 386 // - Fragment | 386 // - Fragment |
| 387 // - Root | 387 // - Root |
| 388 } | 388 } |
| 389 </script> | 389 </script> |
| 390 ``` | 390 ``` |
| OLD | NEW |