if( i > hi )
{
break;
}
v = m_zptr[ i ];
j = i;
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;
}
}
m_zptr[ j ] = v;
i++;
if( i > hi )
{
break;
}
v = m_zptr[ i ];
j = i;
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;
}
}
m_zptr[ j ] = v;
i++;
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: 11
|
|
Number of AST nodes: 11
|
|
1 | if( i > hi )↵ | | 1 | if( i > hi )↵
|
2 | {↵ | | 2 | {↵
|
3 | break;↵ | | 3 | break;↵
|
4 | }↵ | | 4 | }↵
|
5 | v = m_zptr[ i ];↵ | | 5 | v = m_zptr[ i ];↵
|
6 | j = i;↵ | | 6 | j = i;↵
|
7 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵ | | 7 | while( fullGtU( m_zptr[ j - h ] + d, v + d ) )↵
|
8 | {↵ | | 8 | {↵
|
9 | m_zptr[ j ] = m_zptr[ j - h ];↵ | | 9 | m_zptr[ j ] = m_zptr[ j - h ];↵
|
10 | j = j - h;↵ | | 10 | j = j - h;↵
|
11 | if( j <= ( lo + h - 1 ) )↵ | | 11 | if( j <= ( lo + h - 1 ) )↵
|
12 | {↵ | | 12 | {↵
|
13 | break;↵ | | 13 | break;↵
|
14 | }↵ | | 14 | }↵
|
15 | }↵ | | 15 | }↵
|
16 | m_zptr[ j ] = v;↵ | | 16 | m_zptr[ j ] = v;↵
|
17 | i++; | | 17 | i++;
|
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.6 |
Clones location | Clones are in the same method |
Number of node comparisons | 32 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 11 |
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.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
29 | if (i > hi) | | 40 | if (i > hi) |
30 | | | 41 | |
31 | v = m_zptr[i]; | | 42 | v = m_zptr[i]; |
32 | j = i; | | 43 | j = i; |
33 | while (fullGtU(m_zptr[j - h] + d, v + d)) | | 44 | while (fullGtU(m_zptr[j - h] + d, v + d)) |
34 | m_zptr[j] = m_zptr[j - h]; | | 45 | m_zptr[j] = m_zptr[j - h]; |
35 | | | 46 | |
36 | | | 47 | |
37 | | | 48 | |
38 | m_zptr[j] = v; | | 49 | m_zptr[j] = v; |
39 | i++; | | 50 | i++; |
Precondition Violations (2)
Row |
Violation |
1 | Statement break; without innermost loop |
2 | Statement break; without innermost loop |