OLD | NEW |
1 // Copyright (c) 2014, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2014, 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 // This code was auto-generated, is not intended to be edited, and is subject to | 5 // This code was auto-generated, is not intended to be edited, and is subject to |
6 // significant change. Please see the README file for more information. | 6 // significant change. Please see the README file for more information. |
7 | 7 |
8 library engine.ast; | 8 library engine.ast; |
9 | 9 |
10 import 'dart:collection'; | 10 import 'dart:collection'; |
(...skipping 2712 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2723 static const List<AstNode> EMPTY_LIST = const <AstNode>[]; | 2723 static const List<AstNode> EMPTY_LIST = const <AstNode>[]; |
2724 | 2724 |
2725 /** | 2725 /** |
2726 * A comparator that can be used to sort AST nodes in lexical order. In other | 2726 * A comparator that can be used to sort AST nodes in lexical order. In other |
2727 * words, `compare` will return a negative value if the offset of the first | 2727 * words, `compare` will return a negative value if the offset of the first |
2728 * node is less than the offset of the second node, zero (0) if the nodes have | 2728 * node is less than the offset of the second node, zero (0) if the nodes have |
2729 * the same offset, and a positive value if the offset of the first node is | 2729 * the same offset, and a positive value if the offset of the first node is |
2730 * greater than the offset of the second node. | 2730 * greater than the offset of the second node. |
2731 */ | 2731 */ |
2732 static Comparator<AstNode> LEXICAL_ORDER = | 2732 static Comparator<AstNode> LEXICAL_ORDER = |
2733 (AstNode first, AstNode second) => second.offset - first.offset; | 2733 (AstNode first, AstNode second) => first.offset - second.offset; |
2734 | 2734 |
2735 /** | 2735 /** |
2736 * The parent of the node, or `null` if the node is the root of an AST | 2736 * The parent of the node, or `null` if the node is the root of an AST |
2737 * structure. | 2737 * structure. |
2738 */ | 2738 */ |
2739 AstNode _parent; | 2739 AstNode _parent; |
2740 | 2740 |
2741 /** | 2741 /** |
2742 * A table mapping the names of properties to their values, or `null` if this | 2742 * A table mapping the names of properties to their values, or `null` if this |
2743 * node does not have any properties associated with it. | 2743 * node does not have any properties associated with it. |
(...skipping 17453 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
20197 } | 20197 } |
20198 | 20198 |
20199 @override | 20199 @override |
20200 accept(AstVisitor visitor) => visitor.visitYieldStatement(this); | 20200 accept(AstVisitor visitor) => visitor.visitYieldStatement(this); |
20201 | 20201 |
20202 @override | 20202 @override |
20203 void visitChildren(AstVisitor visitor) { | 20203 void visitChildren(AstVisitor visitor) { |
20204 _safelyVisitChild(_expression, visitor); | 20204 _safelyVisitChild(_expression, visitor); |
20205 } | 20205 } |
20206 } | 20206 } |
OLD | NEW |