try { // compute the compiler options based on the input options first Pattern p = compiler.compile(pattern, getCompilerOptions(options)); return p; } catch (Exception e) { throw new BuildException(e); }
for (int i = 0; i < N2A_CLASSNAMES.length; i++) { try { return Class.forName(N2A_CLASSNAMES[i]); } catch (ClassNotFoundException cnfe) { // Ignore } }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/util/regexp/JakartaOroMatcher.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/native2ascii/KaffeNative2Ascii.java
Method name: Pattern getCompiledPattern(int) Method name: Class getN2aClass()
Number of AST nodes: 3 Number of AST nodes: 3
1
try {
2
            // compute the compiler options based on the input options first
3
            Pattern p = compiler.compile(pattern, getCompilerOptions(options));
4
            return p;
5
        } catch (
1
for (int i = 0; i < N2A_CLASSNAMES.length; i++) {
2
            try {
3
                return Class.forName(N2A_CLASSNAMES[i]);
6
Exception e) {
4
            } catch (ClassNotFoundException cnfe) {
7
            throw new BuildException(e);
5
                // Ignore
6
            }
8
        }
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