Chromium Code Reviews| 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 interface TreeElements { | 5 interface TreeElements { |
| 6 Element operator[](Node node); | 6 Element operator[](Node node); |
| 7 Selector getSelector(Send send); | 7 Selector getSelector(Send send); |
| 8 } | 8 } |
| 9 | 9 |
| 10 class TreeElementMapping implements TreeElements { | 10 class TreeElementMapping implements TreeElements { |
| (...skipping 604 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 615 NamedArgument named = argument; | 615 NamedArgument named = argument; |
| 616 namedArguments.add(named.name.source); | 616 namedArguments.add(named.name.source); |
| 617 } | 617 } |
| 618 } | 618 } |
| 619 mapping.setSelector(node, new Invocation(count, namedArguments)); | 619 mapping.setSelector(node, new Invocation(count, namedArguments)); |
| 620 } | 620 } |
| 621 | 621 |
| 622 visitSend(Send node) { | 622 visitSend(Send node) { |
| 623 Element target = resolveSend(node); | 623 Element target = resolveSend(node); |
| 624 if (node.isOperator) { | 624 if (node.isOperator) { |
| 625 if (node.selector.asIdentifier().source.stringValue === 'is') { | 625 Operator op = node.selector.asOperator(); |
| 626 if (op.source.stringValue === 'is') { | |
| 626 resolveTypeTest(node.arguments.head); | 627 resolveTypeTest(node.arguments.head); |
| 627 assert(node.arguments.tail.isEmpty()); | 628 assert(node.arguments.tail.isEmpty()); |
| 628 mapping.setSelector(node, Selector.BINARY_OPERATOR); | 629 mapping.setSelector(node, Selector.BINARY_OPERATOR); |
| 629 } else if (node.arguments.isEmpty()) { | 630 } else if (node.arguments.isEmpty()) { |
| 631 if (node.isPrefix && op.source.stringValue === '+' | |
| 632 && node.receiver.asLiteralInt() == null | |
|
ahe
2012/02/02 17:43:27
===
ngeoffray
2012/02/03 08:43:46
Done.
| |
| 633 && node.receiver.asLiteralDouble() == null) { | |
|
ahe
2012/02/02 17:43:27
===
ngeoffray
2012/02/03 08:43:46
Done.
| |
| 634 error(node, MessageKind.NO_UNARY_ADD); | |
|
ahe
2012/02/02 17:43:27
"expected a literal number"
ngeoffray
2012/02/03 08:43:46
Done.
| |
| 635 } | |
| 630 mapping.setSelector(node, Selector.UNARY_OPERATOR); | 636 mapping.setSelector(node, Selector.UNARY_OPERATOR); |
| 631 } else { | 637 } else { |
| 632 visit(node.argumentsNode); | 638 visit(node.argumentsNode); |
| 633 mapping.setSelector(node, Selector.BINARY_OPERATOR); | 639 mapping.setSelector(node, Selector.BINARY_OPERATOR); |
| 634 } | 640 } |
| 635 } else if (node.isIndex) { | 641 } else if (node.isIndex) { |
| 636 visit(node.argumentsNode); | 642 visit(node.argumentsNode); |
| 637 assert(node.arguments.tail.isEmpty()); | 643 assert(node.arguments.tail.isEmpty()); |
| 638 mapping.setSelector(node, Selector.INDEX); | 644 mapping.setSelector(node, Selector.INDEX); |
| 639 } else if (node.isPropertyAccess) { | 645 } else if (node.isPropertyAccess) { |
| (...skipping 521 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 1161 class TopScope extends Scope { | 1167 class TopScope extends Scope { |
| 1162 Universe universe; | 1168 Universe universe; |
| 1163 | 1169 |
| 1164 TopScope(Universe this.universe) : super(null, null); | 1170 TopScope(Universe this.universe) : super(null, null); |
| 1165 Element lookup(SourceString name) => universe.find(name); | 1171 Element lookup(SourceString name) => universe.find(name); |
| 1166 | 1172 |
| 1167 Element add(Element element) { | 1173 Element add(Element element) { |
| 1168 throw "Cannot add an element in the top scope"; | 1174 throw "Cannot add an element in the top scope"; |
| 1169 } | 1175 } |
| 1170 } | 1176 } |
| OLD | NEW |