(Entry<K, V> entry)
| 643 | * Assumes that the entry is in the map. |
| 644 | */ |
| 645 | final void removeEntry(Entry<K, V> entry) { |
| 646 | int index = entry.origKeyHash & (elementData.length - 1); |
| 647 | Entry<K, V> m = elementData[index]; |
| 648 | if (m == entry) { |
| 649 | elementData[index] = entry.next; |
| 650 | } else { |
| 651 | while (m.next != entry) { |
| 652 | m = m.next; |
| 653 | } |
| 654 | m.next = entry.next; |
| 655 | |
| 656 | } |
| 657 | modCount++; |
| 658 | elementCount--; |
| 659 | } |
| 660 | |
| 661 | final Entry<K, V> removeEntry(Object key) { |
| 662 | int index = 0; |
no test coverage detected