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 < 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/JakartaRegexpMatcher.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/native2ascii/KaffeNative2Ascii.java
Method name: RE getCompiledPattern(int) Method name: Class getN2aClass()
Number of AST nodes: 5 Number of AST nodes: 3
1
int cOptions = getCompilerOptions(options);
2
        try {
3
            RE reg = new RE(pattern
1
for (int i = 0; i < N2A_CLASSNAMES.length; i++) {
2
            try {
4
);
3
                return Class.forName(N2A_CLASSNAMES[i]);
5
            reg.setMatchFlags(cOptions);
4
            } catch (ClassNotFoundException cnfe) {
6
            return reg;
5
            
7
        } catch (RESyntaxException e) {
8
            throw new BuildException(e);
6
    // Ignore
7
            }
9
        }
8
        }
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