for(int i = 0; i < put.length; i++) { if(i != 0) buf.append(','); buf.append(put[i]); }
for(int i = 0; i < classes.length; i++) { classHash.put(classes[i],this); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/DisplayManager.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/JARClassLoader.java
Method name: void fvmput(int, int, int[]) Method name: void activate()
Number of AST nodes: 4 Number of AST nodes: 2
1
for(int i = 0; i < put.length; i++)
1
for(int i = 0; i < classes.length; i++)
2
				{
2
			{
3
					if(i != 0)
3
				
4
						buf.append(',');
5
					buf.append(put[i]);
4
classHash.put(classes[i],this);
6
				}
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.0
Clones locationClones are in different classes
Number of node comparisons1