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); }
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/CenterArrangement.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
                return arrangeRN(container, g2, constraint);  
3
                throw new RuntimeException("Not implemented.");  
3
            }
4
            }
4
            else if (h == LengthConstraintType.FIXED) {
5
            else if (h == LengthConstraintType.FIXED) {
5
                return arrangeRF(container, g2, constraint);  
6
                return arrangeRF(container, g2, constraint);  
6
            }
7
            }
7
            else if (h == LengthConstraintType.RANGE) {
8
            else if (h == LengthConstraintType.RANGE) {
8
                return arrangeRR(container, g2, constraint);   
9
                return arrangeRR(container, g2, constraint);  
9
            }
10
            }
11
        }
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)0.7
Clones locationClones are in different classes
Number of node comparisons28
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)2.3
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    18
    if (h == LengthConstraintType.NONE)
    18
    if (h == LengthConstraintType.NONE)
    20
    if (h == LengthConstraintType.FIXED)
    Differences
    Expression1Expression2Difference
    NONEFIXEDVARIABLE_NAME_MISMATCH
    20
    if (h == LengthConstraintType.FIXED)
    19
    return arrangeRN(container, g2, constraint);
    19
    return arrangeRN(container, g2, constraint);
    21
    return arrangeRF(container, g2, constraint);
    Differences
    Expression1Expression2Difference
    arrangeRNarrangeRFMETHOD_INVOCATION_NAME_MISMATCH
    21
    return arrangeRF(container, g2, constraint);
    20
    else if (h == LengthConstraintType.FIXED)
    20
    else if (h == LengthConstraintType.FIXED)
    22
    else if (h == LengthConstraintType.RANGE)
    Differences
    Expression1Expression2Difference
    FIXEDRANGEVARIABLE_NAME_MISMATCH
    22
    else if (h == LengthConstraintType.RANGE)
    21
    return arrangeRF(container, g2, constraint);
    21
    return arrangeRF(container, g2, constraint);
    23
    return arrangeRR(container, g2, constraint);
    Differences
    Expression1Expression2Difference
    arrangeRFarrangeRRMETHOD_INVOCATION_NAME_MISMATCH
    23
    return arrangeRR(container, g2, constraint);
    22
    if (h == LengthConstraintType.RANGE)
    22
    if (h == LengthConstraintType.RANGE)
    18
    if (h == LengthConstraintType.NONE)
    Differences
    Expression1Expression2Difference
    RANGENONEVARIABLE_NAME_MISMATCH
    18
    if (h == LengthConstraintType.NONE)
                                                                                                          
    19
    throw new RuntimeException("Not implemented.");
    Preondition Violations
    Unmatched statement throw new RuntimeException("Not implemented."); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted
    Unmatched throw new RuntimeException("Not implemented.");
    19
    throw new RuntimeException("Not implemented.");
    23
    return arrangeRR(container, g2, constraint);
    23
    return arrangeRR(container, g2, constraint);
    Preondition Violations
    Unmatched return arrangeRR(container,g2,constraint);
                                                                                                
    Precondition Violations (4)
    Row Violation
    1Unmatched statement throw new RuntimeException("Not implemented."); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted
    2Unmatched throw new RuntimeException("Not implemented.");
    3Unmatched return arrangeRR(container,g2,constraint);
    4Not all possible execution flows end in a return statement