@@ -24,7 +24,7 @@ class DepsCommand extends PubCommand {
24
24
bool get takesArguments => false ;
25
25
26
26
final AnalysisContextManager analysisContextManager =
27
- new AnalysisContextManager ();
27
+ AnalysisContextManager ();
28
28
29
29
/// The [StringBuffer] used to accumulate the output.
30
30
StringBuffer _buffer;
@@ -52,7 +52,7 @@ class DepsCommand extends PubCommand {
52
52
// Explicitly run this in case we don't access `entrypoint.packageGraph`.
53
53
entrypoint.assertUpToDate ();
54
54
55
- _buffer = new StringBuffer ();
55
+ _buffer = StringBuffer ();
56
56
57
57
if (argResults['executables' ]) {
58
58
_outputExecutables ();
@@ -166,8 +166,8 @@ class DepsCommand extends PubCommand {
166
166
// The work list for the breadth-first traversal. It contains the package
167
167
// being added to the tree, and the parent map that will receive that
168
168
// package.
169
- var toWalk = new Queue <Pair <Package , Map <String , Map >>>();
170
- var visited = new Set <String >.from ([entrypoint.root.name]);
169
+ var toWalk = Queue <Pair <Package , Map <String , Map >>>();
170
+ var visited = Set <String >.from ([entrypoint.root.name]);
171
171
172
172
// Start with the root dependencies.
173
173
var packageTree = < String , Map > {};
@@ -177,7 +177,7 @@ class DepsCommand extends PubCommand {
177
177
immediateDependencies.removeAll (entrypoint.root.devDependencies.keys);
178
178
}
179
179
for (var name in immediateDependencies) {
180
- toWalk.add (new Pair (_getPackage (name), packageTree));
180
+ toWalk.add (Pair (_getPackage (name), packageTree));
181
181
}
182
182
183
183
// Do a breadth-first walk to the dependency graph.
@@ -198,7 +198,7 @@ class DepsCommand extends PubCommand {
198
198
map[_labelPackage (package)] = childMap;
199
199
200
200
for (var dep in package.dependencies.values) {
201
- toWalk.add (new Pair (_getPackage (dep.name), childMap));
201
+ toWalk.add (Pair (_getPackage (dep.name), childMap));
202
202
}
203
203
}
204
204
0 commit comments