m_zptr[ j ] = m_zptr[ j - h ]; j = j - h; if( j <= ( lo + h - 1 ) ) { break; }
runningOrder[ j ] = runningOrder[ j - h ]; j = j - h; if( j <= ( 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 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
                            }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.2
Clones locationClones are declared in the same class
Number of node comparisons16
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements4
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)1.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    45
    m_zptr[j] = m_zptr[j - h];
    45
    m_zptr[j] = m_zptr[j - h];
    54
    runningOrder[j] = runningOrder[j - h];
    Differences
    Expression1Expression2Difference
    m_zptrrunningOrderVARIABLE_NAME_MISMATCH
    m_zptrrunningOrderVARIABLE_NAME_MISMATCH
    54
    runningOrder[j] = runningOrder[j - h];
    46
    j = j - h;
    55
    j = j - h;
    47
    if (j <= (lo + h - 1))
    47
    if (j <= (lo + h - 1))
    56
    if (j <= (h - 1))
    Differences
    Expression1Expression2Difference
    lo + hhINFIX_LEFT_OPERAND_MISMATCH
    56
    if (j <= (h - 1))
    48
    break;
    48
    break;
    57
    break;
    Preondition Violations
    Statement break; without innermost loop
    Statement break; without innermost loop
    57
    break;
    Precondition Violations (3)
    Row Violation
    1Statement break; without innermost loop
    2Statement break; without innermost loop
    3Clone fragment #1 returns variables j , while Clone fragment #2 returns variables runningOrder, j