private int removeNullEntry() { containsNullKey = false; key[n] = null; final int oldValue = value[n]; size--; fixPointers(n); if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE) rehash(n / 2); return oldValue; } @Override
private void tryCapacity(final long capacity) { final int needed = (int) Math.min(1 << 30, Math.max(2, HashCommon.nextPowerOfTwo((long) Math.ceil(capacity / f)))); if (needed > n) rehash(needed); } private int removeEntry(final int pos) {
private void ensureCapacity(final int capacity) { final int needed = arraySize(capacity, f); if (needed > n) rehash(needed); } private void tryCapacity(final long capacity) {
private void insert(final int pos, final K k, final int v) { if (pos == n) containsNullKey = true; key[pos] = k; value[pos] = v; if (size == 0) { first = last = pos; // Special case of SET_UPPER_LOWER(link[pos], -1, -1); link[pos] = -1L; } else { link[last] ^= ((link[last] ^ (pos & 0xFFFFFFFFL)) & 0xFFFFFFFFL); link[pos] = ((last & 0xFFFFFFFFL) << 32) | (-1 & 0xFFFFFFFFL); last = pos; } if (size++ >= maxFill) rehash(arraySize(size + 1, f)); if (ASSERTS) checkTable(); } @Override
/** * Removes the mapping associated with the last key in iteration order. * * @return the value previously associated with the last key in iteration order. * @throws NoSuchElementException * is this map is empty. */ public int removeLastInt() { if (size == 0) throw new NoSuchElementException(); final int pos = last; // Abbreviated version of fixPointers(pos) last = (int) (link[pos] >>> 32); if (0 <= last) { // Special case of SET_NEXT(link[last], -1) link[last] |= -1 & 0xFFFFFFFFL; } size--; final int v = value[pos]; if (pos == n) { containsNullKey = false; key[n] = null; } else shiftKeys(pos); if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE) rehash(n / 2); return v; } private void moveIndexToFirst(final int i) {
/** * Removes the mapping associated with the first key in iteration order. * * @return the value previously associated with the first key in iteration * order. * @throws NoSuchElementException * is this map is empty. */ public int removeFirstInt() { if (size == 0) throw new NoSuchElementException(); final int pos = first; // Abbreviated version of fixPointers(pos) first = (int) link[pos]; if (0 <= first) { // Special case of SET_PREV(link[first], -1) link[first] |= (-1 & 0xFFFFFFFFL) << 32; } size--; final int v = value[pos]; if (pos == n) { containsNullKey = false; key[n] = null; } else shiftKeys(pos); if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE) rehash(n / 2); return v; } /**
private int removeEntry(final int pos) { final int oldValue = value[pos]; size--; fixPointers(pos); shiftKeys(pos); if (n > minN && size < maxFill / 4 && n > DEFAULT_INITIAL_SIZE) rehash(n / 2); return oldValue; } private int removeNullEntry() {
/** * Rehashes the map, making the table as small as possible. * * <p> * This method rehashes the table to the smallest size satisfying the load * factor. It can be used when the set will not be changed anymore, so to * optimize access speed and size. * * <p> * If the table size is already the minimum possible, this method does nothing. * * @return true if there was enough memory to trim the map. * @see #trim(int) */ public boolean trim() { final int l = arraySize(size, f); if (l >= n || size > maxFill(l, f)) return true; try { rehash(l); } catch (OutOfMemoryError cantDoIt) { return false; } return true; } /**
return true; try { rehash(l); } catch (OutOfMemoryError cantDoIt) { return false;
rehash(arraySize(size + 1, f)); if (ASSERTS) checkTable();
rehash(arraySize(size, f)); if (ASSERTS) checkTable();
rehash(arraySize(size, f)); if (ASSERTS) checkTable();