if(end + 1 == fvm[fvmcount - 1]) fvmput(starti + 1,endi + 2,null); else { fvmput(starti + 1,endi,null); fvm[starti + 1] = end + 1; }
if(endi != fvmcount - 1 && fvm[endi + 1] == end + 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 hideLineRange(int, int) Method name: void showLineRange(int, int)
Number of AST nodes: 4 Number of AST nodes: 4
1
if(end + 1 == fvm[fvmcount - 1]
1
if(endi != fvmcount - 1
2
)
2
					&& fvm[endi + 1] == end + 1)
3
					fvmput(starti + 1,endi + 2,null);
3
					fvmput(starti + 1,endi + 2,null);
4
				else
4
				else
5
				{
5
				{
6
					fvmput(starti + 1,endi,null);
6
					fvmput(starti + 1,endi,null);
7
					fvm[starti + 1] = end + 1;
7
					fvm[starti + 1] = end + 1;
8
				}
8
				}
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