while (slowScanning) { try { slowScanLock.wait(); } catch (InterruptedException e) { // Empty } }
try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo, getLocation()); }
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/Checksum.java
Method name: void slowScan() Method name: boolean validateAndExecute()
Number of AST nodes: 3 Number of AST nodes: 2
1
while (slowScanning) {
2
                    try {
3
                        slowScanLock.wait();
4
       
1
try {
2
                messageDigest = MessageDigest.getInstance(algorithm);
5
             } catch (InterruptedException e) {
3
            } catch (NoSuchAlgorithmException noalgo) {
6
                        // Empty
4
                
7
                    }
8
    
5
throw new BuildException(noalgo, getLocation());
9
            }
6
            }
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