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;
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;
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: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
for (int i = 0; i < max; i++) {
1
for (int i = 0; i < max; i++) {
2
            final int component1 = (i < components.length) ? components[ i ] : 0;
2
            final int component1 = (i < components.length) ? components[ i ] : 0;
3
            final int component2 = (i < other.components.length) ? other.components[ i ] : 0;
3
            final int component2 = (i < other.components.length) ? other.components[ i ] : 0;
4
            if (component2 > component1) {
4
            if (component2 > component1) {
5
                return false;
5
                return false;
6
            }
6
            }
7
            if (component2 < component1) {
7
            if (component2 < component1) {
8
                return true;
8
                return true;
9
            
9
            
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0