if (args.length >= 1) {
times = Integer.parseInt(args[0]);
if (args.length >= 2) {
n = Integer.parseInt(args[1]);
}
}
if (args.length >= 1) {
times = Integer.parseInt(args[0]);
if (args.length >= 2) {
n = Integer.parseInt(args[1]);
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/test/org/jruby/test/bench/BenchFixnumFibRecursive.java
|
|
File path: /jruby-1.4.0/test/org/jruby/test/bench/BenchIntFibRecursive.java
|
Method name: void main(String[])
|
|
Method name: void main(String[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (args.length >= 1) {↵ | | 1 | if (args.length >= 1) {↵
|
2 | times = Integer.parseInt(args[0]);↵ | | 2 | times = Integer.parseInt(args[0]);↵
|
3 | if (args.length >= 2) {↵ | | 3 | if (args.length >= 2) {↵
|
4 | n = Integer.parseInt(args[1]);↵ | | 4 | n = Integer.parseInt(args[1]);↵
|
5 | }↵ | | 5 | }↵
|
6 | } | | 6 | }
|
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.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 11 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 4 |
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) | 0.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
3 | if (args.length >= 1) | | 3 | if (args.length >= 1) |
4 | times = Integer.parseInt(args[0]); | | 4 | times = Integer.parseInt(args[0]); |
5 | | | 5 | |
6 | n = Integer.parseInt(args[1]); | | 6 | n = Integer.parseInt(args[1]); |
Precondition Violations (1)
Row |
Violation |
1 | Clone fragment #1 returns variables times, n , while Clone fragment #2 returns variables times, n |