if(chunks.accessable && x < _x + chunks.width) return chunks.xToOffset(x - _x,round); _x += chunks.width; chunks = (Chunk)chunks.next;
if(chunks.accessable && offset < chunks.offset + chunks.length) return x + chunks.offsetToX(offset - chunks.offset); x += chunks.width; chunks = (Chunk)chunks.next;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/syntax/Chunk.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/syntax/Chunk.java
Method name: int xToOffset(Chunk, float, boolean) Method name: float offsetToX(Chunk, int)
Number of AST nodes: 4 Number of AST nodes: 4
1
if(chunks.accessable && x < _x + chunks.width)
1
if(chunks.accessable && offset < chunks.offset + chunks.length)
2
				return chunks.xToOffset(x - _x,round);
2
				return x + chunks.offsetToX(offset - chunks.offset);
3
			_x += chunks.width;
3
			x += chunks.width;
4
			chunks = (Chunk)chunks.next;
4
			chunks = (Chunk)chunks.next;
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.4
Clones locationClones are declared in the same class
Number of node comparisons1