| Index: lib/src/graph.dart
|
| diff --git a/lib/src/graph.dart b/lib/src/graph.dart
|
| index 5602d6e58b21a43a94d3d69aaa2d53d6bafee28a..76389957ab5cdd7a297f6ff46b9ed2b5b4649f7c 100644
|
| --- a/lib/src/graph.dart
|
| +++ b/lib/src/graph.dart
|
| @@ -43,7 +43,7 @@ abstract class Graph<N> {
|
| /// Returns all nodes reachable from [root] in post order.
|
| Iterable<N> postOrder(N root) sync* {
|
| var seen = new Set<N>();
|
| - Iterable<N> helper(n) sync* {
|
| + Iterable<N> helper(N n) sync* {
|
| if (!seen.add(n)) return;
|
| for (var x in targetsOf(n)) {
|
| yield* helper(x);
|
| @@ -297,7 +297,7 @@ class _DominatorFinder<N> {
|
| for (var n in nodesInReversedPostOrder) {
|
| if (n == root) continue;
|
| bool first = true;
|
| - var idom = null;
|
| + N idom;
|
| for (var p in _graph.sourcesOf(n)) {
|
| if (immediateDominators[p] != null) {
|
| if (first) {
|
|
|