File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | |||
Method name: void hbMakeCodeLengths(char[], int[], int, int)
|
Method name: void hbMakeCodeLengths(char[], int[], int, int)
|
|||
Number of AST nodes: 5 | Number of AST nodes: 5 | |||
1 | tmp = heap[ zz ];↵ | 1 | tmp = heap[ zz ];↵ | |
2 | while( weights[ tmp ] < weights[ heap[ zz >> 1 ] ] )↵ | 2 | while( weights[ tmp ] < weights[ heap[ zz >> 1 ] ] )↵ | |
3 | {↵ | 3 | {↵ | |
4 | heap[ zz ] = heap[ zz >> 1 ];↵ | 4 | heap[ zz ] = heap[ zz >> 1 ];↵ | |
5 | zz >>= 1;↵ | 5 | zz >>= 1;↵ | |
6 | }↵ | 6 | }↵ | |
7 | heap[ zz ] = tmp; | 7 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 21 |
Number of mapped statements | 5 |
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) | 2.3 |
Clone type | Type 1 |
ID | Statement | ID | Statement | |
---|---|---|---|---|
27 | tmp = heap[zz]; | 86 | tmp = heap[zz]; | |
28 | while (weights[tmp] < weights[heap[zz >> 1]]) | 87 | while (weights[tmp] < weights[heap[zz >> 1]]) | |
29 | heap[zz] = heap[zz >> 1]; | 88 | heap[zz] = heap[zz >> 1]; | |
30 | zz >>= 1; | 89 | zz >>= 1; | |
31 | heap[zz] = tmp; | 90 | heap[zz] = tmp; |
Row | Violation |
---|