double result = x; if (edge == RectangleEdge.LEFT) { result = result + w1; } else if (edge == RectangleEdge.RIGHT) { result = result + w2; } return result;
double result = y; if (edge == RectangleEdge.TOP) { result = result + h1; } else if (edge == RectangleEdge.BOTTOM) { result = result + h2; } return result;
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/Plot.java File path: /jfreechart-1.0.10/src/org/jfree/chart/plot/Plot.java
Method name: double getRectX(double, double, double, RectangleEdge) Method name: double getRectY(double, double, double, RectangleEdge)
Number of AST nodes: 6 Number of AST nodes: 6
1
double result = x;
1
double result = y;
2
        if (edge == RectangleEdge.LEFT) {
2
        if (edge == RectangleEdge.TOP) {
3
            result = result + w1;
3
            result = result + h1;
4
        }
4
        }
5
        else if (edge == RectangleEdge.RIGHT) {
5
        else if (edge == RectangleEdge.BOTTOM) {
6
            result = result + w2;
6
            result = result + h2;
7
        }
7
        }
8
        return result;
8
        return result;
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.4
Clones locationClones are declared in the same class
Number of node comparisons17
  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)1.9
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    double result = x;
    1
    double result = x;
    1
    double result = y;
    Differences
    Expression1Expression2Difference
    xyVARIABLE_NAME_MISMATCH
    1
    double result = y;
    2
    if (edge == RectangleEdge.LEFT)
    2
    if (edge == RectangleEdge.LEFT)
    2
    if (edge == RectangleEdge.TOP)
    Differences
    Expression1Expression2Difference
    LEFTTOPVARIABLE_NAME_MISMATCH
    2
    if (edge == RectangleEdge.TOP)
    3
    result = result + w1;
    3
    result = result + w1;
    3
    result = result + h1;
    Differences
    Expression1Expression2Difference
    w1h1VARIABLE_NAME_MISMATCH
    3
    result = result + h1;
    4
    else if (edge == RectangleEdge.RIGHT)
    4
    else if (edge == RectangleEdge.RIGHT)
    4
    else if (edge == RectangleEdge.BOTTOM)
    Differences
    Expression1Expression2Difference
    RIGHTBOTTOMVARIABLE_NAME_MISMATCH
    4
    else if (edge == RectangleEdge.BOTTOM)
    5
    result = result + w2;
    5
    result = result + w2;
    5
    result = result + h2;
    Differences
    Expression1Expression2Difference
    w2h2VARIABLE_NAME_MISMATCH
    5
    result = result + h2;
    6
    return result;
    6
    return result;
    Precondition Violations (0)
    Row Violation