m_zptr[ j ] = m_zptr[ j - h ];
j = j - h;
if( j <= ( lo + h - 1 ) )
{
break;
}
m_zptr[ j ] = m_zptr[ j - h ];
j = j - h;
if( j <= ( lo + h - 1 ) )
{
break;
}
Clone fragments detected by clone detection tool
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 simpleSort(int, int, int)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | m_zptr[ j ] = m_zptr[ j - h ];↵ | | 1 | m_zptr[ j ] = m_zptr[ j - h ];↵
|
2 | j = j - h;↵ | | 2 | j = j - h;↵
|
3 | if( j <= ( lo + h - 1 ) )↵ | | 3 | if( j <= ( lo + h - 1 ) )↵
|
4 | {↵ | | 4 | {↵
|
5 | break;↵ | | 5 | break;↵
|
6 | } | | 6 | }
|
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.4 |
Clones location | Clones are in the same method |
Number of node comparisons | 10 |
-
{Non-refactorable}
Mapping Summary
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) | 2.7 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
45 | m_zptr[j] = m_zptr[j - h]; | | 23 | m_zptr[j] = m_zptr[j - h]; |
46 | j = j - h; | | 24 | j = j - h; |
47 | if (j <= (lo + h - 1)) | | 25 | if (j <= (lo + h - 1)) |
48 | | | 26 | |
Precondition Violations (2)
Row |
Violation |
1 | Statement break; without innermost loop |
2 | Statement break; without innermost loop |