try { while (bufsize <= index) bufsize += BUFFER_INCREMENT; br.reset(); br.mark(bufsize); br.skip(index-1); } catch (IOException e) { }
try { wait(); } catch (InterruptedException e) { --waitingReaders; // Roll back state. Log.log(Log.ERROR,this,e); return; }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java File path: /jEdit-4.2/src/org/gjt/sp/util/ReadWriteLock.java
Method name: char charAt(int) Method name: void readLock()
Number of AST nodes: 6 Number of AST nodes: 2
1
try {
1
try
2
		while (bufsize <= index) bufsize += BUFFER_INCREMENT
2
			{
3
;
3
				wait();
4
		br.reset();
4
			
5
		br.mark(bufsize);
6
		br.skip(index-1);
7
	    } catch (IOException e) { 
5
}
6
			catch (InterruptedException e)
7
			{
8
				--waitingReaders; // Roll back state.
9
				Log.log(Log.ERROR,this,e);
10
				return;
8
}
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 locationClones are in different classes
Number of node comparisons1