(Entry<K, V> entry)
| 674 | * Assumes that the entry is in the map. |
| 675 | */ |
| 676 | final void removeEntry(Entry<K, V> entry) { |
| 677 | int index = entry.origKeyHash & (elementData.length - 1); |
| 678 | Entry<K, V> m = elementData[index]; |
| 679 | if (m == entry) { |
| 680 | elementData[index] = entry.next; |
| 681 | } else { |
| 682 | while (m.next != entry) { |
| 683 | m = m.next; |
| 684 | } |
| 685 | m.next = entry.next; |
| 686 | |
| 687 | } |
| 688 | modCount++; |
| 689 | elementCount--; |
| 690 | } |
| 691 | |
| 692 | final Entry<K, V> removeEntry(Object key) { |
| 693 | int index = 0; |
no test coverage detected