158-68-159

if (ssock != null) { try { ssock.close(); ssock = null; } catch (IOException e) { // ignore } }
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/tests/junit/org/apache/tools/mail/MailMessageTest.java |  | File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/Parallel.java
Method name: `void disconnect()` |  | Method name: `void spinThreads()`
Number of AST nodes: 4 |  | Number of AST nodes: 5

1

    if (ssock != null) {↵

2

                    try {↵

3

                        ssock.close();↵

4

                        ssock = null;↵

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();↵

5

                    } catch (IOException e) {↵

7

                            } catch (InterruptedException ie) {↵

6

                        // ignore↵

8

                        ↵

7

                    }↵

9

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

10

                            }↵

11

                            continue outer2;↵

12

                        }↵

8

                }

13

                    }

See real code fragment |  | See real code fragment

Summary
Number of common nesting structure subtrees | 1
Number of refactorable cases | 0
Number of non-refactorable cases | 1
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.3
Clones location | Clones are in different classes
Number of node comparisons | 7

1. {Non-refactorable}

   Mapping Summary
   Number of mapped statements | 1
   Number of unmapped statements in the first code fragment | 2
   Number of unmapped statements in the second code fragment | 1
   Time elapsed for statement mapping (ms) | 0.5
   Clone type | Type 3

   Mapped Statements
   ID | Statement |  | ID | Statement
   --- | --- | --- | --- | ---

   15

       try

   15 | try
   43 | try

   Differences
   Expression1 | Expression2 | Difference
   --- | --- | ---
   java.io.IOException | java.lang.InterruptedException | SUBCLASS_TYPE_MISMATCH
   e | ie | VARIABLE_NAME_MISMATCH
   java.io.IOException | java.lang.InterruptedException | SUBCLASS_TYPE_MISMATCH

   43

       try

   16

       ssock.close();

   16 | ssock.close();

   Preondition Violations
   Unmatched statement ssock.close(); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted

   17

       ssock = null;

   44 | semaphore.wait();

   Preondition Violations
   Unmatched statement semaphore.wait(); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted

   44

       semaphore.wait();

   Precondition Violations (2)
   Row | Violation
   --- | ---
   1 | Unmatched statement ssock.close(); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted
   2 | Unmatched statement semaphore.wait(); cannot be moved before or after the extracted code, because it throws exception(s) that should be caught by a try block that will be extracted