345-1-2

if (h == LengthConstraintType.NONE) { throw new RuntimeException("Not implemented."); } else if (h == LengthConstraintType.FIXED) { return arrangeFF(container, g2, constraint); } else if (h == LengthConstraintType.RANGE) { throw new RuntimeException("Not implemented."); }
if (w == LengthConstraintType.RANGE) { if (h == LengthConstraintType.NONE) { throw new RuntimeException("Not implemented."); } 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/ColumnArrangement.java |  | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.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 (w == LengthConstraintType.RANGE) {↵

1

    if (h == LengthConstraintType.NONE) {↵

2

                if (h == LengthConstraintType.NONE) {↵

2

                    throw new RuntimeException("Not implemented.");  ↵

3

                    throw new RuntimeException("Not implemented.");  ↵

3

                }↵

4

                }↵

4

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

5

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

5

                    return arrangeFF(container, g2, constraint); ↵

6

                    return arrangeRF(container, g2, constraint);  ↵

6

                }↵

7

                }↵

7

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

8

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

8

                    throw new RuntimeException("Not implemented.");  ↵

9

                    return arrangeRR(container, g2, constraint);  ↵

9

                }

10

                }↵

11

            }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 1
Number of refactorable cases | 0
Number of non-refactorable cases | 1
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.6
Clones location | Clones are in the same method
Number of node comparisons | 28

1. {Non-refactorable}

   Mapping Summary
   Number of mapped statements | 5
   Number of unmapped statements in the first code fragment | 1
   Number of unmapped statements in the second code fragment | 1
   Time elapsed for statement mapping (ms) | 0.8
   Clone type | Type 2

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

   11

       if (h == LengthConstraintType.NONE)

   18

       if (h == LengthConstraintType.NONE)

   12

       throw new RuntimeException("Not implemented.");

   19

       throw new RuntimeException("Not implemented.");

   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

       throw new RuntimeException("Not implemented.");

   16 | throw new RuntimeException("Not implemented.");

   Preondition Violations
   Unmatched throw new RuntimeException("Not implemented.");

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

   Preondition Violations
   Unmatched return arrangeRR(container,g2,constraint);

   23

       return arrangeRR(container, g2, constraint);

   Precondition Violations (2)
   Row | Violation
   --- | ---
   1 | Unmatched throw new RuntimeException("Not implemented.");
   2 | Unmatched return arrangeRR(container,g2,constraint);