int cOptions = getCompilerOptions(options); try { RE reg = new RE(pattern); reg.setMatchFlags(cOptions); return reg; } catch (RESyntaxException 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/JakartaRegexpMatcher.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Parallel.java
Method name: RE getCompiledPattern(int) Method name: void spinThreads()
Number of AST nodes: 5 Number of AST nodes: 5
1
int cOptions = getCompilerOptions(options);
2
        try {
3
            RE reg = new RE(pattern);
4
            reg.setMatchFlags(cOptions);
5
            return reg;
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 {
6
                            semaphore.wait();
6
        } catch (RESyntaxException e) {
7
                        } catch (InterruptedException ie) {
7
            throw new BuildException(e);
8
              
9
              // who would interrupt me at a time like this?
10
                        }
11
                        continue outer2;
12
                    }
8
        }
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