if (lastToken.chain(next)) { lastToken = next; }
while ((mymatch = mymatch.next) != null) { if (mymatch.index > longest.index) { longest = mymatch; } }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/RE.java File path: /jEdit-4.2/src/gnu/regexp/RE.java
Method name: void addToken(REToken) Method name: REMatch getMatchImpl(CharIndexed, int, int, StringBuffer)
Number of AST nodes: 2 Number of AST nodes: 3
1
if (lastToken.chain(next)) {
2
	  lastToken = next;
1
while ((mymatch = mymatch.next) != null) {
2
		      if (mymatch.index > longest.index) {
3
			  longest = mymatch;
3
      }
4
		      }
5
		  }
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.1
Clones locationClones are declared in the same class
Number of node comparisons1