158-35-136

try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo); }
try { return new URL(encodeURI(file.toURL().toString())); } catch (UnsupportedEncodingException ex) { throw new MalformedURLException(ex.toString()); }

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/launch/Locator.java
Method name: `void initMessageDigest()` |  | Method name: `URL fileToURL(File)`
Number of AST nodes: 2 |  | Number of AST nodes: 2

1

    try {↵

1

    try {↵

2

                    messageDigest = MessageDigest.getInstance(algorithm);↵

2

                ↵

3

        ↵

3

    return new URL(encodeURI(file.toURL().toString()));↵

4

            } catch (NoSuchAlgorithmException noalgo) {↵

4

            } catch (↵

5

        ↵

5

    UnsupportedEncodingException ex) {↵

6

                throw new BuildException(noalgo);↵

6

                throw new ↵

7

        ↵

7

    MalformedURLException(ex.toString());↵

8

            }

8

            }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 0
Number of refactorable cases | 0
Number of non-refactorable cases | 0
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.2
Clones location | Clones are in different classes
Number of node comparisons | 1