158-138-166

try { return new String(bytes, encoding); } catch (UnsupportedEncodingException uee) { throw new ZipException(uee.getMessage()); }
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/zip/ZipFile.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: `String getString(byte[])` |  | Method name: `void slowScan()`
Number of AST nodes: 2 |  | Number of AST nodes: 5

1

    try {↵

1

    if (slowScanning) {↵

2

                    return new String(bytes, encoding);↵

2

                    ↵

3

    while (slowScanning) {↵

4

                        try {↵

5

                            slowScanLock.wait();↵

3

                } catch (UnsupportedEncodingException uee) {↵

6

                        } catch (InterruptedException e) {↵

4

                    throw new ZipException(uee.getMessage())↵

7

                            // Empty↵

8

                        }↵

9

                    }↵

5

    ;↵

10

                    return;↵

6

                }

11

                }

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