Index: pkg/compiler/lib/src/resolution/tree_elements.dart |
diff --git a/pkg/compiler/lib/src/resolution/tree_elements.dart b/pkg/compiler/lib/src/resolution/tree_elements.dart |
index 1cd18493a2e861034ef100322718070b6a418cd5..1d1ddce2c262aa9cbdc457011f8b948cb85fb09e 100644 |
--- a/pkg/compiler/lib/src/resolution/tree_elements.dart |
+++ b/pkg/compiler/lib/src/resolution/tree_elements.dart |
@@ -9,16 +9,12 @@ import '../constants/expressions.dart'; |
import '../dart_types.dart'; |
import '../diagnostics/source_span.dart'; |
import '../elements/elements.dart'; |
-import '../types/types.dart' show |
- TypeMask; |
+import '../types/types.dart' show TypeMask; |
import '../tree/tree.dart'; |
import '../util/util.dart'; |
-import '../universe/selector.dart' show |
- Selector; |
+import '../universe/selector.dart' show Selector; |
-import 'secret_tree_element.dart' show |
- getTreeElement, |
- setTreeElement; |
+import 'secret_tree_element.dart' show getTreeElement, setTreeElement; |
import 'send_structure.dart'; |
abstract class TreeElements { |
@@ -27,7 +23,7 @@ abstract class TreeElements { |
void forEachConstantNode(f(Node n, ConstantExpression c)); |
- Element operator[](Node node); |
+ Element operator [](Node node); |
Map<Node, DartType> get typesCache; |
/// Returns the [SendStructure] that describes the semantics of [node]. |
@@ -287,15 +283,15 @@ class TreeElementMapping extends TreeElements { |
return mutations; |
} |
- void registerPotentialMutationIn(Node contextNode, VariableElement element, |
- Node mutationNode) { |
+ void registerPotentialMutationIn( |
+ Node contextNode, VariableElement element, Node mutationNode) { |
if (_potentiallyMutatedIn == null) { |
_potentiallyMutatedIn = |
new Maplet<Node, Map<VariableElement, List<Node>>>(); |
} |
Map<VariableElement, List<Node>> mutationMap = |
- _potentiallyMutatedIn.putIfAbsent(contextNode, |
- () => new Maplet<VariableElement, List<Node>>()); |
+ _potentiallyMutatedIn.putIfAbsent( |
+ contextNode, () => new Maplet<VariableElement, List<Node>>()); |
mutationMap.putIfAbsent(element, () => <Node>[]).add(mutationNode); |
} |
@@ -306,13 +302,14 @@ class TreeElementMapping extends TreeElements { |
return mutations; |
} |
- void registerPotentialMutationInClosure(VariableElement element, |
- Node mutationNode) { |
+ void registerPotentialMutationInClosure( |
+ VariableElement element, Node mutationNode) { |
if (_potentiallyMutatedInClosure == null) { |
_potentiallyMutatedInClosure = new Maplet<VariableElement, List<Node>>(); |
} |
- _potentiallyMutatedInClosure.putIfAbsent( |
- element, () => <Node>[]).add(mutationNode); |
+ _potentiallyMutatedInClosure |
+ .putIfAbsent(element, () => <Node>[]) |
+ .add(mutationNode); |
} |
List<Node> getAccessesByClosureIn(Node node, VariableElement element) { |
@@ -324,14 +321,14 @@ class TreeElementMapping extends TreeElements { |
return accesses; |
} |
- void setAccessedByClosureIn(Node contextNode, VariableElement element, |
- Node accessNode) { |
+ void setAccessedByClosureIn( |
+ Node contextNode, VariableElement element, Node accessNode) { |
if (_accessedByClosureIn == null) { |
_accessedByClosureIn = new Map<Node, Map<VariableElement, List<Node>>>(); |
} |
Map<VariableElement, List<Node>> accessMap = |
- _accessedByClosureIn.putIfAbsent(contextNode, |
- () => new Maplet<VariableElement, List<Node>>()); |
+ _accessedByClosureIn.putIfAbsent( |
+ contextNode, () => new Maplet<VariableElement, List<Node>>()); |
accessMap.putIfAbsent(element, () => <Node>[]).add(accessNode); |
} |