Lines Matching refs:size
35 * accessed using an integer index. However, the size of a
42 * size; it is usually larger because as components are added to the
43 * vector, the vector's storage increases in chunks the size of
109 * incremented when its size becomes greater than its capacity. If
153 * has size {@code 10} and its standard capacity increment is
197 * size. If the capacity of this vector is larger than its current
198 * size, then the capacity is changed to equal the size by replacing
219 * larger one. The size of the new data array will be the old size plus
222 * the new capacity will be twice the old capacity; but if this new size
250 * The maximum size of array to allocate.
253 * OutOfMemoryError: Requested array size exceeds VM limit
278 * Sets the size of this vector. If the new size is greater than the
279 * current size, new {@code null} items are added to the end of
280 * the vector. If the new size is less than the current size, all
283 * @param newSize the new size of this vector
284 * @throws ArrayIndexOutOfBoundsException if the new size is negative
314 public synchronized int size() {
322 * no components, that is, its size is zero;
443 * than or equal to the current size of this vector
470 * ({@code index < 0 || index >= size()})
498 * <code>size() - 1</code>.
514 * and less than the current size of the vector.
526 * ({@code index < 0 || index >= size()})
540 * smaller than the value it had previously. The size of this vector
544 * and less than the current size of the vector.
553 * ({@code index < 0 || index >= size()})
580 * and less than or equal to the current size of the vector. (If the
581 * index is equal to the current size of the vector, the new element
593 * ({@code index < 0 || index > size()})
609 * increasing its size by one. The capacity of this vector is
610 * increased if its size becomes greater than its capacity.
650 * Removes all components from this vector and sets its size to zero.
699 * type of the specified array and the size of this Vector.
743 * ({@code index < 0 || index >= size()})
761 * ({@code index < 0 || index >= size()})
810 * ({@code index < 0 || index > size()})
823 * ({@code index < 0 || index >= size()})
949 * ({@code index < 0 || index > size()})
975 * have the same size, and all corresponding pairs of elements in the two
1026 * those that change the size of the List, or otherwise perturb it in such
1033 * {@code (fromIndex < 0 || toIndex > size)}
1125 // The "limit" of this iterator. This is the size of the list at the time the
1168 final int size = limit;
1170 if (i >= size) {
1178 while (i != size && modCount == expectedModCount) {
1375 final int size = elementCount;
1376 final BitSet removeSet = new BitSet(size);
1378 for (int i=0; modCount == expectedModCount && i < size; i++) {
1393 final int newSize = size - removeCount;
1394 for (int i=0, j=0; (i < size) && (j < newSize); i++, j++) {
1398 for (int k=newSize; k < size; k++) {
1416 final int size = elementCount;
1417 for (int i=0; modCount == expectedModCount && i < size; i++) {