Searched refs:oldCap (Results 1 – 3 of 3) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 288 private void tryGrow(Object[] array, int oldCap) { in tryGrow() argument
294 int newCap = oldCap + ((oldCap < 64) ? in tryGrow()
295 (oldCap + 2) : // grow faster if small in tryGrow()
296 (oldCap >> 1)); in tryGrow()
298 int minCap = oldCap + 1; in tryGrow()
303 if (newCap > oldCap && queue == array) in tryGrow()
314 System.arraycopy(array, 0, newArray, 0, oldCap); in tryGrow()
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | HashMap.java | 678 int oldCap = (oldTab == null) ? 0 : oldTab.length; in resize() local
681 if (oldCap > 0) { in resize()
682 if (oldCap >= MAXIMUM_CAPACITY) { in resize()
686 else if ((newCap = oldCap << 1) < MAXIMUM_CAPACITY && in resize()
687 oldCap >= DEFAULT_INITIAL_CAPACITY) in resize()
706 for (int j = 0; j < oldCap; ++j) { in resize()
713 ((TreeNode<K,V>)e).split(this, newTab, j, oldCap); in resize()
720 if ((e.hash & oldCap) == 0) { in resize()
741 newTab[j + oldCap] = hiHead; in resize()
|
| /libcore/ojluni/annotations/hiddenapi/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 60 private void tryGrow(java.lang.Object[] array, int oldCap) { in tryGrow() argument
|