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 (h == LengthConstraintType.NONE) { return arrangeFN(container, g2, constraint); } else if (h == LengthConstraintType.FIXED) { return arrangeFF(container, g2, constraint); } else if (h == LengthConstraintType.RANGE) { return arrangeFR(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/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: 6
1
if (h == LengthConstraintType.NONE) {
1
if (h == LengthConstraintType.NONE) {
2
                return arrangeRN(container, g2, constraint);  
2
                return arrangeFN(container, g2, constraint);  
3
            }
3
            }
4
            else if (h == LengthConstraintType.FIXED) {
4
            else if (h == LengthConstraintType.FIXED) {
5
                return arrangeRF(container, g2, constraint);  
5
                return arrangeFF(container, g2, constraint);  
6
            }
6
            }
7
            else if (h == LengthConstraintType.RANGE) {
7
            else if (h == LengthConstraintType.RANGE) {
8
                return arrangeRR(container, g2, constraint);   
8
                return arrangeFR(container, g2, constraint);  
9
            }
9
            }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases1
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.7
Clones locationClones are in different classes
Number of node comparisons28
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements6
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)617.7
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    18
    if (h == LengthConstraintType.NONE)
    11
    if (h == LengthConstraintType.NONE)
    19
    return arrangeRN(container, g2, constraint);
    19
    return arrangeRN(container, g2, constraint);
    12
    return arrangeFN(container, g2, constraint);
    Differences
    Expression1Expression2Difference
    arrangeRNarrangeFNMETHOD_INVOCATION_NAME_MISMATCH
    12
    return arrangeFN(container, g2, constraint);
    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 (0)
    Row Violation