while( fullGtU( m_zptr[ j - h ] + d, v + d ) )
{
m_zptr[ j ] = m_zptr[ j - h ];
j = j - h;
if( j <= ( lo + h - 1 ) )
{
break;
}
}
while( fullGtU( m_zptr[ j - h ] + d, v + d ) )
{
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: 5
|
|
Number of AST nodes: 5
|
|
1 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | | 1 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵
|
2 | {↵ | | 2 | {↵
|
3 | m_zptr[ j ] = m_zptr[ j - h ];↵ | | 3 | m_zptr[ j ] = m_zptr[ j - h ];↵
|
4 | j = j - h;↵ | | 4 | j = j - h;↵
|
5 | if( j <= ( lo + h - 1 ) )↵ | | 5 | if( j <= ( lo + h - 1 ) )↵
|
6 | {↵ | | 6 | {↵
|
7 | break;↵ | | 7 | break;↵
|
8 | }↵ | | 8 | }↵
|
9 | } | | 9 | }
|
See real code fragment |
|
See real code fragment |
Summary
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.6 |
Clones location | Clones are in the same method |
Number of node comparisons | 16 |
-
{Refactorable}
Mapping Summary
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) | 1.5 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
22 | while (fullGtU(m_zptr[j - h] + d, v + d)) | | 33 | while (fullGtU(m_zptr[j - h] + d, v + d)) |
23 | m_zptr[j] = m_zptr[j - h]; | | 34 | m_zptr[j] = m_zptr[j - h]; |
24 | | | 35 | |
25 | | | 36 | |
26 | | | 37 | |
Precondition Violations (0)
Row |
Violation |