for (int d = 0; d < deleteChars.length(); ++d) { if (deleteChars.charAt(d) == c) { return true; } }
while ((te = i.getNextEntry()) != null) { if (te.getName().equals(getName())) { return i; } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/filters/TokenFilter.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/resources/TarResource.java
Method name: boolean isDeleteCharacter(char) Method name: InputStream getInputStream()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int d = 0; d < deleteChars.length(); ++d) {
1
while ((te = i.getNextEntry()) != null) {
2
                if (deleteChars.charAt(d) ==  c) {
2
            if (te.getName().equals(getName())) {
3
                    return true;
3
                return i;
4
                }
4
            
5
    
5
}
6
        }
6
        }
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 having the same super class
Number of node comparisons1