if (constraint.getWidthRange().contains(s.width)) { return s; } else { RectangleConstraint c = constraint.toFixedWidth( constraint.getWidthRange().constrain(s.getWidth())); return arrangeFF(container, g2, c); }
if (constraint.getWidthRange().contains(s.width)) { return s; } else { RectangleConstraint c = constraint.toFixedWidth( constraint.getWidthRange().constrain(s.getWidth()) ); return arrangeFF(container, g2, c); }
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/block/CenterArrangement.java File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (constraint.getWidthRange().contains(s.width)) {
1
if (constraint.getWidthRange().contains(s.width)) {
2
            return s;   
2
            return s;   
3
        }
3
        }
4
        else {
4
        else {
5
            RectangleConstraint c = constraint.toFixedWidth(
5
            RectangleConstraint c = constraint.toFixedWidth(
6
                    constraint.getWidthRange().constrain(s.getWidth())
6
                constraint.getWidthRange().constrain(s.getWidth())
7
);
7
            );
8
            return arrangeFF(container, g2, c);
8
            return arrangeFF(container, g2, c);
9
        }
9
        }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0