(int newSize)
| 183 | } |
| 184 | |
| 185 | private void resize(int newSize) { |
| 186 | threshold = (int)(newSize * loadFactor); |
| 187 | int m = newSize - 1; |
| 188 | shift = (byte)Long.numberOfLeadingZeros(m); |
| 189 | long[] kt = new long[newSize]; |
| 190 | if (size != 0) { |
| 191 | for (long k : keyTable) { |
| 192 | if (k != 0) { |
| 193 | for (int i = hash(k); ; i = (i + 1) & m) { |
| 194 | if (kt[i] == 0) { |
| 195 | kt[i] = k; |
| 196 | break; |
| 197 | } |
| 198 | } |
| 199 | } |
| 200 | } |
| 201 | } |
| 202 | keyTable = kt; |
| 203 | } |
| 204 | |
| 205 | public void foreach(@NotNull LongConsumer consumer) { |
| 206 | if (hasZeroKey) |
no test coverage detected