long start = System.currentTimeMillis();
BoxedLong result = fullyBoxedFib(new BoxedLong(n));
System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for fullyBoxedFib(" + n + ") = " + result);
long start = System.currentTimeMillis();
BoxedInt result = boxedFib(new BoxedInt(n));
System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedFib(" + 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 benchFullyBoxedFib(long)
|
|
Method name: void benchBoxedFib(int)
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | long start = System.currentTimeMillis();↵ | | 1 | long start = System.currentTimeMillis();↵
|
2 | BoxedLong result = fullyBoxedFib(new BoxedLong(n));↵ | | 2 | BoxedInt result = boxedFib(new BoxedInt(n));↵
|
3 | System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for fullyBoxedFib(" + n + ") = " + result); | | 3 | System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedFib(" + n + ") = " + result);
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 5 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
1 | long start = System.currentTimeMillis(); | | 1 | long start = System.currentTimeMillis(); |
2 | BoxedLong result = fullyBoxedFib(new BoxedLong(n)); | | 2 | BoxedInt result = boxedFib(new BoxedInt(n)); |
| | | 3 | System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for boxedFib(" + n + ") = " + result); |
3 | System.out.println("Took " + (System.currentTimeMillis() - start) + "ms for fullyBoxedFib(" + n + ") = " + result); | | | |
Precondition Violations (2)
Row |
Violation |
1 | Type long of variable n does not match with type int of variable n |
2 | Clone fragment #1 returns variables start, result , while Clone fragment #2 returns variables start, result |