158-43-152

while (scanning) { try { scanLock.wait(); } catch (InterruptedException e) { continue; } }
for (int i = 0; i < RMIC_CLASSNAMES.length; i++) { try { return Class.forName(RMIC_CLASSNAMES[i]); } catch (ClassNotFoundException cnfe) { // Ignore } }

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/rmic/KaffeRmic.java
Method name: `void scan()` |  | Method name: `Class getRmicClass()`
Number of AST nodes: 3 |  | Number of AST nodes: 3

1

    while (scanning) {↵

2

                        try {↵

3

                            scanLock.wait(↵

1

    for (int i = 0; i < RMIC_CLASSNAMES.length; i++) {↵

2

                try {↵

4

    );↵

3

                    return Class.forName(RMIC_CLASSNAMES[i]);↵

5

                        } catch (InterruptedException e) {↵

4

                } catch (ClassNotFoundException cnfe) {↵

6

                            continue;↵

5

                    ↵

7

                        }↵

8

            ↵

6

    // Ignore↵

7

                }↵

9

            }

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