final int max = Math.max(other.components.length, components.length); for (int i = 0; i < max; i++) { final int component1 = (i < components.length) ? components[ i ] : 0; final int component2 = (i < other.components.length) ? other.components[ i ] : 0; if (component2 > component1) { return false; } if (component2 < component1) { return true; } } return false;
final int max = Math.max(other.components.length, components.length); for (int i = 0; i < max; i++) { final int component1 = (i < components.length) ? components[ i ] : 0; final int component2 = (i < other.components.length) ? other.components[ i ] : 0; if (component2 > component1) { return false; } if (component2 < component1) { return true; } } return true;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/DeweyDecimal.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/DeweyDecimal.java
Method name: boolean isGreaterThan(DeweyDecimal) Method name: boolean isGreaterThanOrEqual(DeweyDecimal)
Number of AST nodes: 9 Number of AST nodes: 9
1
final int max = Math.max(other.components.length, components.length);
1
final int max = Math.max(other.components.length, components.length);
2
        for (int i = 0; i < max; i++) {
2
        for (int i = 0; i < max; i++) {
3
            final int component1 = (i < components.length) ? components[ i ] : 0;
3
            final int component1 = (i < components.length) ? components[ i ] : 0;
4
            final int component2 = (i < other.components.length) ? other.components[ i ] : 0;
4
            final int component2 = (i < other.components.length) ? other.components[ i ] : 0;
5
            if (component2 > component1) {
5
            if (component2 > component1) {
6
                return false;
6
                return false;
7
            }
7
            }
8
            if (component2 < component1) {
8
            if (component2 < component1) {
9
                return true;
9
                return true;
10
            }
10
            }
11
        }
11
        }
12
        return false;
12
        return true;
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 comparisons26
  1. {Refactorable}
    Mapping Summary
    Number of mapped statements9
    Number of unmapped statements in the first code fragment0
    Number of unmapped statements in the second code fragment0
    Time elapsed for statement mapping (ms)2.1
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    1
    final int max = Math.max(other.components.length, components.length);
    1
    final int max = Math.max(other.components.length, components.length);
    2
    for (int i = 0; i < max; i++)
    2
    for (int i = 0; i < max; i++)
    3
    final int component1 = (i < components.length) ? components[i] : 0;
    3
    final int component1 = (i < components.length) ? components[i] : 0;
    4
    final int component2 = (i < other.components.length) ? other.components[i] : 0;
    4
    final int component2 = (i < other.components.length) ? other.components[i] : 0;
    5
    if (component2 > component1)
    5
    if (component2 > component1)
    6
    return false;
    6
    return false;
    7
    if (component2 < component1)
    7
    if (component2 < component1)
    8
    return true;
    8
    return true;
    9
    return false;
    9
    return false;
    9
    return true;
    Differences
    Expression1Expression2Difference
    falsetrueLITERAL_VALUE_MISMATCH
    9
    return true;
    Precondition Violations (0)
    Row Violation