for( int i = 0; i < alphaSize; i++ ) { if( len[ k ][ i ] > maxLen ) { maxLen = len[ k ][ i ]; } if( len[ k ][ i ] < minLen ) { minLen = len[ k ][ i ];
for( i = 0; i < alphaSize; 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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for( int i = 0; i < alphaSize; i++ )
1
for( i = 0; i < alphaSize; i++ )
2
            {
2
            {
3
                if( len[ k ][ i ] > maxLen )
3
                if( len[ t ][ i ] > maxLen )
4
                {
4
                {
5
                    maxLen = len[ k ][ i ];
5
                    maxLen = len[ t ][ i ];
6
                }
6
                }
7
                if( len[ k ][ i ] < minLen )
7
                if( len[ t ][ i ] < minLen )
8
                {
8
                {
9
                    minLen = len[ k ][ i ];
9
                    minLen = len[ t ][ i ];
10
                
10
                
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0