for (int r = 0; r < nrows; r++) {
int i = r * ncols + c;
if (i < ncomponents) {
switch (which) {
case 0:
col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width);
break;
case 1:
col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width);
break;
default:
col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width);
break;
}
} else {
break;
}
}
for (int r = 0; r < nrows; r++) {
int i = r * ncols + c;
if (i < ncomponents) {
switch (which) {
case 0:
col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width);
break;
case 1:
col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width);
break;
default:
col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width);
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: 14
|
|
Number of AST nodes: 14
|
|
1 | for (int r = 0; r < nrows; r++) {↵ | | 1 | for (int r = 0; r < nrows; r++) {↵
|
2 | int i = r * ncols + c;↵ | | 2 | int i = r * ncols + c;↵
|
3 | if (i < ncomponents) {↵ | | 3 | if (i < ncomponents) {↵
|
4 | switch (which) {↵ | | 4 | switch (which) {↵
|
5 | case 0:↵ | | 5 | case 0:↵
|
6 | col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width);↵ | | 6 | col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width);↵
|
7 | break;↵ | | 7 | break;↵
|
8 | case 1:↵ | | 8 | case 1:↵
|
9 | col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width);↵ | | 9 | col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width);↵
|
10 | break;↵ | | 10 | break;↵
|
11 | default:↵ | | 11 | default:↵
|
12 | col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width);↵ | | 12 | col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width);↵
|
13 | break;↵ | | 13 | break;↵
|
14 | }↵ | | 14 | }↵
|
15 | } else {↵ | | 15 | } else {↵
|
16 | break;↵ | | 16 | break;↵
|
17 | }↵ | | 17 | }↵
|
18 | } | | 18 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.4 |
Clones location | Clones are in different classes |
Number of node comparisons | 66 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 14 |
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) | 4.9 |
Clone type | Type 1 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
24 | for (int r = 0; r < nrows; r++) | | 24 | for (int r = 0; r < nrows; r++) |
25 | | | 25 | |
26 | | | 26 | |
27 | | | 27 | |
28 | | | 28 | |
29 | col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width); | | 29 | col_width = Math.max(col_width, parent.getComponent(i).getMinimumSize().width); |
30 | | | 30 | |
31 | | | 31 | |
32 | col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width); | | 32 | col_width = Math.max(col_width, parent.getComponent(i).getMaximumSize().width); |
33 | | | 33 | |
34 | | | 34 | |
35 | col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width); | | 35 | col_width = Math.max(col_width, parent.getComponent(i).getPreferredSize().width); |
36 | | | 36 | |
| | | | |
37 | | | 37 | |
Precondition Violations (0)
Row |
Violation |