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; } }
try { return System.getProperty(USE_SYSTEM_PROXIES); } catch (SecurityException e) { //if you cannot read it, you won't be able to write it either return null; }
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/util/ProxySetup.java
Method name: void spinThreads() Method name: String getSystemProxySetting()
Number of AST nodes: 5 Number of AST nodes: 2
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 (Interrupted
1
try {
2
            return System.getProperty(USE_SYSTEM_PROXIES);
8
Exception ie) {
3
        } catch (SecurityException e) {
9
                            // who would interrupt me at a time like this?
4
            //if you cannot read it, you won't be a
10
                        }
11
                        continue outer2;
12
                    }
13
        
5
ble to write it either
6
            return null;
14
        }
7
        }
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