for (int i = 0; i < N2A_CLASSNAMES.length; i++) { try { return Class.forName(N2A_CLASSNAMES[i]); } catch (ClassNotFoundException cnfe) { // Ignore } }
try { setExtraFields(ExtraFieldUtils.parse(extra)); } catch (Exception e) { throw new RuntimeException(e.getMessage()); }
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/native2ascii/KaffeNative2Ascii.java File path: /apache-ant-1.7.0/src/org/apache/tools/zip/ZipEntry.java
Method name: Class getN2aClass() Method name: void setExtra(byte[])
Number of AST nodes: 3 Number of AST nodes: 2
1
for (int i = 0; i < N2A_CLASSNAMES.length; i++) {
2
            try {
1
try {
3
                return Class.forName(N2A_CLASSNAMES[i]);
2
            setExtraFields(ExtraFieldUtils.parse(extra));
4
            } catch (ClassNotFoundException cnfe) {
3
        } catch (Exception e) {
5
                // Ignore
4
            
6
            }
5
throw new RuntimeException(e.getMessage());
7
        }
6
        }
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