158-11-150

int cOptions = getCompilerOptions(options); try { RE reg = new RE(pattern); reg.setMatchFlags(cOptions); return reg; } catch (RESyntaxException e) { throw new BuildException(e); }
for (int i = 0; i < pathElements.length; ++i) { try { addPathElement(pathElements[i]); } catch (BuildException e) { // ignore path elements which are invalid // relative to the project } }

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/org/apache/tools/ant/AntClassLoader.java
Method name: `RE getCompiledPattern(int)` |  | Method name: `void setClassPath(Path)`
Number of AST nodes: 5 |  | Number of AST nodes: 3

1

    int cOptions = getCompilerOptions(options);↵

1

    for (int i = 0; i < pathElements.length; ++i) {↵

2

            try {↵

2

                    try {↵

3

                RE reg = new RE(pattern);↵

3

                ↵

4

                reg.setMatchFlags(cOptions);↵

4

            addPathElement(pathElements[i]);↵

5

                    } catch (BuildException e) {↵

5

                return reg;↵

6

                ↵

6

            } catch (RESyntaxException e) {↵

7

            // ignore path ↵

7

                throw new BuildException(e);↵

8

    elements which are invalid↵

9

                        // relative to the project↵

10

                    }↵

8

            }

11

                }

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