try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo, getLocation()); }
for (int i = 0; i < N2A_CLASSNAMES.length; i++) { try { return Class.forName(N2A_CLASSNAMES[i]); } catch (ClassNotFoundException cnfe) { // Ignore } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Checksum.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/native2ascii/KaffeNative2Ascii.java
Method name: boolean validateAndExecute() Method name: Class getN2aClass()
Number of AST nodes: 2 Number of AST nodes: 3
1
try {
2
                messageDigest = MessageDigest.getInstance(algorithm
1
for (int i = 0; i < N2A_CLASSNAMES.length; i++) {
2
            try {
3
);
3
                return Class.forName(N2A_CLASSNAMES[i]);
4
            } catch (NoSuchAlgorithmException noalgo) {
4
            } catch (ClassNotFoundException cnfe) {
5
                throw new BuildException(noalgo, getLocation());
5
                
6
// Ignore
6
    
7
            }
7
        }
8
        }
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