158-27-48

try { m.invoke(parent, new Object[] {Class.forName(value)}); } catch (ClassNotFoundException ce) { throw new BuildException(ce); }
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/IntrospectionHelper.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/AntClassLoader.java
Method name: `void set(Project, Object, String)` |  | Method name: `void cleanup()`
Number of AST nodes: 2 |  | Number of AST nodes: 4

1

    try {↵

2

                            m.invoke(parent, new Object[] {Class.forName(value)});↵

3

             ↵

1

    for (Enumeration e = zipFiles.elements(); e.hasMoreElements();) {↵

2

                ZipFile zipFile = (ZipFile) e.nextElement();↵

3

                try {↵

4

                    zipFile.close();↵

4

               } catch (ClassNotFoundException ce) {↵

5

                } catch (IOException ioe) {↵

5

                            throw new BuildException(ce);↵

6

                    // ignore↵

6

                ↵

7

                }↵

7

            }

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.1
Clones location | Clones are in different classes
Number of node comparisons | 1