if (n.longValue() < TWO.longValue()) { return n; } else { return boxedLongFib(Long.valueOf(n.longValue() - TWO.longValue())) + boxedLongFib(Long.valueOf(n.longValue() - ONE.longValue())); }
if (n.intValue() < TWO.intValue()) { return n; } else { return integerFib(Integer.valueOf(n.intValue() - TWO.intValue())) + integerFib(Integer.valueOf(n.intValue() - ONE.intValue())); }
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 boxedLongFib(Long) Method name: Integer integerFib(Integer)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (n.longValue() < TWO.longValue()) {
1
if (n.intValue() < TWO.intValue()) {
2
            return n;
2
            return n;
3
        } else {
3
        } else {
4
            return boxedLongFib(Long.valueOf(n.longValue() - TWO.longValue())) +
4
            return integerFib(Integer.valueOf(n.intValue() - TWO.intValue())) +
5
                    boxedLongFib(Long.valueOf(n.longValue() - ONE.longValue()));
5
                    integerFib(Integer.valueOf(n.intValue() - ONE.intValue()));
6
        }
6
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
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 comparisons1