if(endi <= fvmcount - 2 && fvm[endi + 1] == end + 1) { fvmput(starti,endi + 2,null); } else { fvmput(starti,endi + 1, new int[] { end + 1 }); }
if(end + 1 == fvm[fvmcount - 1]) fvmput(starti + 1,endi + 2,null); else { fvmput(starti + 1,endi,null); fvm[starti + 1] = end + 1; }
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/textarea/DisplayManager.java
Method name: void fvmput2(int, int, int, int) Method name: void hideLineRange(int, int)
Number of AST nodes: 3 Number of AST nodes: 4
1
if(endi <= fvmcount - 2 && fvm[endi + 1]
1
if(end + 1 == fvm[fvmcount - 
2
				== end + 1)
3
			{
2
1])
4
				fvmput(starti,endi + 2,null);
3
					fvmput(starti + 1,endi + 2,null);
5
			}
4
			
6
			else
5
	else
7
			{
6
				{
8
				fvmput(starti,endi + 1,
7
					fvmput(starti + 1,endi
9
					new int[
8
,null);
10
] { end + 1 });
9
					fvm[starti + 1] = end + 1;
11
			}
10
				}
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.2
Clones locationClones are declared in the same class
Number of node comparisons1