for(int i = 0; i < model.files.length; i++) { if(model.files[i].expanded) set.add(model.files[i].dirEntry.path); }
for(int i = 0; i < this.pattern.length; i++) { this.pattern[i] = Character.toUpperCase( this.pattern[i]); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/browser/VFSDirectoryEntryTable.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/search/BoyerMooreSearchMatcher.java
Method name: void getExpandedDirectories(Set) Method name: void BoyerMooreSearchMatcher(String, boolean)
Number of AST nodes: 3 Number of AST nodes: 2
1
for(int i = 0; i < model.files.length; i++)
1
for(int i = 0; i < this.pattern.length; i++)
2
			{
2
			{
3
				if(model.files[i].expanded)
3
				
4
					set.add(model.files[i].dirEntry.path
4
this.pattern[i] = Character.toUpperCase(
5
);
5
					this.pattern[i]);
6
			}
6
			}
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