if (total_width != free_width) {
double dx = ((double)free_width) / ((double)total_width);
for (int c = 0; c < ncols; c++) {
col_widths[c] = (int) ((double)col_widths[c] * dx);
if (total_width != free_width) {
double dx = ((double)free_width) / ((double)total_width);
for (int c = 0; c < ncols; c++) {
col_widths[c] = (int) ((double)col_widths[c] * dx);
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 | if (total_width != free_width) {↵ | | 1 | if (total_width != free_width) {↵
|
2 | double dx = ((double)free_width) / ((double)total_width);↵ | | 2 | double dx = ((double)free_width) / ((double)total_width);↵
|
3 | for (int c = 0; c < ncols; c++) {↵ | | 3 | for (int c = 0; c < ncols; c++) {↵
|
4 | col_widths[c] = (int) ((double)col_widths[c] * dx);↵ | | 4 | col_widths[c] = (int) ((double)col_widths[c] * dx);↵
|
5 | | | 5 |
|
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 |