Searched refs:newCapacity (Results 1 - 13 of 13) sorted by relevance
/libcore/ojluni/src/main/java/java/io/ |
H A D | ByteArrayOutputStream.java | 113 int newCapacity = oldCapacity << 1; 114 if (newCapacity - minCapacity < 0) 115 newCapacity = minCapacity; 116 if (newCapacity - MAX_ARRAY_SIZE > 0) 117 newCapacity = hugeCapacity(minCapacity); 118 buf = Arrays.copyOf(buf, newCapacity);
|
H A D | ObjectInputStream.java | 3479 int newCapacity = (entries.length << 1) + 1; 3481 byte[] newStatus = new byte[newCapacity]; 3482 Object[] newEntries = new Object[newCapacity]; 3483 HandleList[] newDeps = new HandleList[newCapacity];
|
/libcore/luni/src/main/java/libcore/io/ |
H A D | IoUtils.java | 240 final int newCapacity = capacity * 2; 241 byte[] newBytes = new byte[newCapacity]; 244 capacity = newCapacity;
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | AbstractStringBuilder.java | 126 newCapacity(minimumCapacity)); 149 private int newCapacity(int minCapacity) { method in class:AbstractStringBuilder 151 int newCapacity = (value.length << 1) + 2; 152 if (newCapacity - minCapacity < 0) { 153 newCapacity = minCapacity; 155 return (newCapacity <= 0 || MAX_ARRAY_SIZE - newCapacity < 0) 157 : newCapacity;
|
/libcore/ojluni/src/main/java/java/util/ |
H A D | Vector.java | 260 int newCapacity = oldCapacity + ((capacityIncrement > 0) ? 262 if (newCapacity - minCapacity < 0) 263 newCapacity = minCapacity; 264 if (newCapacity - MAX_ARRAY_SIZE > 0) 265 newCapacity = hugeCapacity(minCapacity); 266 elementData = Arrays.copyOf(elementData, newCapacity);
|
H A D | PriorityQueue.java | 294 int newCapacity = oldCapacity + ((oldCapacity < 64) ? 298 if (newCapacity - MAX_ARRAY_SIZE > 0) 299 newCapacity = hugeCapacity(minCapacity); 300 queue = Arrays.copyOf(queue, newCapacity);
|
H A D | WeakHashMap.java | 479 * @param newCapacity the new capacity, MUST be a power of two; 484 void resize(int newCapacity) { argument 492 Entry<K,V>[] newTable = newTable(newCapacity); 502 threshold = (int)(newCapacity * loadFactor); 558 int newCapacity = table.length; 559 while (newCapacity < targetCapacity) 560 newCapacity <<= 1; 561 if (newCapacity > table.length) 562 resize(newCapacity);
|
H A D | ArrayList.java | 269 int newCapacity = oldCapacity + (oldCapacity >> 1); 270 if (newCapacity - minCapacity < 0) 271 newCapacity = minCapacity; 272 if (newCapacity - MAX_ARRAY_SIZE > 0) 273 newCapacity = hugeCapacity(minCapacity); 275 elementData = Arrays.copyOf(elementData, newCapacity);
|
H A D | Hashtable.java | 396 int newCapacity = (oldCapacity << 1) + 1; 397 if (newCapacity - MAX_ARRAY_SIZE > 0) { 401 newCapacity = MAX_ARRAY_SIZE; 403 HashtableEntry<?,?>[] newMap = new HashtableEntry<?,?>[newCapacity]; 406 threshold = (int)Math.min(newCapacity * loadFactor, MAX_ARRAY_SIZE + 1); 414 int index = (e.hash & 0x7FFFFFFF) % newCapacity;
|
H A D | ArrayDeque.java | 156 int newCapacity = n << 1; 157 if (newCapacity < 0) 159 Object[] a = new Object[newCapacity];
|
H A D | IdentityHashMap.java | 454 * @param newCapacity the new capacity, must be a power of two. 457 private boolean resize(int newCapacity) { argument 458 // assert (newCapacity & -newCapacity) == newCapacity; // power of 2 459 int newLength = newCapacity * 2;
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ScheduledThreadPoolExecutor.java | 958 int newCapacity = oldCapacity + (oldCapacity >> 1); // grow 50% 959 if (newCapacity < 0) // overflow 960 newCapacity = Integer.MAX_VALUE; 961 queue = Arrays.copyOf(queue, newCapacity);
|
/libcore/luni/src/main/native/ |
H A D | org_apache_harmony_xml_ExpatParser.cpp | 75 int newCapacity = capacity * 2; local 76 jstring* newArray = new jstring[newCapacity]; 85 capacity = newCapacity;
|
Completed in 365 milliseconds