try { messageDigest = MessageDigest.getInstance(algorithm); } catch (NoSuchAlgorithmException noalgo) { throw new BuildException(noalgo); }
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/types/selectors/modifiedselector/DigestAlgorithm.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: void initMessageDigest() Method name: void slowScan()
Number of AST nodes: 2 Number of AST nodes: 5
1
try {
1
if (slowScanning) {
2
                messageDigest = MessageDigest.getInstance(algorithm
2
                while (slowScanning) {
3
                    try {
3
);
4
                        slowScanLock.wait();
4
            } catch (NoSuchAlgorithmException noalgo) {
5
                    } catch (InterruptedException e) {
5
                throw new BuildException(noalgo)
6
                        // Empty
7
                    }
8
                }
6
;
9
                return;
7
            }
10
            }
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