355-3-5

if (h == LengthConstraintType.NONE) { // find optimum height return arrangeFN(container, g2, constraint); } else if (h == LengthConstraintType.FIXED) { return arrangeFF(container, g2, constraint); } else if (h == LengthConstraintType.RANGE) { // find optimum height and map to range return arrangeFR(container, g2, constraint); }
if (w == LengthConstraintType.RANGE) { if (h == LengthConstraintType.NONE) { return arrangeRN(container, g2, constraint); } else if (h == LengthConstraintType.FIXED) { return arrangeRF(container, g2, constraint); } else if (h == LengthConstraintType.RANGE) { return arrangeRR(container, g2, constraint); } }

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/block/GridArrangement.java |  | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/FlowArrangement.java
Method name: `Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)` |  | Method name: `Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)`
Number of AST nodes: 6 |  | Number of AST nodes: 7

1

    if (h == LengthConstraintType.NONE) {↵

1

    if (w == LengthConstraintType.RANGE) {↵

2

                    // find optimum height↵

2

                if (h == LengthConstraintType.NONE) {↵

3

                    return arrangeFN(container, g2, constraint);  ↵

3

                    return arrangeRN(container, g2, constraint);  ↵

4

                }↵

4

                }↵

5

                else if (h == LengthConstraintType.FIXED) {↵

5

                else if (h == LengthConstraintType.FIXED) {↵

6

                    return arrangeFF(container, g2, constraint);↵

6

                    return arrangeRF(container, g2, constraint);  ↵

7

                }↵

7

                }↵

8

                else if (h == LengthConstraintType.RANGE) {↵

8

                else if (h == LengthConstraintType.RANGE) {↵

9

                    // find optimum height and map to range↵

10

                    return arrangeFR(container, g2, constraint);  ↵

9

                    return arrangeRR(container, g2, constraint);   ↵

11

                }

10

                }↵

11

            }

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.6
Clones location | Clones are in different classes
Number of node comparisons | 28

1. {Refactorable}

   Mapping Summary
   Number of mapped statements | 6
   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) | 949.8
   Clone type | Type 2

   Mapped Statements
   ID | Statement |  | ID | Statement
   --- | --- | --- | --- | ---

   11

       if (h == LengthConstraintType.NONE)

   18

       if (h == LengthConstraintType.NONE)

   12

       return arrangeFN(container, g2, constraint);

   12 | return arrangeFN(container, g2, constraint);
   19 | return arrangeRN(container, g2, constraint);

   Differences
   Expression1 | Expression2 | Difference
   --- | --- | ---
   arrangeFN | arrangeRN | METHOD_INVOCATION_NAME_MISMATCH

   19

       return arrangeRN(container, g2, constraint);

   13

       else if (h == LengthConstraintType.FIXED)

   20

       else if (h == LengthConstraintType.FIXED)

   14

       return arrangeFF(container, g2, constraint);

   14 | return arrangeFF(container, g2, constraint);
   21 | return arrangeRF(container, g2, constraint);

   Differences
   Expression1 | Expression2 | Difference
   --- | --- | ---
   arrangeFF | arrangeRF | METHOD_INVOCATION_NAME_MISMATCH

   21

       return arrangeRF(container, g2, constraint);

   15

       else if (h == LengthConstraintType.RANGE)

   22

       else if (h == LengthConstraintType.RANGE)

   16

       return arrangeFR(container, g2, constraint);

   16 | return arrangeFR(container, g2, constraint);
   23 | return arrangeRR(container, g2, constraint);

   Differences
   Expression1 | Expression2 | Difference
   --- | --- | ---
   arrangeFR | arrangeRR | METHOD_INVOCATION_NAME_MISMATCH

   23

       return arrangeRR(container, g2, constraint);

   Precondition Violations (0)
   Row | Violation
   --- | ---