for(int i = 0; i < markers.size(); i++) { Marker marker = (Marker)markers.elementAt(i); if(getLineOfOffset(marker.getPosition()) == line) return marker; } return null;
for (int i = 0; i < macroHandlers.size(); i++) { Handler handler = (Handler)macroHandlers.get(i); if (handler.accept(pathName)) return handler; } return null;
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/Macros.java
Method name: Marker getMarkerAtLine(int) Method name: Handler getHandlerForPathName(String)
Number of AST nodes: 5 Number of AST nodes: 5
1
for(int i = 0; i < markers.size(); i++)
1
for (int i = 0; i < macroHandlers.size(); i++)
2
		{
2
		{
3
			Marker marker = (Marker)markers.elementAt(i);
3
			Handler handler = (
4
			if(getLineOfOffset(marker.getPosition()) == line
4
Handler)macroHandlers.get(i);
5
)
5
			if (handler.accept(pathName))
6
				return marker;
6
				return handler;
7
		}
7
		}
8
		return null;
8
		return null;
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 in different classes
Number of node comparisons1