if (slowScanning) { while (slowScanning) { try { slowScanLock.wait(); } catch (InterruptedException e) { // Empty } } return; }
try { return (Node) elementAt(i); } catch (ArrayIndexOutOfBoundsException e) { return null; // conforming to NodeList interface }
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/optional/junit/DOMUtil.java
Method name: void slowScan() Method name: Node item(int)
Number of AST nodes: 5 Number of AST nodes: 2
1
if (slowScanning) {
1
try {
2
                while (slowScanning) {
2
                
3
                    try {
4
                        slowScanLock.wait();
3
return (Node) elementAt(i);
5
                    } catch (InterruptedException e) {
4
            } catch (ArrayIndexOutOfBoundsException e) {
6
                        // Empty
5
                
7
                    }
8
                }
9
                return;
6
return null; // conforming to NodeList interface
10
            }
7
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1