try {
// compute the compiler options based on the input options first
Pattern p = compiler.compile(pattern, getCompilerOptions(options));
return p;
} catch (Exception e) {
throw new BuildException(e);
}
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/regexp/JakartaOroMatcher.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: Pattern getCompiledPattern(int)
|
|
Method name: void scan()
|
Number of AST nodes: 3
|
|
Number of AST nodes: 3
|
|
1 | try {↵ | | |
|
2 | // compute the compiler options based on the input options first↵ | | |
|
3 | Pattern p = compiler.compile(pattern, getCompilerOptions(options)↵ | | 1 | while (scanning) {↵
|
| | | 2 | try {↵
|
4 | );↵ | | 3 | scanLock.wait();↵
|
5 | return p;↵ | | 4 | ↵
|
6 | } catch (Exception e) {↵ | | 5 | } catch (InterruptedException e) {↵
|
7 | throw new BuildException(e);↵ | | 6 | ↵
|
| | | 7 | continue;↵
|
| | | 8 | }↵
|
8 | } | | 9 | }
|
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 |