if (USE_PACKED_FIELDS) { if (packedVFields != null) { packedVFields.visit(visitor); return; } }
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) { if (internalKeyExist(entry, hash, key)) { return entry; } }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
Method name: void visit(Visitor) Method name: RubyHashEntry internalGetEntry(IRubyObject)
Number of AST nodes: 4 Number of AST nodes: 3
1
if (USE_PACKED_FIELDS) {
2
            if (packedVFields != null) {
3
                packedVFields.v
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
4
isit(visitor);
2
            if (internalKeyExist(entry, hash, key)) {
5
                return;
3
                return entry;
6
            }
4
            }
7
        }
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