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