349-2-3

if (h == LengthConstraintType.NONE) { throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.RANGE) { throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented."); }
if (w == LengthConstraintType.RANGE) { // find optimum width and map to range if (h == LengthConstraintType.NONE) { // find optimum height throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.FIXED) { // fixed width throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.RANGE) { throw new RuntimeException("Not yet implemented."); } }

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

1

    if (w == LengthConstraintType.RANGE) {↵

2

                // find optimum width and map to range↵

1

    if (h == LengthConstraintType.NONE) {↵

3

                if (h == LengthConstraintType.NONE) {↵

4

                    // find optimum height↵

2

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

5

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

3

                }↵

6

                }↵

4

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

7

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

8

                    // fixed width↵

5

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

9

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

6

                }↵

10

                }↵

7

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

11

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

8

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

12

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

9

                }

13

                }↵

14

            }

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.7
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) | 0.6
   Clone type | Type 1

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

   13

       if (h == LengthConstraintType.NONE)

   18

       if (h == LengthConstraintType.NONE)

   14

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

   19

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

   15

       else if (h == LengthConstraintType.RANGE)

   22

       else if (h == LengthConstraintType.RANGE)

   16

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

   23

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

   17

       else if (h == LengthConstraintType.FIXED)

   20

       else if (h == LengthConstraintType.FIXED)

   18

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

   21

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

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