private CRC m_crc = new CRC(); private boolean[] m_inUse = new boolean[ 256 ]; private char[] m_seqToUnseq = new char[ 256 ]; private char[] m_unseqToSeq = new char[ 256 ]; private char[] m_selector = new char[ MAX_SELECTORS ]; private char[] m_selectorMtf = new char[ MAX_SELECTORS ]; /* * freq table collected to save a pass over the data * during decompression. */ private int[] m_unzftab = new int[ 256 ];
private CRC m_crc = new CRC(); private boolean[] m_inUse = new boolean[ 256 ]; private char[] m_seqToUnseq = new char[ 256 ]; private char[] m_unseqToSeq = new char[ 256 ]; private char[] m_selector = new char[ MAX_SELECTORS ]; private char[] m_selectorMtf = new char[ MAX_SELECTORS ]; private int[] m_mtfFreq = new int[ MAX_ALPHA_SIZE ];
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 CRC m_crc = new CRC();
1
private CRC m_crc = new CRC();
2
    private boolean[] m_inUse = new boolean[ 256 ];
2
    private boolean[] m_inUse = new boolean[ 256 ];
3
    private char[] m_seqToUnseq = new char[ 256 ];
3
    private char[] m_seqToUnseq = new char[ 256 ];
4
    private char[] m_unseqToSeq = new char[ 256 ];
4
    private char[] m_unseqToSeq = new char[ 256 ];
5
    private char[] m_selector = new char[ MAX_SELECTORS ];
5
    private char[] m_selector = new char[ MAX_SELECTORS ];
6
    private char[] m_selectorMtf = new char[ MAX_SELECTORS ];
6
    private char[] m_selectorMtf = new char[ MAX_SELECTORS ];
7
    /*
8
     * freq table collected to save a pass over the data
9
     * during decompression.
10
     */
11
    private int[] m_unzftab = new int[ 256 ];
7
    private int[] m_mtfFreq = new int[ MAX_ALPHA_SIZE ];
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