| OLD | NEW |
| 1 // Copyright (c) 2015, the Fletch project authors. Please see the AUTHORS file | 1 // Copyright (c) 2015, the Dartino 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 servicec.cycle_detection; | 5 library servicec.cycle_detection; |
| 6 | 6 |
| 7 import 'dart:collection' show | 7 import 'dart:collection' show |
| 8 LinkedHashSet; | 8 LinkedHashSet; |
| 9 | 9 |
| 10 import 'node.dart' show | 10 import 'node.dart' show |
| 11 MemberNode, | 11 MemberNode, |
| (...skipping 121 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 133 for (int i = stack.length - 1; i >= 0; --i) { | 133 for (int i = stack.length - 1; i >= 0; --i) { |
| 134 if (stack[i].state == GraphNodeState.VISITING) { | 134 if (stack[i].state == GraphNodeState.VISITING) { |
| 135 reversedChain.add(stack[i].struct); | 135 reversedChain.add(stack[i].struct); |
| 136 } | 136 } |
| 137 if (stack[i].struct == struct) break; | 137 if (stack[i].struct == struct) break; |
| 138 } | 138 } |
| 139 | 139 |
| 140 return new CyclicStructError(reversedChain.toList().reversed); | 140 return new CyclicStructError(reversedChain.toList().reversed); |
| 141 } | 141 } |
| 142 } | 142 } |
| OLD | NEW |