if (MarshalStream.shouldBeRegistered(newObject)) {
cache.register(newObject);
}
for (VariableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {
if (internedName == e.name) {
return true;
}
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/runtime/marshal/UnmarshalStream.java
|
|
File path: /jruby-1.4.0/src/org/jruby/runtime/builtin/InstanceVariableTable.java
|
Method name: void registerLinkTarget(IRubyObject)
|
|
Method name: boolean fastHashContains(String)
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | if (MarshalStream.shouldBeRegistered(newObject)) {↵ | | 1 | for (Var↵
|
2 | cache.register(newObject);↵ | | 2 | iableTableEntry e = table[internedName.hashCode() & (table.length - 1)]; e != null; e = e.next) {↵
|
| | | 3 | if (internedName == e.name) {↵
|
| | | 4 | return true;↵
|
| | | 5 | }↵
|
3 | } | | 6 | }
|
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.1 |
Clones location | Clones are in different classes |
Number of node comparisons | 1 |