if (w == LengthConstraintType.FIXED) { 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."); } } else 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); } }
if (w == LengthConstraintType.FIXED) { 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); } } else 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/block/ColumnArrangement.java File path: /jfreechart-1.0.10/src/org/jfree/chart/block/GridArrangement.java
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint) Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
Number of AST nodes: 14 Number of AST nodes: 14
1
if (w == LengthConstraintType.FIXED) {
1
if (w == LengthConstraintType.FIXED) {
2
            if (h == LengthConstraintType.NONE) {
2
            if (h == LengthConstraintType.NONE) {
3
                throw new RuntimeException("Not implemented."
3
                // find optimum height
4
);  
4
                return arrangeFN(container, g2, constraint);  
5
            }
5
            }
6
            else if (h == LengthConstraintType.FIXED) {
6
            else if (h == LengthConstraintType.FIXED) {
7
                return arrangeFF(container, g2, constraint); 
7
                return arrangeFF(container, g2, constraint);
8
            }
8
            }
9
            else if (h == LengthConstraintType.RANGE) {
9
            else if (h == LengthConstraintType.RANGE) {
10
                throw new RuntimeException("Not implemented."
10
                // find optimum height and map to range
11
);  
11
                return arrangeFR(container, g2, constraint);  
12
            }
12
            }
13
        }
13
        }
14
        else if (w == LengthConstraintType.RANGE) {
14
        else if (w == LengthConstraintType.RANGE) {
15
            // find optimum width and map to range
15
            if (h == LengthConstraintType.NONE) {
16
            if (h == LengthConstraintType.NONE) {
17
                // find optimum height
16
                throw new RuntimeException("Not implemented.");  
18
                throw new RuntimeException("Not yet implemented.");  
17
            }
19
            }
18
            else if (h == LengthConstraintType.FIXED) {
20
            else if (h == LengthConstraintType.FIXED) {
19
                return arrangeRF(container, g2, constraint
21
                // fixed width
20
);  
22
                throw new RuntimeException("Not yet implemented.");  
21
            }
23
            }
22
            else if (h == LengthConstraintType.RANGE) {
24
            else if (h == LengthConstraintType.RANGE) {
23
                return arrangeRR(container, g2, constraint);  
25
                throw new RuntimeException("Not yet implemented.");  
24
            }
26
            }
25
        }
27
        }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)2.3
Clones locationClones are in different classes
Number of node comparisons85
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements12
    Number of unmapped statements in the first code fragment2
    Number of unmapped statements in the second code fragment2
    Time elapsed for statement mapping (ms)4.7
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    10
    else if (w == LengthConstraintType.FIXED)
    10
    else if (w == LengthConstraintType.FIXED)
    17
    else if (w == LengthConstraintType.RANGE)
    Differences
    Expression1Expression2Difference
    FIXEDRANGEVARIABLE_NAME_MISMATCH
    17
    else if (w == LengthConstraintType.RANGE)
    11
    if (h == LengthConstraintType.NONE)
    18
    if (h == LengthConstraintType.NONE)
    12
    throw new RuntimeException("Not implemented.");
    12
    throw new RuntimeException("Not implemented.");
    19
    throw new RuntimeException("Not yet implemented.");
    Differences
    Expression1Expression2Difference
    "Not implemented.""Not yet implemented."LITERAL_VALUE_MISMATCH
    19
    throw new RuntimeException("Not yet 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);
    Preondition Violations
    Unmatched return arrangeFF(container,g2,constraint);
                                                                                                
                                                                                                                  
    21
    throw new RuntimeException("Not yet implemented.");
    Preondition Violations
    Unmatched throw new RuntimeException("Not yet implemented.");
    21
    throw new RuntimeException("Not yet implemented.");
    15
    else if (h == LengthConstraintType.RANGE)
    22
    else if (h == LengthConstraintType.RANGE)
    16
    throw new RuntimeException("Not implemented.");
    16
    throw new RuntimeException("Not implemented.");
    23
    throw new RuntimeException("Not yet implemented.");
    Differences
    Expression1Expression2Difference
    "Not implemented.""Not yet implemented."LITERAL_VALUE_MISMATCH
    23
    throw new RuntimeException("Not yet implemented.");
    17
    else if (w == LengthConstraintType.RANGE)
    17
    else if (w == LengthConstraintType.RANGE)
    10
    else if (w == LengthConstraintType.FIXED)
    Differences
    Expression1Expression2Difference
    RANGEFIXEDVARIABLE_NAME_MISMATCH
    10
    else if (w == LengthConstraintType.FIXED)
    18
    if (h == LengthConstraintType.NONE)
    11
    if (h == LengthConstraintType.NONE)
                                                                                                
    12
    return arrangeFN(container, g2, constraint);
    Preondition Violations
    Unmatched return arrangeFN(container,g2,constraint);
    12
    return arrangeFN(container, g2, constraint);
    19
    throw new RuntimeException("Not implemented.");
    19
    throw new RuntimeException("Not implemented.");
    Preondition Violations
    Unmatched throw new RuntimeException("Not implemented.");
                                                                                                          
    20
    else if (h == LengthConstraintType.FIXED)
    13
    else if (h == LengthConstraintType.FIXED)
    21
    return arrangeRF(container, g2, constraint);
    21
    return arrangeRF(container, g2, constraint);
    14
    return arrangeFF(container, g2, constraint);
    Differences
    Expression1Expression2Difference
    arrangeRFarrangeFFMETHOD_INVOCATION_NAME_MISMATCH
    14
    return arrangeFF(container, g2, constraint);
    22
    else if (h == LengthConstraintType.RANGE)
    15
    else if (h == LengthConstraintType.RANGE)
    23
    return arrangeRR(container, g2, constraint);
    23
    return arrangeRR(container, g2, constraint);
    16
    return arrangeFR(container, g2, constraint);
    Differences
    Expression1Expression2Difference
    arrangeRRarrangeFRMETHOD_INVOCATION_NAME_MISMATCH
    16
    return arrangeFR(container, g2, constraint);
    Precondition Violations (4)
    Row Violation
    1Unmatched return arrangeFF(container,g2,constraint);
    2Unmatched throw new RuntimeException("Not yet implemented.");
    3Unmatched return arrangeFN(container,g2,constraint);
    4Unmatched throw new RuntimeException("Not implemented.");