File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java | File path: /apache-ant-1.7.0/src/org/apache/tools/bzip2/CBZip2OutputStream.java | |||
Method name: void mainQSort3(Data, int, int, int)
|
Method name: void vswap(int[], int, int, int)
|
|||
Number of AST nodes: 3 | Number of AST nodes: 4 | |||
1 | final int temp = fmap[unLo];↵ | |||
2 | ↵ | 1 | while (p1 < n) {↵ | |
2 | int t = fmap[p1];↵ | |||
3 | fmap[unLo++] = fmap[ltLo];↵ | 3 | fmap[p1++] = fmap[↵ | |
4 | ↵ | 4 | p2];↵ | |
5 | fmap[ltLo++] = temp; | 5 | fmap[p2++] = t;↵ | |
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.0 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 13 |
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 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
| 3 | int t = fmap[p1]; | ||||||||||||||
26 | final int temp = fmap[unLo]; |
| | ||||||||||||||
27 | fmap[unLo++] = fmap[ltLo]; |
| 4 | fmap[p1++] = fmap[p2]; | |||||||||||||
28 | fmap[ltLo++] = temp; |
| 5 | fmap[p2++] = t; |
Row | Violation |
---|---|
1 | Unmatched statement int t=fmap[p1]; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
2 | Unmatched statement final int temp=fmap[unLo]; cannot be moved before or after the extracted code, because it has dependencies to/from statements that will be extracted |
3 | Clone fragment #1 returns variables fmap, unLo, ltLo , while Clone fragment #2 returns variables p1, fmap, p2 |