(int capacity)
| 630 | } |
| 631 | |
| 632 | void rehash(int capacity) { |
| 633 | int length = calculateCapacity((capacity == 0 ? 1 : capacity << 1)); |
| 634 | |
| 635 | Entry<K, V>[] newData = newElementArray(length); |
| 636 | for (int i = 0; i < elementData.length; i++) { |
| 637 | Entry<K, V> entry = elementData[i]; |
| 638 | elementData[i] = null; |
| 639 | while (entry != null) { |
| 640 | int index = entry.origKeyHash & (length - 1); |
| 641 | Entry<K, V> next = entry.next; |
| 642 | entry.next = newData[index]; |
| 643 | newData[index] = entry; |
| 644 | entry = next; |
| 645 | } |
| 646 | } |
| 647 | elementData = newData; |
| 648 | computeThreshold(); |
| 649 | } |
| 650 | |
| 651 | void rehash() { |
| 652 | rehash(elementData.length); |
no test coverage detected