int cOptions = getCompilerOptions(options);
try {
Pattern p = Pattern.compile(this.pattern, cOptions);
return p;
} catch (PatternSyntaxException e) {
throw new BuildException(e);
}
while (slowScanning) {
try {
slowScanLock.wait();
} catch (InterruptedException e) {
// Empty
}
}
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/Jdk14RegexpMatcher.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
|
Method name: Pattern getCompiledPattern(int)
|
|
Method name: void slowScan()
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | int cOptions = getCompilerOptions(options);↵ | | |
|
| | | 1 | while (slowScanning) {↵
|
2 | try {↵ | | 2 | try {↵
|
3 | Pattern p = Pattern.compile(this.pattern, cOptions);↵ | | 3 | slowScanLock.wait();↵
|
4 | return p;↵ | | 4 | ↵
|
5 | } catch (PatternSyntaxException e) {↵ | | 5 | } catch (InterruptedException e) {↵
|
6 | throw new BuildException(e);↵ | | 6 | ↵
|
| | | 7 | // Empty↵
|
| | | 8 | }↵
|
7 | } | | 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 |