int zzi; char thech = 0; try { thech = (char)m_input.read(); } catch( IOException e ) { compressedStreamEOF(); } if( thech == -1 ) { compressedStreamEOF(); } zzi = thech; m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff ); m_bsLive += 8;
int zzi; char thech = 0; try { thech = (char)m_input.read(); } catch( IOException e ) { compressedStreamEOF(); } if( thech == -1 ) { compressedStreamEOF(); } zzi = thech; m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff ); m_bsLive += 8;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/installer/CBZip2InputStream.java File path: /jEdit-4.2/src/installer/CBZip2InputStream.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
int zzi;
1
int zzi;
2
                char thech = 0;
2
                            char thech = 0;
3
                try
3
                            try
4
                {
4
                  
5
          {
5
                    thech = (char)m_input.read();
6
                                thech = (char)m_input.read();
6
                }
7
                   
8
         }
7
                catch( IOException e )
9
                            catch( IOException e )
8
                {
10
                     
11
       {
9
                    compressedStreamEOF();
12
                                compressedStreamEOF();
10
                }
13
                      
14
      }
11
                if( thech == -1 )
15
                            if( thech == -1 )
12
                {
16
                        
17
    {
13
                    compressedStreamEOF();
18
                                compressedStreamEOF();
14
                }
19
                         
20
   }
15
                zzi = thech;
21
                            zzi = thech;
16
                m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff );
22
                            m_bsBuff = ( m_bsBuff << 8 ) | ( zzi & 0xff );
17
                m_bsLive += 8;
23
                            m_bsLive += 8;
18
            
24
                        
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