if (object != null) { synchronized (object) { object.notify(); } }
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/RubyThread.java File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
Method name: void interrupt() Method name: RubyHashEntry internalGetEntry(IRubyObject)
Number of AST nodes: 3 Number of AST nodes: 3
1
if (object != null) {
2
            synchronized (object
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
3
) {
2
            if (internalKeyExist(entry, hash, key)) {
4
                object.notify();
3
                return entry;
5
            }
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 having the same super class
Number of node comparisons1