try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo); }
if (makeURL) { try { return file.toURL().toExternalForm(); } catch (MalformedURLException e) { throw new BuildException(ERROR_NO_URL_CONVERT + file); } }
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/taskdefs/optional/dotnet/WsdlToDotnet.java
Method name: void initMessageDigest() Method name: String evaluate()
Number of AST nodes: 2 Number of AST nodes: 3
1
try {
2
                messageDigest = MessageDigest.getInstance(
1
if (makeURL) {
2
                try {
3
algorithm);
3
                    return file.toURL().toExternalFor
4
m();
4
            } catch (NoSuchAlgorithmException noalgo) {
5
                } catch (
6
MalformedURLException e) {
5
                throw new BuildException(noalgo);
7
                    throw new BuildException(ERROR_NO_URL_CONVERT + file);
8
                }
6
            }
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.2
Clones locationClones are in different classes
Number of node comparisons1