} else if (index >= end) { return OUT_OF_BOUNDS; } else if (index == -1) { return lookBehind[0]; } else if (index == -2) { return lookBehind[1]; } else if (index < -2) { return OUT_OF_BOUNDS; } else if (index >= bufsize) { // Allocate more space in the buffer. try { while (bufsize <= index) bufsize += BUFFER_INCREMENT; br.reset(); br.mark(bufsize); br.skip(index-1); } catch (IOException e) { } } else if (this.index != index) { try { br.reset(); br.skip(index-1); } catch (IOException e) { }
} else if (index >= end) { return OUT_OF_BOUNDS; } else if (index >= bufsize) { // Allocate more space in the buffer. try { while (bufsize <= index) bufsize += BUFFER_INCREMENT; br.reset(); br.mark(bufsize); br.skip(index-1); } catch (IOException e) { } } else if (this.index != index) { try { br.reset(); br.skip(index-1); } catch (IOException e) { } } else if (index == -1) { return lookBehind[0]; } else if (index == -2) { return lookBehind[1]; } else if (index < -2) { return 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
} else if (index >= end) {
1
} else if (index >= end) {
2
	    return OUT_OF_BOUNDS;
2
	    return OUT_OF_BOUNDS;
3
	} else if (index == -1) {
3
	
4
	    return lookBehind[0];
5
	} else if (index == -2) {
6
	    return lookBehind[1];
7
	} else if (index < -2) {
8
	    return OUT_OF_BOUNDS;
9
	} else if (index >= bufsize) {
4
} else if (index >= bufsize) {
10
	    // Allocate more space in the buffer.
5
	    // Allocate more space in the buffer.
11
	    try {
6
	    try {
12
		while (bufsize <= index) bufsize += BUFFER_INCREMENT;
7
		while (bufsize <= index) bufsize += BUFFER_INCREMENT;
13
		br.reset();
8
		br.reset();
14
		br.mark(bufsize);
9
		br.mark(bufsize);
15
		br.skip(index-1);
10
		br.skip(index-1);
16
	    } catch (IOException e) { }
11
	    } catch (IOException e) { }
17
	} else if (this.index != index) {
12
	} else if (this.index != index) {
18
	    try {
13
	    try {
19
		br.reset();
14
		br.reset();
20
		br.skip(index-1);
15
		br.skip(index-1);
21
	    } catch (IOException e) { }
16
	    } catch (IOException e) { }
22
	
17
	} else if (index == -1) {
18
	    return lookBehind[0];
19
	} else if (index == -2) {
20
	    return lookBehind[1];
21
	} else if (index < -2) {
22
	    return OUT_OF_BOUNDS;
23
	
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