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 // WARNING: Do not edit - generated code. | 5 // WARNING: Do not edit - generated code. |
6 | 6 |
7 interface TreeWalker { | 7 interface TreeWalker { |
8 | 8 |
9 Node get currentNode(); | 9 Node currentNode; |
10 | 10 |
11 void set currentNode(Node value); | 11 final bool expandEntityReferences; |
12 | 12 |
13 bool get expandEntityReferences(); | 13 final NodeFilter filter; |
14 | 14 |
15 NodeFilter get filter(); | 15 final Node root; |
16 | 16 |
17 Node get root(); | 17 final int whatToShow; |
18 | |
19 int get whatToShow(); | |
20 | 18 |
21 Node firstChild(); | 19 Node firstChild(); |
22 | 20 |
23 Node lastChild(); | 21 Node lastChild(); |
24 | 22 |
25 Node nextNode(); | 23 Node nextNode(); |
26 | 24 |
27 Node nextSibling(); | 25 Node nextSibling(); |
28 | 26 |
29 Node parentNode(); | 27 Node parentNode(); |
30 | 28 |
31 Node previousNode(); | 29 Node previousNode(); |
32 | 30 |
33 Node previousSibling(); | 31 Node previousSibling(); |
34 } | 32 } |
OLD | NEW |