synchronized(this) { return globalState; }
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: long getGlobalState() Method name: RubyHashEntry internalGetEntry(IRubyObject)
Number of AST nodes: 2 Number of AST nodes: 3
1
synchronized(this) {
2
            return globalState;
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
2
            if (internalKeyExist(entry, hash, key)) {
3
                return entry;
4
            }
3
        }
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