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/taskdefs/Parallel.java
|
|
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/listener/MailLogger.java
|
Method name: void spinThreads()
|
|
Method name: void buildFinished(BuildEvent)
|
Number of AST nodes: 5
|
|
Number of AST nodes: 0
|
|
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();↵ | | | |
7 | } catch (InterruptedException ie) {↵ | | | |
8 | // who would interrupt me at a time like this?↵ | | | |
9 | }↵ | | | |
10 | continue outer2;↵ | | | |
11 | }↵ | | | |
12 | } | | | |
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 0 |