158-6-159

try { EnumeratedAttribute ea = (EnumeratedAttribute) reflectedArg.newInstance(); ea.setValue(value); m.invoke(parent, new Object[] {ea}); } catch (InstantiationException ie) { throw new BuildException(ie); }
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/IntrospectionHelper.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Parallel.java
Method name: `void set(Project, Object, String)` |  | Method name: `void spinThreads()`
Number of AST nodes: 4 |  | Number of AST nodes: 5

1

    try {↵

2

                            EnumeratedAttribute ea =↵

3

                                (EnumeratedAttribute) reflectedArg.newInstance();↵

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↵

4

                            ea.setValue(value);↵

5

                            try {↵

5

                            m.invoke(parent, new Object[] {ea});↵

6

                            ↵

7

        semaphore.wait();↵

6

                        } catch (InstantiationException ie) {↵

8

                            } catch (InterruptedException ie) {↵

7

                            throw new BuildException(ie)↵

9

                                // who would interrupt me at a time like this?↵

10

                            }↵

8

    ;↵

11

                            continue outer2;↵

9

                        }

12

                        }↵

13

                    }

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.1
Clones location | Clones are in different classes
Number of node comparisons | 1