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 library statement_rewriter; | 5 library statement_rewriter; |
6 | 6 |
7 import 'tree_ir_nodes.dart'; | 7 import 'tree_ir_nodes.dart'; |
8 | 8 |
9 /** | 9 /** |
10 * Performs the following transformations on the tree: | 10 * Performs the following transformations on the tree: |
(...skipping 533 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
544 } | 544 } |
545 | 545 |
546 Expression makeCondition(Expression e, bool polarity) { | 546 Expression makeCondition(Expression e, bool polarity) { |
547 return polarity ? e : new Not(e); | 547 return polarity ? e : new Not(e); |
548 } | 548 } |
549 | 549 |
550 Statement getBranch(If node, bool polarity) { | 550 Statement getBranch(If node, bool polarity) { |
551 return polarity ? node.thenStatement : node.elseStatement; | 551 return polarity ? node.thenStatement : node.elseStatement; |
552 } | 552 } |
553 } | 553 } |
OLD | NEW |