try { readLock(); if(start < 0 || length < 0 || start + length > contentMgr.getLength()) throw new ArrayIndexOutOfBoundsException(start + ":" + length); return contentMgr.getText(start,length); } finally { readUnlock(); }
try { readLock(); if(start < 0 || length < 0 || start + length > contentMgr.getLength()) throw new ArrayIndexOutOfBoundsException(start + ":" + length); contentMgr.getText(start,length,seg); } finally { readUnlock(); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/Buffer.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
try
1
try
2
		{
2
		{
3
			readLock();
3
			readLock();
4
			if(start < 0 || length < 0
4
			if(start < 0 || length < 0
5
				|| start + length > contentMgr.getLength())
5
				|| start + length > contentMgr.getLength())
6
				throw new ArrayIndexOutOfBoundsException(start + ":" + length);
6
				throw new ArrayIndexOutOfBoundsException(start + ":" + length);
7
			return contentMgr.getText(start,length);
7
			contentMgr.getText(start,length,seg);
8
		}
8
		}
9
		finally
9
		finally
10
		{
10
		{
11
			readUnlock();
11
			readUnlock();
12
		}
12
		}
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