long start = System.currentTimeMillis(); Long result = boxedLongFib(Long.valueOf(n)); System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedLongFib(" + n + ") = " + result);
long start = System.currentTimeMillis(); Integer result = integerFib(Integer.valueOf(n)); System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for integerFib(" + n + ") = " + result);
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: void benchBoxedLongFib(long) Method name: void benchIntegerFib(int)
Number of AST nodes: 3 Number of AST nodes: 3
1
long start = System.currentTimeMillis();
1
long start = System.currentTimeMillis();
2
        Long result = boxedLongFib(Long.valueOf(n));
2
        Integer result = integerFib(Integer.valueOf(n));
3
        System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedLongFib(" + n + ") = " + result);
3
        System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for integerFib(" + n + ") = " + result);
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.0
Clones locationClones are in different classes
Number of node comparisons9
  1. {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.0
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    long start = System.currentTimeMillis();
    1
    long start = System.currentTimeMillis();
                                                                                                      
    2
    Integer result = integerFib(Integer.valueOf(n));
    2
    Long result = boxedLongFib(Long.valueOf(n));
                                                                                              
                                                                                                                                                                                                                                    
    3
    System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for integerFib(" + n + ") = " + result);
    3
    System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedLongFib(" + n + ") = " + result);
                                                                                                                                                                                                                                        
    Precondition Violations (0)
    Row Violation