158-132-166

try { setErrorStream(new PrintStream( new BufferedOutputStream( new FileOutputStream(error.getPath(), append)))); } catch (IOException e) { throw new BuildException(e, getLocation()); }
if (slowScanning) { while (slowScanning) { try { slowScanLock.wait(); } catch (InterruptedException e) { // Empty } } return; }

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

1

    try {↵

1

    if (slowScanning) {↵

2

                        setErrorStream(new PrintStream(↵

2

                    ↵

3

                                           new BufferedOutputStream(↵

4

                                               new FileOutputStream(error.getPath↵

3

    while (slowScanning) {↵

4

                        try {↵

5

    (),↵

5

                            slowScanLock.wait();↵

6

                           ↵

6

                        } catch (InterruptedException e) {↵

7

                               ↵

7

                            // Empty↵

8

                  append))));↵

8

                  ↵

9

          ↵

9

          }↵

10

              } catch (IOException e) {↵

10

              ↵

11

        ↵

11

          }↵

12

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

12

                    ↵

13

        ↵

13

    return;↵

14

                }

14

                }

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