File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java | |||
Method name: void simpleSort(int, int, int)
|
Method name: void mainSort()
|
|||
Number of AST nodes: 4 | Number of AST nodes: 4 | |||
1 | m_zptr[ j ] = m_zptr[ j - h ];↵ | 1 | runningOrder[ j ] = runningOrder[ j - h ];↵ | |
2 | j = j - h;↵ | 2 | j = j - h;↵ | |
3 | if( j <= ( lo + h - 1 ) )↵ | 3 | if( j <= ( h - 1 ) )↵ | |
4 | {↵ | 4 | ↵ | |
5 | {↵ | |||
5 | break;↵ | 6 | break;↵ | |
6 | } | 7 | } | |
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) | 1.3 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 16 |
Number of mapped statements | 4 |
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) | 8.4 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
23 | m_zptr[j] = m_zptr[j - h]; |
| 54 | runningOrder[j] = runningOrder[j - h]; | |||||||||||||
24 | j = j - h; | 55 | j = j - h; | ||||||||||||||
25 | if (j <= (lo + h - 1)) |
| 56 | if (j <= (h - 1)) | |||||||||||||
26 | break; |
| 57 | break; |
Row | Violation |
---|---|
1 | Statement break; without innermost loop |
2 | Statement break; without innermost loop |