for (int i = 0; i < replacefilters.size(); i++) { Replacefilter filter = (Replacefilter) replacefilters.elementAt(i); if (!filter.process()) { return false; } }
for (int i = 0; i < children.size(); ++i) { UnknownElement child = (UnknownElement) children.get(i); if (!child.similar(other.children.get(i))) { return false; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Replace.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/UnknownElement.java
Method name: boolean processFilterChain() Method name: boolean similar(Object)
Number of AST nodes: 4 Number of AST nodes: 4
1
for (int i = 0; i < replacefilters.size(); i++) {
1
for (int i = 0; i < children.size(); ++i) {
2
            Replacefilter filter = (Replacefilter) replacefilters.elementAt(i);
2
            
3
            if (!filter.process(
3
UnknownElement child = (UnknownElement) children.get(i);
4
)) {
4
            if (!child.similar(other.children.get(i))) {
5
                return false;
5
                return false;
6
            }
6
            }
7
        }
7
        }
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.2
Clones locationClones are in different classes having the same super class
Number of node comparisons1