for(int i = 0; i < deps.size(); i++) { Dependency dep = (Dependency)deps.elementAt(i); dep.satisfy(roster,installDirectory,downloadSource); }
for(int i = 0; i < selection.size(); i++) { Selection s = (Selection)selection.elementAt(i); if(offset >= s.start && offset <= s.end) return s; }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/pluginmgr/PluginList.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/JEditTextArea.java
Method name: void satisfyDependencies(Roster, String, boolean) Method name: Selection getSelectionAtOffset(int)
Number of AST nodes: 3 Number of AST nodes: 4
1
for(int i = 0; i < deps.size(); i++)
1
for(int i = 0; i < selection.size(); i++)
2
			{
2
			{
3
				Dependency dep = (Dependency)deps.elementAt(i);
3
				
4
				dep.satisfy(roster,installDirectory,downloadSource)
4
Selection s = (Selection)selection.elementAt(i);
5
				if(offset >= s.start && offset <= s.end)
5
;
6
					return s;
6
			}
7
			}
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 locationClones are in different classes
Number of node comparisons1