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/runtime/load/LoadService.java
|
|
File path: /jruby-1.4.0/src/org/jruby/RubyHash.java
|
Method name: boolean lockAndRequire(String)
|
|
Method name: RubyHashEntry internalGetEntry(IRubyObject)
|
Number of AST nodes: 0
|
|
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 | }↵
|
| | | 5 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 0 |