start = line + 1; for(int i = line + 1; i < lineCount; i++) { if(buffer.getFoldLevel(i) <= initialFoldLevel) { end = i - 1; break; } }
for(int i = line + 1; i < lineCount; i++) { //XXX if((isLineVisible(i) && buffer.getFoldLevel(i) < initialFoldLevel) || i == getLastVisibleLine()) { end = i - 1; break; } }
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 collapseFold(int) Method name: int expandFold(int, boolean)
Number of AST nodes: 5 Number of AST nodes: 4
1
start = line + 1;
2
			for(int i = line + 1; i < lineCount; i++)
1
for(int i = line + 1; i < lineCount; i++)
3
			{
2
				{
4
				if(
3
					//XXX
4
					if((isLineVisible(i) &&
5
buffer.getFoldLevel(i) <= initialFoldLevel)
5
						buffer.getFoldLevel(i) < initialFoldLevel)
6
				
6
						|| i == getLastVisibleLine())
7
{
7
					{
8
					end = i - 1;
8
						end = i - 1;
9
					break;
9
						break;
10
				}
10
					}
11
			}
11
				}
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