158-11-196

int cOptions = getCompilerOptions(options); try { RE reg = new RE(pattern); reg.setMatchFlags(cOptions); return reg; } catch (RESyntaxException e) { throw new BuildException(e); }
if (out != null) { try { out.flush(); out.close(); out = null; } catch (IOException e) { // ignore } }

Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/JakartaRegexpMatcher.java |  | File path: /apache-ant-1.7.0/src/tests/junit/org/apache/tools/mail/MailMessageTest.java
Method name: `RE getCompiledPattern(int)` |  | Method name: `void disconnect()`
Number of AST nodes: 5 |  | Number of AST nodes: 5

1

    int cOptions = getCompilerOptions(options);↵

1

    i↵

2

    f (out != null) {↵

2

            try {↵

3

                    try {↵

3

                RE reg = new RE(pattern);↵

4

                  ↵

4

                reg.setMatchFlags(cOptions);↵

5

                return reg;↵

5

          out.flush();↵

6

                        out.close();↵

7

                        out = null;↵

6

            } catch (RESyntaxException e) {↵

8

                    } catch (IOException e) {↵

7

                throw new BuildException(e);↵

9

                ↵

10

            // ignore↵

11

                    }↵

8

            }

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