try { while (bufsize <= index) bufsize += BUFFER_INCREMENT; br.reset(); br.mark(bufsize); br.skip(index-1); } catch (IOException e) { }
Buffer[] buffers = new Buffer[bufferCount]; Buffer buffer = buffersFirst; for(int i = 0; i < bufferCount; i++) { buffers[i] = buffer; buffer = buffer.next; } return buffers;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedInputStream.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/jEdit.java
Method name: char charAt(int) Method name: Buffer[] getBuffers()
Number of AST nodes: 6 Number of AST nodes: 6
1
try {
2
		while (bufsize <= index) bufsize += BUFFER_INCREMENT;
3
		br.reset()
1
Buffer[] buffers = new Buffer[bufferCount];
4
;
2
			Buffer buffer = buffersFirst;
5
		br.mark(bufsize)
3
			for(int i = 0; i < bufferCount; i++)
4
			{
6
;
5
				buffers[i] = buffer;
7
		br.skip(index-1);
6
			
8
	    } catch (IOException e) { }
7
	buffer = buffer.next;
8
			}
9
			return buffers;
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 locationClones are in different classes
Number of node comparisons1