try { m.invoke(parent, new Object[] {Class.forName(value)}); } catch (ClassNotFoundException ce) { throw new BuildException(ce); }
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/IntrospectionHelper.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/native2ascii/KaffeNative2Ascii.java
Method name: void set(Project, Object, String) Method name: Class getN2aClass()
Number of AST nodes: 2 Number of AST nodes: 3
1
try {
1
for (int i = 0; i < N2A_CLASSNAMES.length; i++) {
2
        
2
            try {
3
                m.invoke(parent, new Object[] {Class.forName(value)});
3
                
4
        
4
return Class.forName(N2A_CLASSNAMES[i]);
5
            } catch (ClassNotFoundException ce) {
5
            } catch (ClassNotFoundException cnfe) {
6
                        throw new BuildException(ce);
6
                // Ignore
7
            
7
            }
8
        }
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