158-133-159

try { setOutputStream(new PrintStream( new BufferedOutputStream( new FileOutputStream(output .getPath(), append)))); } catch (IOException e) { throw new BuildException(e, getLocation()); }
for (int i = 0; i < maxRunning; ++i) { if (running[i] != null && !running[i].isFinished()) { //System.out.println("Thread " + i + " is still alive "); // still running - wait for it try { semaphore.wait(); } catch (InterruptedException ie) { // who would interrupt me at a time like this? } continue outer2; } }

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/Parallel.java
Method name: `OutputStream getOutputStream()` |  | Method name: `void spinThreads()`
Number of AST nodes: 2 |  | Number of AST nodes: 5

1

    try {↵

2

                        setOutputStream(new PrintStream(↵

3

                    ↵

1

    for (int i = 0; i < maxRunning; ++i) {↵

2

                        if (running[i] != null && !running[i].isFinished()) {↵

4

                            new BufferedOutputStream(↵

3

                            ↵

5

                                                new FileOutputStream(output↵

4

    //System.out.println("Thread " + i + " is still alive ");↵

5

                            // still running - wait for it↵

6

                            try {↵

6

                                             ↵

7

                                semaphore.wait();↵

7

                            .getPath(),↵

8

                            ↵

8

                                         ↵

9

    } catch (InterruptedException ie) {↵

10

                                // who would interrupt me at a time like this?↵

9

                                append))));↵

11

                            ↵

10

                    } catch (IOException e) {↵

11

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

12

    }↵

13

                            continue outer2;↵

14

                        }↵

12

                    }

15

                    }

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 having the same super class
Number of node comparisons | 1