for(int i = 0; i < put.length; i++) { if(i != 0) buf.append(','); buf.append(put[i]); }
dout.writeInt(bools.length); for(int i = 0; i < bools.length; i++) { dout.writeBoolean(bools[i]); }
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/PluginJAR.java
Method name: void fvmput(int, int, int[]) Method name: void writeBooleanArray(DataOutputStream, boolean[])
Number of AST nodes: 4 Number of AST nodes: 3
1
dout.writeInt(bools.length);
1
for(int i = 0; i < put.length; i++)
2
				for(int i = 0; i < bools.length; i++)
2
				{
3
				{
3
					if(i != 0)
4
					
4
						buf.append(',');
5
					buf.append(put[i]);
5
dout.writeBoolean(bools[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