(int capacity)
| 613 | } |
| 614 | |
| 615 | void rehash(int capacity) { |
| 616 | int length = calculateCapacity((capacity == 0 ? 1 : capacity << 1)); |
| 617 | |
| 618 | Entry<K, V>[] newData = newElementArray(length); |
| 619 | for (int i = 0; i < elementData.length; i++) { |
| 620 | Entry<K, V> entry = elementData[i]; |
| 621 | elementData[i] = null; |
| 622 | while (entry != null) { |
| 623 | int index = entry.origKeyHash & (length - 1); |
| 624 | Entry<K, V> next = entry.next; |
| 625 | entry.next = newData[index]; |
| 626 | newData[index] = entry; |
| 627 | entry = next; |
| 628 | } |
| 629 | } |
| 630 | elementData = newData; |
| 631 | computeThreshold(); |
| 632 | } |
| 633 | |
| 634 | void rehash() { |
| 635 | rehash(elementData.length); |
no test coverage detected