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/DirectoryScanner.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/types/PatternSet.java
|
Method name: void slowScan()
|
|
Method name: void readPatterns(File, Vector, Project)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 0
|
|
1 | if (slowScanning) {↵ | | | |
2 | while (slowScanning) {↵ | | | |
3 | try {↵ | | | |
4 | slowScanLock.wait();↵ | | | |
5 | } catch (InterruptedException e) {↵ | | | |
6 | // Empty↵ | | | |
7 | }↵ | | | |
8 | }↵ | | | |
9 | return;↵ | | | |
10 | } | | | |
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.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 0 |