for(int i = 2; i < comp.length; i++)
{
int btnHeight = comp[i].getPreferredSize().height;
if(btnHeight + y > height)
{
returnValue.width += colWidth;
y = insets.top;
}
y += btnHeight;
}
for(int i = 2; i < comp.length; i++)
{
int btnHeight = comp[i].getPreferredSize().height;
if(btnHeight + y > height)
{
returnValue.width += colWidth;
y = insets.top;
}
y += btnHeight;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/PanelWindowContainer.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/PanelWindowContainer.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for(int i = 2; i < comp.length; i++)↵ | | 1 | for(int i = 2; i < comp.length; i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | int btnHeight = comp[i].getPreferredSize().height;↵ | | 3 | int btnHeight = comp[i].getPreferredSize().height;↵
|
4 | if(btnHeight + y > height)↵ | | 4 | if(btnHeight + y > height)↵
|
5 | {↵ | | 5 | {↵
|
6 | returnValue.width += colWidth;↵ | | 6 | returnValue.width += colWidth;↵
|
7 | y = insets.top;↵ | | 7 | y = insets.top;↵
|
8 | }↵ | | 8 | }↵
|
|
9 | y += btnHeight;↵ | | 9 | y += btnHeight;↵
|
10 | } | | 10 | }
|
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.0 |
Clones location | |
Number of node comparisons | 0 |