for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) { if (internalKeyExist(entry, hash, key)) { return entry; } }
if (equalInternal(context, obj, value)) { throw new FoundPair(key, value); }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyHash.java File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
Method name: RubyHashEntry internalGetEntry(IRubyObject) Method name: void visit(IRubyObject, IRubyObject)
Number of AST nodes: 3 Number of AST nodes: 2
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
2
            if (internalKeyExist(entry, hash, key)) {
3
                return entry
1
if (equalInternal(context, obj, value)) {
4
;
2
                        throw new FoundPair(key, value);
5
            }
3
            
6
        }
4
        }
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.2
Clones locationClones are in the same java file
Number of node comparisons1