if (n < 2) { return n; } else { return longFib(n - 2) + longFib(n - 1); }
if (n < 2) { return n; } else { return intFib(n - 2) + intFib(n - 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: long longFib(long) Method name: int intFib(int)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (n < 2) {
1
if (n < 2) {
2
            return n;
2
            return n;
3
        } else {
3
        } else {
4
            return longFib(n - 2) + longFib(n - 1);
4
            return intFib(n - 2) + intFib(n - 1);
5
        }
5
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons9
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements1
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)0.7
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    if (n < 2)
    1
    if (n < 2)
    1
    if (n < 2)
    Differences
    Expression1Expression2Difference
    longintVARIABLE_TYPE_MISMATCH
    Preondition Violations
    Type long of variable n does not match with type int of variable n
    1
    if (n < 2)
                            
    2
    return n;
    Preondition Violations
    Unmatched return n;
    2
    return n;
    2
    return n;
    2
    return n;
    Preondition Violations
    Unmatched return n;
                            
    else
            
                                                                                    
    3
    return intFib(n - 2) + intFib(n - 1);
    Preondition Violations
    Unmatched return intFib(n - 2) + intFib(n - 1);
    3
    return intFib(n - 2) + intFib(n - 1);
    3
    return longFib(n - 2) + longFib(n - 1);
    3
    return longFib(n - 2) + longFib(n - 1);
    Preondition Violations
    Unmatched return longFib(n - 2) + longFib(n - 1);
                                                                                        
    Precondition Violations (5)
    Row Violation
    1Type long of variable n does not match with type int of variable n
    2Unmatched return n;
    3Unmatched return n;
    4Unmatched return intFib(n - 2) + intFib(n - 1);
    5Unmatched return longFib(n - 2) + longFib(n - 1);