synchronized (internalFinalizersMutex) { if (internalFinalizers != null) { internalFinalizers.remove(finalizer); } }
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/Ruby.java File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
Method name: void removeInternalFinalizer(Finalizable) Method name: RubyHashEntry internalGetEntry(IRubyObject)
Number of AST nodes: 3 Number of AST nodes: 3
1
synchronized (internalFinalizersMutex) {
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
2
            if (internalFinalizers != null) {
2
            if (internal
3
                internalFinalizers.remove(finalizer)
3
KeyExist(entry, hash, key)) {
4
;
4
                return entry;
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