for (int i = 0; i < throwables.length; i++) { if (checkJavaException(currentThrowable, throwables[0])) { return context.getRuntime().getTrue(); } }
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) { if (internedName == e.name) { return true; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/javasupport/util/RuntimeHelpers.java File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java
Method name: IRubyObject isJavaExceptionHandled(Throwable, IRubyObject[], ThreadContext) Method name: boolean fastHashContains(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
for (int i = 0; i < throwables.length; i++) {
1
for (VariableTableEntry e = table[internedName.hashCode() & (table.length
2
                if (checkJavaException(currentThrowable, throwables[0])) {
3
                    return context.getRuntime().getTrue();
4
   
2
 - 1)]; e != null; e = e.next) {
3
            if (internedName == e.name) {
4
                return true;
5
             }
5
            }
6
            }
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