Searched refs:minCapacity (Results 1 - 8 of 8) sorted by relevance

/libcore/ojluni/src/main/java/java/io/
H A DByteArrayOutputStream.java85 * @param minCapacity the desired minimum capacity
86 * @throws OutOfMemoryError if {@code minCapacity < 0}. This is
88 * {@code (long) Integer.MAX_VALUE + (minCapacity - Integer.MAX_VALUE)}.
90 private void ensureCapacity(int minCapacity) { argument
92 if (minCapacity - buf.length > 0)
93 grow(minCapacity);
100 * @param minCapacity the desired minimum capacity
102 private void grow(int minCapacity) { argument
106 if (newCapacity - minCapacity < 0)
107 newCapacity = minCapacity;
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DVector.java217 * {@code minCapacity}, then its capacity is increased by replacing its
223 * is still smaller than {@code minCapacity}, then the new capacity will
224 * be {@code minCapacity}.
226 * @param minCapacity the desired minimum capacity
228 public synchronized void ensureCapacity(int minCapacity) { argument
229 if (minCapacity > 0) {
231 ensureCapacityHelper(minCapacity);
243 private void ensureCapacityHelper(int minCapacity) { argument
245 if (minCapacity - elementData.length > 0)
246 grow(minCapacity);
257 grow(int minCapacity) argument
269 hugeCapacity(int minCapacity) argument
[all...]
H A DAbstractCollection.java236 private static int hugeCapacity(int minCapacity) { argument
237 if (minCapacity < 0) // overflow
240 return (minCapacity > MAX_ARRAY_SIZE) ?
H A DArrayList.java195 * @param minCapacity the desired minimum capacity
197 public void ensureCapacity(int minCapacity) { argument
205 if (minCapacity > minExpand) {
206 ensureExplicitCapacity(minCapacity);
210 private void ensureCapacityInternal(int minCapacity) { argument
212 minCapacity = Math.max(DEFAULT_CAPACITY, minCapacity);
215 ensureExplicitCapacity(minCapacity);
218 private void ensureExplicitCapacity(int minCapacity) { argument
222 if (minCapacity
240 grow(int minCapacity) argument
252 hugeCapacity(int minCapacity) argument
[all...]
H A DPriorityQueue.java289 * @param minCapacity the desired minimum capacity
291 private void grow(int minCapacity) { argument
299 newCapacity = hugeCapacity(minCapacity);
303 private static int hugeCapacity(int minCapacity) { argument
304 if (minCapacity < 0) // overflow
306 return (minCapacity > MAX_ARRAY_SIZE) ?
H A DComparableTimSort.java876 * @param minCapacity the minimum required capacity of the tmp array
879 private Object[] ensureCapacity(int minCapacity) { argument
880 if (tmpLen < minCapacity) {
881 // Compute smallest power of 2 > minCapacity
882 int newSize = minCapacity;
891 newSize = minCapacity;
H A DTimSort.java909 * @param minCapacity the minimum required capacity of the tmp array
912 private T[] ensureCapacity(int minCapacity) { argument
913 if (tmpLen < minCapacity) {
914 // Compute smallest power of 2 > minCapacity
915 int newSize = minCapacity;
924 newSize = minCapacity;
H A DIdentityHashMap.java241 int minCapacity = (3 * expectedMaxSize)/2;
245 if (minCapacity > MAXIMUM_CAPACITY || minCapacity < 0) {
249 while (result < minCapacity)

Completed in 168 milliseconds