if (i < ncomponents) {
switch (which) {
case 0:
row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height);
break;
case 1:
row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height);
break;
default:
row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height);
break;
}
} else {
break;
}
if (i < ncomponents) {
switch (which) {
case 0:
row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height);
break;
case 1:
row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height);
break;
default:
row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height);
break;
}
} else {
break;
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/installer/VariableGridLayout.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/VariableGridLayout.java
|
Method name: Dimension getLayoutSize(Container, int)
|
|
Method name: Dimension getLayoutSize(Container, int)
|
Number of AST nodes: 12
|
|
Number of AST nodes: 12
|
|
1 | if (i < ncomponents) {↵ | | 1 | if (i < ncomponents) {↵
|
2 | switch (which) {↵ | | 2 | switch (which) {↵
|
3 | case 0:↵ | | 3 | case 0:↵
|
4 | row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height);↵ | | 4 | row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height);↵
|
5 | break;↵ | | 5 | break;↵
|
6 | case 1:↵ | | 6 | case 1:↵
|
7 | row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height);↵ | | 7 | row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height);↵
|
8 | break;↵ | | 8 | break;↵
|
9 | default:↵ | | 9 | default:↵
|
10 | row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height);↵ | | 10 | row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height);↵
|
11 | break;↵ | | 11 | break;↵
|
12 | }↵ | | 12 | }↵
|
13 | } else {↵ | | 13 | } else {↵
|
14 | break;↵ | | 14 | break;↵
|
15 | } | | 15 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3 |
Clones location | Clones are in different classes |
Number of node comparisons | 63 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 12 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 3.6 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
9 | if (i < ncomponents) | | 9 | if (i < ncomponents) |
10 | | | 10 | |
11 | | | 11 | |
12 | row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height); | | 12 | row_height = Math.max(row_height, parent.getComponent(i).getMinimumSize().height); |
13 | | | 13 | |
14 | | | 14 | |
15 | row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height); | | 15 | row_height = Math.max(row_height, parent.getComponent(i).getMaximumSize().height); |
16 | | | 16 | |
17 | | | 17 | |
18 | row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height); | | 18 | row_height = Math.max(row_height, parent.getComponent(i).getPreferredSize().height); |
19 | | | 19 | |
| | | | |
20 | | | 20 | |
Precondition Violations (2)
Row |
Violation |
1 | Statement break; without innermost loop |
2 | Statement break; without innermost loop |