for (Enumeration e = zipFiles.elements(); e.hasMoreElements();) { ZipFile zipFile = (ZipFile) e.nextElement(); try { zipFile.close(); } catch (IOException ioe) { // ignore } }
try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo, getLocation()); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/AntClassLoader.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Checksum.java
Method name: void cleanup() Method name: boolean validateAndExecute()
Number of AST nodes: 4 Number of AST nodes: 2
1
for (Enumeration e = zipFiles.elements(); e.hasMoreElements();) {
2
            ZipFile zipFile = (ZipFile) e.nextElement();
3
            try {
4
                zipFile.close(
1
try {
5
);
2
                messageDigest = MessageDigest.getInstance(algorithm);
6
            } catch (IOException ioe) {
3
            } catch (NoSuchAlgorithmException noalgo) {
7
                // ignore
4
                
8
            }
5
throw new BuildException(noalgo, getLocation());
9
        }
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
Number of node comparisons1