if (SKIP_KEY.equals(params[i].getName())) {
skip = new Long(params[i].getValue()).longValue();
continue;
}
if (SKIP_KEY.equals(params[i].getName())) {
skip = new Long(params[i].getValue()).longValue();
continue;
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/HeadFilter.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TailFilter.java
|
Method name: void initialize()
|
|
Method name: void initialize()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if (SKIP_KEY.equals(params[i].getName())) {↵ | | 1 | if (SKIP_KEY.equals(params[i].getName())) {↵
|
2 | skip = new Long(params[i].getValue()).longValue();↵ | | 2 | skip = new Long(params[i].getValue()).longValue();↵
|
3 | continue;↵ | | 3 | continue;↵
|
4 | } | | 4 | }
|
See real code fragment |
|
See real code fragment |
Summary
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.3 |
Clones location | Clones are in different classes having the same super class |
Number of node comparisons | 10 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 3 |
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) | 1.2 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
7 | if (SKIP_KEY.equals(params[i].getName())) | | 7 | if (SKIP_KEY.equals(params[i].getName())) |
8 | skip = new Long(params[i].getValue()).longValue(); | | 8 | skip = new Long(params[i].getValue()).longValue(); |
9 | | | 9 | |
Precondition Violations (2)
Row |
Violation |
1 | Statement continue; without innermost loop |
2 | Statement continue; without innermost loop |