try {
messageDigest = MessageDigest.getInstance(algorithm);
} catch (NoSuchAlgorithmException noalgo) {
throw new BuildException(noalgo, getLocation());
}
while (!stopped && until > (now = System.currentTimeMillis())) {
try {
wait(until - now);
} catch (InterruptedException e) {
// Ignore exception
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Checksum.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/Watchdog.java
|
Method name: boolean validateAndExecute()
|
|
Method name: void run()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | try {↵ | | |
|
2 | messageDigest = MessageDigest.getInstance(algorithm↵ | | 1 | while (!stopped && until > (now = System.currentTimeMillis())) {↵
|
| | | 2 | try {↵
|
3 | );↵ | | 3 | wait(until - now);↵
|
4 | } catch (NoSuchAlgorithmException noalgo) {↵ | | 4 | } catch (InterruptedException e) {↵
|
5 | throw new BuildException(noalgo, getLocation());↵ | | 5 | ↵
|
| | | 6 | // Ignore exception↵
|
6 | ↵ | | 7 | }↵
|
7 | } | | 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 |