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); }
for (int i = 0; i < maxRunning; ++i) { if (running[i] != null && !running[i].isFinished()) { //System.out.println("Thread " + i + " is still alive "); // still running - wait for it try { semaphore.wait(); } catch (InterruptedException ie) { // who would interrupt me at a time like this? } continue outer2; } }
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/taskdefs/Parallel.java
Method name: Pattern getCompiledPattern(int) Method name: void spinThreads()
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
for (int i = 0; i < maxRunning; ++i) {
2
                    if (running[i] != null && !running[i].isFinished()) {
3
                        //System.out.println("Thread " + i + " is still alive ");
4
                        // still running - wait for it
5
                        try {
4
);
6
                            semaphore.wait();
5
            return p;
7
            
6
        } catch (Exception e) {
8
            } catch (InterruptedException ie) {
7
            throw new BuildException(e);
9
            
10
                // who would interrupt me at a time like this?
11
                        }
12
                        continue outer2;
13
                    }
8
        }
14
                }
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