table[idx] = entry.next;
size -= 1;
return;
table[idx] = entry.next;
size -= 1;
return entry.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: 3
|
|
Number of AST nodes: 3
|
|
1 | table[idx] = entry.next;↵ | | 1 | table[idx] = entry.next;↵
|
2 | size -= 1;↵ | | 2 | size -= 1;↵
|
3 | return; | | 3 | return entry.getValue();
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
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 | 4 |
-
{Non-refactorable}
Mapping Summary
Number of mapped statements | 2 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 0.0 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
5 | table[idx] = entry.next; | | 6 | table[idx] = entry.next; |
6 | size -= 1; | | 7 | size -= 1; |
7 | return; | | | |
| | | 8 | return entry.getValue(); |
Precondition Violations (2)
Row |
Violation |
1 | Unmatched return; |
2 | Unmatched return entry.getValue(); |