try {
in.mark(limit);
} catch (IOException ioe) {
throw new RuntimeException(ioe.getMessage());
}
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/util/ReaderInputStream.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: void mark(int)
|
|
Method name: void slowScan()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 5
|
|
1 | try {↵ | | |
|
2 | in.mark(lim↵ | | 1 | if (slowScanning) {↵
|
| | | 2 | while (slowScanning) {↵
|
| | | 3 | try {↵
|
3 | it);↵ | | 4 | slowScanLock.wait();↵
|
4 | } catch (IOException ioe) {↵ | | 5 | } catch (InterruptedException e) {↵
|
5 | throw new RuntimeException(ioe.getMessage());↵ | | 6 | ↵
|
| | | 7 | // Empty↵
|
| | | 8 | }↵
|
| | | 9 | }↵
|
| | | 10 | return;↵
|
6 | } | | 11 | }
|
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 |