try { JUnitTest t = (JUnitTest) super.clone(); t.props = props == null ? null : (Properties) props.clone(); t.formatters = (Vector) formatters.clone(); return t; } catch (CloneNotSupportedException e) { // plain impossible return this; }
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/optional/junit/JUnitTest.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Parallel.java
Method name: Object clone() Method name: void spinThreads()
Number of AST nodes: 5 Number of AST nodes: 5
1
try {
2
            JUnitTest t = (JUnitTest) super.clone();
3
            t.props = props == null ? null : (Properties) props.clone(
1
for (int i = 0; i < maxRunning; ++i) {
2
                    if (running[i] != null && !running[i].isFinished()) {
4
);
3
                        //System.out.println("Thread " + i + " is still alive ");
5
            t.formatters = (Vector) formatters.clone
4
                        // still running - wait for it
5
                        try {
6
();
6
                            semaphore.wait();
7
            return t;
7
              
8
        } catch (CloneNotSupportedException e) {
8
          } catch (InterruptedException ie) {
9
            // plain impossible
9
                  
10
            return this;
10
          // who would interrupt me at a time like this?
11
                        }
12
                        continue outer2;
13
                    }
11
        }
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