if (!block.yield(ctx, larg).isTrue()) { synchronized (result) { result.append(larg); } }
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/RubyEnumerable.java File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
Method name: IRubyObject call(ThreadContext, IRubyObject[], Block) Method name: RubyHashEntry internalGetEntry(IRubyObject)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (!block.yield(ctx, larg).isTrue()) {
2
                    synchronized (result) {
3
                        result.append(larg);
4
                    }
5
        
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
2
            if (internalKeyExist(entry, hash, key)) {
3
                return entry;
4
            }
6
        }
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.0
Clones locationClones are in different classes
Number of node comparisons1