try {
in.mark(limit);
} catch (IOException ioe) {
throw new RuntimeException(ioe.getMessage());
}
while (scanning) {
try {
scanLock.wait();
} catch (InterruptedException e) {
continue;
}
}
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 scan()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
| | | 1 | while (scanning) {↵
|
1 | try {↵ | | 2 | try {↵
|
2 | in.mark(limit);↵ | | 3 | scanLock.wait();↵
|
3 | } catch (IOException ioe) {↵ | | 4 | } catch (InterruptedException e) {↵
|
4 | throw new RuntimeException(ioe.getMessage());↵ | | 5 | ↵
|
| | | 6 | continue;↵
|
| | | 7 | }↵
|
5 | } | | 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 |