for (int i = 0; i < b.length; i++) { if (b[i]) { t++; } }
for (int i = 0; i < genLength; i++) { if (sGeneratedCmdLine[i] == "") { cnt++; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/Quantifier.java File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/ant/taskdefs/optional/vss/MSVSSTest.java
Method name: boolean evaluate(boolean[]) Method name: void checkCommandLines(String[], String[])
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < b.length; i++) {
1
for (int i = 0; i < genLength; i++) {
2
            if (b[i]) {
2
            if (sGeneratedCmdLine[i] == "") {
3
                t++;
3
                cnt++;
4
            }
4
            }
5
        }
5
        }
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.1
Clones locationClones are in different classes
Number of node comparisons1