if (n.lt(BOXED_CACHE[2])) {
return n;
} else {
return fullyBoxedFib(n.minus(BOXED_CACHE[2])).plus(fullyBoxedFib(n.minus(BOXED_CACHE[1])));
}
if (n.lt(BOXED_CACHE[2])) {
return n;
} else {
return boxedFib(n.minus(BOXED_CACHE[2])).plus(boxedFib(n.minus(BOXED_CACHE[1])));
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/test/org/jruby/test/bench/BenchLongFibRecursive.java
|
|
File path: /jruby-1.4.0/test/org/jruby/test/bench/BenchIntFibRecursive.java
|
Method name: BoxedLong fullyBoxedFib(BoxedLong)
|
|
Method name: BoxedInt boxedFib(BoxedInt)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | if (n.lt(BOXED_CACHE[2])) {↵ | | 1 | if (n.lt(BOXED_CACHE[2])) {↵
|
2 | return n;↵ | | 2 | return n;↵
|
3 | } else {↵ | | 3 | } else {↵
|
4 | return fullyBoxedFib(n.minus(BOXED_CACHE[2])).plus(fullyBoxedFib(n.minus(BOXED_CACHE[1])));↵ | | 4 | return boxedFib(n.minus(BOXED_CACHE[2])).plus(boxedFib(n.minus(BOXED_CACHE[1])));↵
|
5 | } | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in different classes |
Number of node comparisons | 9 |
-
{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 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | if (n.lt(BOXED_CACHE[2])) | | 1 | if (n.lt(BOXED_CACHE[2])) |
2 | | | 2 | |
| | | | |
3 | return fullyBoxedFib(n.minus(BOXED_CACHE[2])).plus(fullyBoxedFib(n.minus(BOXED_CACHE[1]))); | | 3 | return boxedFib(n.minus(BOXED_CACHE[2])).plus(boxedFib(n.minus(BOXED_CACHE[1]))); |
Precondition Violations (0)
Row |
Violation |