do { if (module.fastHasClassVariable(internedName)) { return context.getRuntime().getTrue(); } } while ((module = module.getSuperClass()) != null);
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/RubyModule.java File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java
Method name: IRubyObject class_variable_defined_p(ThreadContext, IRubyObject) Method name: boolean fastHashContains(String)
Number of AST nodes: 3 Number of AST nodes: 3
1
do {
2
            if (module.fastHasClassVariable
1
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {
3
(internedName)) {
2
            if (internedName == e.name) {
4
                return context.getRuntime().getTrue();
3
                return true;
5
            }
4
            }
6
        } while ((module = module.getSuperClass()) != null);
5
        }
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