(Entry<K, V> entry)
| 659 | * Assumes that the entry is in the map. |
| 660 | */ |
| 661 | final void removeEntry(Entry<K, V> entry) { |
| 662 | int index = entry.origKeyHash & (elementData.length - 1); |
| 663 | Entry<K, V> m = elementData[index]; |
| 664 | if (m == entry) { |
| 665 | elementData[index] = entry.next; |
| 666 | } else { |
| 667 | while (m.next != entry) { |
| 668 | m = m.next; |
| 669 | } |
| 670 | m.next = entry.next; |
| 671 | |
| 672 | } |
| 673 | modCount++; |
| 674 | elementCount--; |
| 675 | } |
| 676 | |
| 677 | final Entry<K, V> removeEntry(Object key) { |
| 678 | int index = 0; |
no test coverage detected