SearchMatcher.Match match = matcher.nextMatch( new CharIndexedSegment(text,false), startOfLine,endOfLine,counter == 0, false); if(match == null) break loop;
SearchMatcher.Match occur = matcher.nextMatch( new CharIndexedSegment(text,false), startOfLine,endOfLine,counter == 0, false); if(occur == null) break loop;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/HyperSearchRequest.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/SearchAndReplace.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
SearchMatcher.Match match = matcher.nextMatch(
1
SearchMatcher.Match occur = matcher.nextMatch(
2
					new CharIndexedSegment(text,false),
2
				new CharIndexedSegment(text,false),
3
					startOfLine,endOfLine,counter == 0,
3
				startOfLine,endOfLine,counter == 0,
4
					false);
4
				false);
5
				if(match == null)
5
			if(occur == null)
6
					break loop;
6
				break loop;
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