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 13474 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
13485 if (_replaceInList(node.mixinTypes)) { | 13485 if (_replaceInList(node.mixinTypes)) { |
13486 return true; | 13486 return true; |
13487 } | 13487 } |
13488 return visitNode(node); | 13488 return visitNode(node); |
13489 } | 13489 } |
13490 | 13490 |
13491 @override | 13491 @override |
13492 bool visitYieldStatement(YieldStatement node) { | 13492 bool visitYieldStatement(YieldStatement node) { |
13493 if (identical(node.expression, _oldNode)) { | 13493 if (identical(node.expression, _oldNode)) { |
13494 node.expression = _newNode as Expression; | 13494 node.expression = _newNode as Expression; |
13495 return true; | |
Jennifer Messerly
2015/06/25 17:38:19
the other visit methods "return" after successful
| |
13495 } | 13496 } |
13496 return visitNode(node); | 13497 return visitNode(node); |
13497 } | 13498 } |
13498 | 13499 |
13499 bool _replaceInList(NodeList list) { | 13500 bool _replaceInList(NodeList list) { |
13500 int count = list.length; | 13501 int count = list.length; |
13501 for (int i = 0; i < count; i++) { | 13502 for (int i = 0; i < count; i++) { |
13502 if (identical(_oldNode, list[i])) { | 13503 if (identical(_oldNode, list[i])) { |
13503 list[i] = _newNode; | 13504 list[i] = _newNode; |
13504 return true; | 13505 return true; |
(...skipping 6551 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
20056 } | 20057 } |
20057 | 20058 |
20058 @override | 20059 @override |
20059 accept(AstVisitor visitor) => visitor.visitYieldStatement(this); | 20060 accept(AstVisitor visitor) => visitor.visitYieldStatement(this); |
20060 | 20061 |
20061 @override | 20062 @override |
20062 void visitChildren(AstVisitor visitor) { | 20063 void visitChildren(AstVisitor visitor) { |
20063 _safelyVisitChild(_expression, visitor); | 20064 _safelyVisitChild(_expression, visitor); |
20064 } | 20065 } |
20065 } | 20066 } |
OLD | NEW |