private static final int BUFFER_INCREMENT = 1024; private static final int UNKNOWN = Integer.MAX_VALUE; // value for end private BufferedInputStream br; // so that we don't try to reset() right away private int index = -1; private int bufsize = BUFFER_INCREMENT; private int end = UNKNOWN; private char cached = OUT_OF_BOUNDS; // Big enough for a \r\n pair // lookBehind[0] = most recent // lookBehind[1] = second most recent private char[] lookBehind = new char[] { OUT_OF_BOUNDS, OUT_OF_BOUNDS };
private static final int BUFFER_INCREMENT = 1024; private static final int UNKNOWN = Integer.MAX_VALUE; // value for end private final BufferedReader br; // so that we don't try to reset() right away private int index = -1; private int bufsize = BUFFER_INCREMENT; private int end = UNKNOWN; private char cached = OUT_OF_BOUNDS; // Big enough for a \r\n pair // lookBehind[0] = most recent // lookBehind[1] = second most recent private char[] lookBehind = new char[] { OUT_OF_BOUNDS, OUT_OF_BOUNDS };
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedInputStream.java File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
private static final int BUFFER_INCREMENT = 1024;
1
private static final int BUFFER_INCREMENT = 1024;
2
    private static final int UNKNOWN = Integer.MAX_VALUE; // value for end
2
    private static final int UNKNOWN = Integer.MAX_VALUE; // value for end
3
    
3
    
4
    private BufferedInputStream br;
4
    private final BufferedReader br;
5
    // so that we don't try to reset() right away
5
    // so that we don't try to reset() right away
6
    private int index = -1;
6
    private int index = -1;
7
    private int bufsize = BUFFER_INCREMENT;
7
    private int bufsize = BUFFER_INCREMENT;
8
    private int end = UNKNOWN;
8
    private int end = UNKNOWN;
9
    private char cached = OUT_OF_BOUNDS;
9
    private char cached = OUT_OF_BOUNDS;
10
    // Big enough for a \r\n pair
10
    // Big enough for a \r\n pair
11
    // lookBehind[0] = most recent
11
    // lookBehind[0] = most recent
12
    // lookBehind[1] = second most recent
12
    // lookBehind[1] = second most recent
13
    private char[] lookBehind = new char[] { OUT_OF_BOUNDS, OUT_OF_BOUNDS }; 
13
    private char[] lookBehind = new char[] { OUT_OF_BOUNDS, OUT_OF_BOUNDS }; 
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