File path: /jruby-1.4.0/src/org/jruby/util/Qsort.java | File path: /jruby-1.4.0/src/org/jruby/util/Qsort.java | |||
Method name: void quicksort_loop(Object[], int, int, Comparator)
|
Method name: void quicksort_loop(Object[], int, int, Comparator)
|
|||
Number of AST nodes: 4 | Number of AST nodes: 3 | |||
1 | if (c.compare(m1, mid) >= 0 && c.compare(mid, m3) >= 0) {↵ | 1 | if (↵ | |
2 | if (revtest(a, lo, hi, c)) {↵ | 2 | seqtest(a, lo, hi, c)) {↵ | |
3 | entry = null;↵ | 3 | entry = null;↵ | |
4 | continue;↵ | 4 | continue;↵ | |
5 | }↵ | 5 |
| |
6 | } | |||
See real code fragment | See real code fragment |
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.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 11 |
Number of mapped statements | 3 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 0.7 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
28 | if (revtest(a, lo, hi, c)) |
| 24 | if (seqtest(a, lo, hi, c)) | ||||||||||
29 | entry = null; | 25 | entry = null; | |||||||||||
30 | continue; |
| 26 | continue; |
Row | Violation |
---|---|
1 | Statement continue; without innermost loop |
2 | Statement continue; without innermost loop |