Searched refs:oldCap (Results 1 – 4 of 4) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 290 private void tryGrow(Object[] array, int oldCap) { in tryGrow() argument
296 int growth = (oldCap < 64) in tryGrow()
297 ? (oldCap + 2) // grow faster if small in tryGrow()
298 : (oldCap >> 1); in tryGrow()
299 int newCap = ArraysSupport.newLength(oldCap, 1, growth); in tryGrow()
311 System.arraycopy(array, 0, newArray, 0, oldCap); in tryGrow()
|
| D | ForkJoinPool.java | 1012 int s = top - 1, oldCap, newCap;
1013 if (oldArray != null && (oldCap = oldArray.length) > 0 &&
1014 (newCap = oldCap << 1) > 0) { // skip if disabled
1024 int newMask = newCap - 1, oldMask = oldCap - 1;
1025 for (int k = oldCap; k > 0; --k, --s) {
|
| /libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 60 private void tryGrow(java.lang.Object[] array, int oldCap) { in tryGrow() argument
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | HashMap.java | 684 int oldCap = (oldTab == null) ? 0 : oldTab.length; in resize() local
687 if (oldCap > 0) { in resize()
688 if (oldCap >= MAXIMUM_CAPACITY) { in resize()
692 else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY && in resize()
693 oldCap >= DEFAULT_INITIAL_CAPACITY) in resize()
712 for (int j = 0; j < oldCap; ++j) { in resize()
719 ((TreeNode<K,V>)e).split(this, newTab, j, oldCap); in resize()
726 if ((e.hash & oldCap) == 0) { in resize()
747 newTab[j + oldCap] = hiHead; in resize()
|