if (ahead == ent) {
entry.next = ahead.next;
size -= 1;
return;
}
if (ahead.sameKey(hash, key)) {
entry.next = ahead.next;
size -= 1;
return ahead.getValue();
}
Clone fragments detected by clone detection tool
File path: /jruby-1.4.0/src/org/jruby/util/WeakIdentityHashMap.java
|
|
File path: /jruby-1.4.0/src/org/jruby/util/WeakIdentityHashMap.java
|
Method name: void removeEntry(Entry)
|
|
Method name: Object remove(int, Object)
|
Number of AST nodes: 4
|
|
Number of AST nodes: 4
|
|
1 | if (ahead == ent) {↵ | | 1 | if (ahead.sameKey(hash, key)) {↵
|
2 | entry.next = ahead.next;↵ | | 2 | entry.next = ahead.next;↵
|
3 | size -= 1;↵ | | 3 | size -= 1;↵
|
4 | return;↵ | | 4 | return ahead.getValue();↵
|
5 | } | | 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 declared in the same class |
Number of node comparisons | 1 |