int index = fvmget(line + 1); if(index == -1) { expandAllFolds(); return -1; } start = fvm[index]; if(index != fvmcount - 1) end = fvm[index + 1] - 1; else { start = line + 1; for(int i = line + 1; i < lineCount; i++) { if(/* isLineVisible(i) && */ buffer.getFoldLevel(i) <= initialFoldLevel) { end = i - 1; break; } } }
int index = fvmget(line); if(index == -1) { expandAllFolds(); return -1; } start = fvm[index]; if(index != fvmcount - 1) end = fvm[index + 1] - 1; else { 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: int expandFold(int, boolean) Method name: int expandFold(int, boolean)
Number of AST nodes: 12 Number of AST nodes: 11
1
int index = fvmget(line + 1);
1
int index = fvmget(line);
2
			if(index == -1)
2
			if(index == -1)
3
			{
3
			{
4
				expandAllFolds();
4
				expandAllFolds();
5
				return -1;
5
				return -1;
6
			}
6
			}
7
			start = fvm[index];
7
			start = fvm[index];
8
			if(index != fvmcount - 1)
8
			if(index != fvmcount - 1)
9
				end = fvm[index + 1] - 1;
9
				end = fvm[index + 1] - 1;
10
			else
10
			else
11
			{
11
			{
12
				start = line + 1;
13
				for(int i = line + 1; i < lineCount; i++)
12
				for(int i = line + 1; i < lineCount; i++)
14
				{
13
				{
15
					if(/* 
14
					//XXX
16
isLineVisible(i) && */
15
					if((isLineVisible(i) &&
17
						buffer.getFoldLevel(i) <= initialFoldLevel)
16
						buffer.getFoldLevel(i) < initialFoldLevel)
18
					
17
						|| i == getLastVisibleLine())
19
{
18
					{
20
						end = i - 1;
19
						end = i - 1;
21
						break;
20
						break;
22
					}
21
					}
23
				}
22
				}
24
			}
23
			}
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.3
Clones locationClones are in the same method
Number of node comparisons1