File path: /apache-ant-1.7.0/src/org/apache/tools/ant/Project.java | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/Project.java | |||
Method name: Vector topoSort(String[], Hashtable, boolean)
|
Method name: void tsort(String, Hashtable, Hashtable, Stack, Vector)
|
|||
Number of AST nodes: 7 | Number of AST nodes: 7 | |||
1 | for (Enumeration en = targetTable.keys(); en.hasMoreElements();) {↵ | 1 | for (Enumeration en = target.getDependencies(); en.hasMoreElements();) {↵ | |
2 | String curTarget = (String) en.nextElement();↵ | 2 | String cur = (String) en.nextElement();↵ | |
3 | String st = (String) state.get(curTarget);↵ | 3 | String m = (String) state.get(cur);↵ | |
4 | if (st == null) {↵ | 4 | if (m == null) {↵ | |
5 | // Not been visited↵ | |||
5 | tsort(curTarget, targetTable, state, visiting, complete);↵ | 6 | tsort(cur, targetTable, state, visiting, ret);↵ | |
6 | } else if (st == VISITING) {↵ | 7 | } else if (m == VISITING) {↵ | |
7 | throw new RuntimeException("Unexpected node in visiting state: "↵ | 8 | ↵ | |
8 | + curTarget↵ | 9 | // Currently visiting this node, so have a cycle↵ | |
9 | );↵ | 10 | throw makeCircularException(cur, visiting);↵ | |
10 | }↵ | 11 | }↵ | |
11 | } | 12 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.5 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 18 |
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.8 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
17 | String curTarget = (String)en.nextElement(); |
| 18 | String cur = (String)en.nextElement(); | |||||||||||||
18 | String st = (String)state.get(curTarget); |
| 19 | String m = (String)state.get(cur); | |||||||||||||
19 | if (st == null) |
| 20 | if (m == null) | |||||||||||||
20 | tsort(curTarget, targetTable, state, visiting, complete); |
| 21 | tsort(cur, targetTable, state, visiting, ret); | |||||||||||||
21 | else if (st == VISITING) |
| 22 | else if (m == VISITING) | |||||||||||||
22 | throw new RuntimeException("Unexpected node in visiting state: " + curTarget); |
| 23 | throw makeCircularException(cur, visiting); |
Row | Violation |
---|---|
1 | Expression new RuntimeException("Unexpected node in visiting state: " + curTarget) cannot be parameterized, because it has dependencies to/from statements that will be extracted |
2 | Expression makeCircularException(cur,visiting) cannot be parameterized, because it has dependencies to/from statements that will be extracted |