Searched refs:newCap (Results 1 – 3 of 3) sorted by relevance
226 int newCap = cap + (cap >> 1) + 1; in finishToArray() local228 if (newCap - MAX_ARRAY_SIZE > 0) in finishToArray()229 newCap = hugeCapacity(cap + 1); in finishToArray()230 r = Arrays.copyOf(r, newCap); in finishToArray()
680 int newCap, newThr = 0; in resize() local686 else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY && in resize()691 newCap = oldThr; in resize()693 newCap = DEFAULT_INITIAL_CAPACITY; in resize()697 float ft = (float)newCap * loadFactor; in resize()698 newThr = (newCap < MAXIMUM_CAPACITY && ft < (float)MAXIMUM_CAPACITY ? in resize()703 Node<K,V>[] newTab = (Node<K,V>[])new Node[newCap]; in resize()711 newTab[e.hash & (newCap - 1)] = e; in resize()
294 int newCap = oldCap + ((oldCap < 64) ? in tryGrow() local297 if (newCap - MAX_ARRAY_SIZE > 0) { // possible overflow in tryGrow()301 newCap = MAX_ARRAY_SIZE; in tryGrow()303 if (newCap > oldCap && queue == array) in tryGrow()304 newArray = new Object[newCap]; in tryGrow()