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); }
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/JakartaOroMatcher.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: 3 Number of AST nodes: 5
1
try {
2
            // compute the compiler options based on the input options first
3
            Pattern p = compiler.compile(pattern, getCompilerOptions(options)
1
if (slowScanning) {
2
                while (slowScanning) {
3
                    try {
4
);
4
                        slowScanLock.wait();
5
            return p;
5
            
6
        } catch (Exception e) {
6
        } catch (InterruptedException e) {
7
            throw new BuildException(e);
7
                      
8
  // Empty
9
                    }
10
                }
11
                return;
8
        }
12
            }
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