start = line + 1;
for(int i = line + 1; i < lineCount; i++)
{
if(/* isLineVisible(i) && */
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: int expandFold(int, boolean)
|
|
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↵
|
5 | isLineVisible(i) && */↵ | | 4 | if((isLineVisible(i) &&↵
|
6 | buffer.getFoldLevel(i) <= initialFoldLevel)↵ | | 5 | buffer.getFoldLevel(i) < initialFoldLevel)↵
|
7 | ↵ | | 6 | || i == getLastVisibleLine())↵
|
8 | {↵ | | 7 | {↵
|
9 | end = i - 1;↵ | | 8 | end = i - 1;↵
|
10 | break;↵ | | 9 | break;↵
|
11 | }↵ | | 10 | }↵
|
12 | } | | 11 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2 |
Clones location | Clones are in the same method |
Number of node comparisons | 1 |