for(int i = 0; i < put.length; i++) { if(i != 0) buf.append(','); buf.append(put[i]); }
for(int i = 0; i < selected.length; i++) { buf.append(selected[i]); buf.append('\n'); }
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/gui/LogViewer.java
Method name: void fvmput(int, int, int[]) Method name: void actionPerformed(ActionEvent)
Number of AST nodes: 4 Number of AST nodes: 3
1
for(int i = 0; i < put.length; i++)
1
for(int i = 0; i < selected.length; i++)
2
				{
2
					{
3
					if(i != 0)
4
						buf.append(',');
3
						buf.append(selected[i]);
5
					buf.append(put[i]);
4
						buf.append('\n');
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