private void makeMaps() { m_nInUse = 0; for( int i = 0; i < 256; i++ ) { if( m_inUse[ i ] ) { m_seqToUnseq[ m_nInUse ] = (char)i; m_unseqToSeq[ i ] = (char)m_nInUse; m_nInUse++;
private void makeMaps() { int i; m_nInUse = 0; for( i = 0; i < 256; i++ ) { if( m_inUse[ i ] ) { m_seqToUnseq[ m_nInUse ] = (char)i; m_unseqToSeq[ i ] = (char)m_nInUse; m_nInUse++;
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
private void makeMaps()
1
private void makeMaps()
2
    {
2
    {
3
        int i;
3
        m_nInUse = 0;
4
        m_nInUse = 0;
4
        for( int i = 0; i < 256; i++ )
5
        for( i = 0; i < 256; i++ )
5
        {
6
        {
6
            if( m_inUse[ i ] )
7
            if( m_inUse[ i ] )
7
            {
8
            {
8
                m_seqToUnseq[ m_nInUse ] = (char)i;
9
                m_seqToUnseq[ m_nInUse ] = (char)i;
9
                m_unseqToSeq[ i ] = (char)m_nInUse;
10
                m_unseqToSeq[ i ] = (char)m_nInUse;
10
                m_nInUse++;
11
                m_nInUse++;
11
            
12
            
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