if( len[ k ][ i ] > maxLen ) { maxLen = len[ k ][ i ]; } if( len[ k ][ i ] < minLen ) { minLen = len[ k ][ i ]; }
if( len[ t ][ i ] > maxLen ) { maxLen = len[ t ][ i ]; } if( len[ t ][ i ] < minLen ) { minLen = len[ t ][ i ]; }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/installer/CBZip2InputStream.java File path: /jEdit-4.2/src/installer/CBZip2OutputStream.java
Method name: void recvDecodingTables() Method name: void sendMTFValues()
Number of AST nodes: 4 Number of AST nodes: 4
1
if( len[ k ][ i ] > maxLen )
1
if( len[ t ][ i ] > maxLen )
2
                {
2
                {
3
                    maxLen = len[ k ][ i ];
3
                    maxLen = len[ t ][ i ];
4
                }
4
                }
5
                if( len[ k ][ i ] < minLen )
5
                if( len[ t ][ i ] < minLen )
6
                {
6
                {
7
                    minLen = len[ k ][ i ];
7
                    minLen = len[ t ][ i ];
8
                }
8
                }
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.6
Clones locationClones are in different classes
Number of node comparisons17
  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.7
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    35
    if (len[k][i] > maxLen)
    35
    if (len[k][i] > maxLen)
    144
    if (len[t][i] > maxLen)
    Differences
    Expression1Expression2Difference
    ktVARIABLE_NAME_MISMATCH
    144
    if (len[t][i] > maxLen)
    36
    maxLen = len[k][i];
    36
    maxLen = len[k][i];
    145
    maxLen = len[t][i];
    Differences
    Expression1Expression2Difference
    ktVARIABLE_NAME_MISMATCH
    145
    maxLen = len[t][i];
    37
    if (len[k][i] < minLen)
    37
    if (len[k][i] < minLen)
    146
    if (len[t][i] < minLen)
    Differences
    Expression1Expression2Difference
    ktVARIABLE_NAME_MISMATCH
    146
    if (len[t][i] < minLen)
    38
    minLen = len[k][i];
    38
    minLen = len[k][i];
    147
    minLen = len[t][i];
    Differences
    Expression1Expression2Difference
    ktVARIABLE_NAME_MISMATCH
    147
    minLen = len[t][i];
    Precondition Violations (1)
    Row Violation
    1Clone fragment #1 returns variables maxLen, minLen , while Clone fragment #2 returns variables maxLen, minLen