try { int i = br.read(); this.index = index+1; // this.index is index of next pos relative to charAt(0) if (i == -1) { // set flag that next should fail next time? end = index; return ch; } ch = (char) i; } catch (IOException ie) { }
try { int i = br.read(); this.index = index+1; // this.index is index of next pos relative to charAt(0) if (i == -1) { // set flag that next should fail next time? end = index; return ch; } ch = (char) i; } catch (IOException ie) { }
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
try {
1
try {
2
	    int i = br.read();
2
	    int i = br.read();
3
	    this.index = index+1; // this.index is index of next pos relative to charAt(0)
3
	    this.index = index+1; // this.index is index of next pos relative to charAt(0)
4
	    if (i == -1) {
4
	    if (i == -1) {
5
		// set flag that next should fail next time?
5
		// set flag that next should fail next time?
6
		end = index;
6
		end = index;
7
		return ch;
7
		return ch;
8
	    }
8
	    }
9
	    ch = (char) i;
9
	    ch = (char) i;
10
	} catch (IOException ie) { }
10
	} catch (IOException ie) { }
11
	
11
	
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