(Object key, int index, int keyHash)
| 476 | } |
| 477 | |
| 478 | final Entry<K,V> findNonNullKeyEntry(Object key, int index, int keyHash) { |
| 479 | Entry<K,V> m = elementData[index]; |
| 480 | while (m != null |
| 481 | && (m.origKeyHash != keyHash || !areEqualKeys(key, m.key))) { |
| 482 | m = m.next; |
| 483 | } |
| 484 | return m; |
| 485 | } |
| 486 | |
| 487 | final Entry<K,V> findNullKeyEntry() { |
| 488 | Entry<K,V> m = elementData[0]; |
no test coverage detected