if(start == fvm[0]) fvmput(starti,endi + 1,null); else { fvmput(starti + 1,endi,null); fvm[starti + 1] = start; }
if(starti != -1 && fvm[starti] == start) fvmput(starti,endi + 1,null); else { fvmput(starti + 1,endi,null); fvm[starti + 1] = start; }
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(start == fvm[0])
1
if(starti != -1 && fvm[starti] == start)
2
					fvmput(starti,endi + 1,null);
2
					fvmput(starti,endi + 1,null);
3
				else
3
				else
4
				{
4
				{
5
					fvmput(starti + 1,endi,null);
5
					fvmput(starti + 1,endi,null);
6
					fvm[starti + 1] = start;
6
					fvm[starti + 1] = start;
7
				}
7
				}
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.1
Clones locationClones are declared in the same class
Number of node comparisons1