Searched refs:oldCapacity (Results 1 – 8 of 8) sorted by relevance
218 static int expandedCapacity(int oldCapacity, int minCapacity) { in expandedCapacity() argument223 int newCapacity = oldCapacity + (oldCapacity >> 1) + 1; in expandedCapacity()
928 int oldCapacity = queue.length; in calculateNewCapacity() local929 int newCapacity = (oldCapacity < 64) in calculateNewCapacity()930 ? (oldCapacity + 1) * 2 in calculateNewCapacity()931 : IntMath.checkedMultiply(oldCapacity / 2, 3); in calculateNewCapacity()
2571 int oldCapacity = oldTable.length(); in expand() local2572 if (oldCapacity >= MAXIMUM_CAPACITY) { in expand()2587 AtomicReferenceArray<ReferenceEntry<K, V>> newTable = newEntryArray(oldCapacity << 1); in expand()2590 for (int oldIndex = 0; oldIndex < oldCapacity; ++oldIndex) { in expand()
247 int oldCapacity = m_capacity; in rehash() local250 int newCapacity = 2 * oldCapacity + 1; in rehash()255 for (int i = oldCapacity-1; i >=0 ; i--) in rehash()
90 int oldCapacity = elements.length; in ensureCapacity() local91 if (n>=oldCapacity) { in ensureCapacity()
251 int oldCapacity = fCapacity; in resize()258 for (int i = 0; i < oldCapacity; i++) { in resize()
171 int oldCapacity = fCapacity; in resize() local179 for (int i = 0; i < oldCapacity; i++) { in resize()
2901 int oldCapacity = oldTable.length(); in expand() local2902 if (oldCapacity >= MAXIMUM_CAPACITY) { in expand()2917 AtomicReferenceArray<ReferenceEntry<K, V>> newTable = newEntryArray(oldCapacity << 1); in expand()2920 for (int oldIndex = 0; oldIndex < oldCapacity; ++oldIndex) { in expand()