for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) { if (internalKeyExist(entry, hash, key)) { return entry; } }
if (testDir != null) { testFile.delete(); testDir.delete(); }
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/RubyHash.java File path: /jruby-1.4.0/test/org/jruby/util/ShellLauncherTest.java
Method name: RubyHashEntry internalGetEntry(IRubyObject) Method name: void tearDown()
Number of AST nodes: 3 Number of AST nodes: 3
1
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
2
            if (internalKeyExist(entry, hash, key)) {
3
                return entry;
4
            }
1
if (testDir != null) {
2
            testFile.delete();
3
            testDir.delete();
5
        }
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.1
Clones locationClones are in different classes
Number of node comparisons1