158-133-153

try { setOutputStream(new PrintStream( new BufferedOutputStream( new FileOutputStream(output .getPath(), append)))); } catch (IOException e) { throw new BuildException(e, getLocation()); }
for (int i = 0; i < thread.length && thread[i] != null; i++) { try { managingTask.log(thread[i].toString(), Project.MSG_DEBUG); } catch (NullPointerException enPeaEx) { // Ignore exception } }

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/AbstractCvsTask.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Redirector.java
Method name: `OutputStream getOutputStream()` |  | Method name: `void complete()`
Number of AST nodes: 2 |  | Number of AST nodes: 3

1

    try {↵

2

                        setOutputStream(new PrintStream(↵

3

                                            new BufferedOutputStream(↵

4

                                                new FileOutputStream(output↵

5

                                                                     .getPath(),↵

6

                                                                     append))));↵

7

                    } catch (IOE↵

1

    for (int i = 0; i < thread.length && thread[i] != null; i++) {↵

2

                        try {↵

3

                            managingTask.log(thread[i].toString(), Project.MSG_DEBUG);↵

4

                        } catch (NullPointerException enPeaEx) {↵

8

    xception e) {↵

5

                            // Ignore exception↵

9

                        throw new BuildException(e, getLocation());↵

6

                        }↵

10

                    }

7

                    }

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