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; } }
if (null != usersFile) { try { userList.load(new FileInputStream(usersFile)); } catch (final IOException ioe) { throw new BuildException(ioe.toString(), ioe); } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Parallel.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/cvslib/ChangeLogTask.java
Method name: void spinThreads() Method name: void loadUserlist(Properties)
Number of AST nodes: 5 Number of AST nodes: 3
1
for (int i = 0; i < maxRunning; ++i) {
2
                    if (running[i] != null && !running[i].isFinished()) {
1
if (null != usersFile) {
3
                        //System.out.println("Thread " + i + " is still alive ");
2
            
4
                        // still running - wait for it
5
                        try {
6
                            semaphore.wait();
7
           
3
try {
4
                userList.load(new FileInputStream(usersFile));
8
             } catch (InterruptedException ie) {
5
            } catch (final IOException ioe) {
9
                            // who would interrupt me at a time like this?
6
                
10
                        }
11
                        continue outer2;
12
                    }
13
        
7
throw new BuildException(ioe.toString(), ioe);
8
            }
14
        }
9
        }
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.0
Clones locationClones are in different classes having the same super class
Number of node comparisons1