int cOptions = getCompilerOptions(options); try { RE reg = new RE(pattern); reg.setMatchFlags(cOptions); return reg; } catch (RESyntaxException e) { throw new BuildException(e); }
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/regexp/JakartaRegexpMatcher.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/DirectoryScanner.java
Method name: RE getCompiledPattern(int) Method name: void slowScan()
Number of AST nodes: 5 Number of AST nodes: 5
1
int cOptions = getCompilerOptions(options);
1
i
2
        try {
3
            RE reg = new RE(pattern);
4
            reg.setMatchFlags(cOptions
2
f (slowScanning) {
3
                while (slowScanning) {
4
                    try {
5
);
5
                        slowScanLock.wait();
6
            return reg;
6
            
7
        } catch (RESyntaxException e) {
7
        } catch (InterruptedException e) {
8
            throw new BuildException(e);
8
            
9
            // Empty
10
                    }
11
                }
12
                return;
9
        }
13
            }
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.1
Clones locationClones are in different classes
Number of node comparisons1