for (Iterator fci = v[i].iterator(); fci.hasNext();) { FilterChain fc = (FilterChain) fci.next(); stk.push(fc); fc.dieOnCircularReference(stk, p); stk.pop(); }
for (Iterator r = nextRC(rcIter).iterator(); r.hasNext();) { Object next = r.next(); if (hs.add(next)) { al.add(next); } else { al.remove(next); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/RedirectorElement.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/Difference.java
Method name: void dieOnCircularReference(Stack, Project) Method name: Collection getCollection()
Number of AST nodes: 5 Number of AST nodes: 5
1
for (Iterator fci = v[i].iterator(); fci.hasNext();) {
1
for (Iterator r = nextRC(rcIter).iterator(); r.hasNext();) {
2
                        FilterChain fc = (FilterChain) fci.next();
2
                Object next = r.next();
3
                        stk.push(fc);
3
                
4
                        fc.dieOnCircularReference(stk, p);
5
                        stk.pop(
4
if (hs.add(next)) {
5
                    al.add(next);
6
                } else {
6
);
7
                    al.remove(next);
7
        
8
                }
8
            }
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 locationClones are in different classes having the same super class
Number of node comparisons1