for (int c = 0, x = insets.left; c < ncols; x += col_widths[c] + hgap, c++, i++) {
if (i < ncomponents) {
parent.getComponent(i).setBounds(x, y, col_widths[c], row_heights[r]);
for (int c = 0, x = insets.left; c < ncols; x += col_widths[c] + hgap, c++, i++) {
if (i < ncomponents) {
parent.getComponent(i).setBounds(x, y, col_widths[c], row_heights[r]);
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:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for (int c = 0, x = insets.left; c < ncols; x += col_widths[c] + hgap, c++, i++) {↵ | | 1 | for (int c = 0, x = insets.left; c < ncols; x += col_widths[c] + hgap, c++, i++) {↵
|
2 | if (i < ncomponents) {↵ | | 2 | if (i < ncomponents) {↵
|
3 | parent.getComponent(i).setBounds(x, y, col_widths[c], row_heights[r]);↵ | | 3 | parent.getComponent(i).setBounds(x, y, col_widths[c], row_heights[r]);↵
|
4 | | | 4 |
|
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 |