158-132-145

try { setErrorStream(new PrintStream( new BufferedOutputStream( new FileOutputStream(error.getPath(), append)))); } catch (IOException e) { throw new BuildException(e, getLocation()); }
while (!stopped && until > (now = System.currentTimeMillis())) { try { wait(until - now); } catch (InterruptedException e) { // 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/util/Watchdog.java
Method name: `OutputStream getErrorStream()` |  | Method name: `void run()`
Number of AST nodes: 2 |  | Number of AST nodes: 3

1

    try {↵

2

                        setErrorStream(new PrintStream(↵

3

                                           new BufferedOutputStream(↵

4

                                               new FileOutputStream(error.getPath(),↵

5

                                                                    append))));↵

6

        ↵

1

    while (!stopped && until > (now = System.currentTimeMillis())) {↵

2

                try {↵

3

                    wait(until - now);↵

7

                } catch (IOException e) {↵

4

                } catch (InterruptedException e) {↵

8

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

5

                    ↵

6

    // Ignore exception↵

9

            ↵

7

                }↵

10

            }

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