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
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are in different classes
Number of node comparisons9
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements3
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)1.2
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    if (n.lt(BOXED_CACHE[2]))
    1
    if (n.lt(BOXED_CACHE[2]))
    2
    return n;
    2
    return n;
    else
    else
    3
    return fullyBoxedFib(n.minus(BOXED_CACHE[2])).plus(fullyBoxedFib(n.minus(BOXED_CACHE[1])));
    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])));
    Differences
    Expression1Expression2Difference
    fullyBoxedFibboxedFibMETHOD_INVOCATION_NAME_MISMATCH
    fullyBoxedFibboxedFibMETHOD_INVOCATION_NAME_MISMATCH
    3
    return boxedFib(n.minus(BOXED_CACHE[2])).plus(boxedFib(n.minus(BOXED_CACHE[1])));
    Precondition Violations (0)
    Row Violation