Lines Matching defs:elementCount

105      * {@code elementData[elementCount-1]} are the actual items.
109 protected int elementCount;
176 elementCount = elementData.length;
180 elementData = Arrays.copyOf(elementData, elementCount, Object[].class);
197 System.arraycopy(elementData, 0, anArray, 0, elementCount);
211 if (elementCount < oldCapacity) {
212 elementData = Arrays.copyOf(elementData, elementCount);
262 return grow(elementCount + 1);
310 for (int to = elementCount, i = newSize; i < to; i++)
312 elementCount = newSize;
332 return elementCount;
343 return elementCount == 0;
362 return count < elementCount;
367 if (count < elementCount) {
422 for (int i = index ; i < elementCount ; i++)
426 for (int i = index ; i < elementCount ; i++)
445 return lastIndexOf(o, elementCount-1);
465 if (index >= elementCount)
466 throw new IndexOutOfBoundsException(index + " >= "+ elementCount);
492 if (index >= elementCount) {
493 throw new ArrayIndexOutOfBoundsException(index + " >= " + elementCount);
507 if (elementCount == 0) {
521 if (elementCount == 0) {
524 return elementData(elementCount - 1);
548 if (index >= elementCount) {
550 elementCount);
575 if (index >= elementCount) {
577 elementCount);
582 int j = elementCount - index - 1;
587 elementCount--;
588 elementData[elementCount] = null; /* to let gc do its work */
615 if (index > elementCount) {
617 + " > " + elementCount);
620 final int s = elementCount;
628 elementCount = s + 1;
644 add(obj, elementData, elementCount);
680 for (int to = elementCount, i = elementCount = 0; i < to; i++)
696 v.elementData = Arrays.copyOf(elementData, elementCount);
712 return Arrays.copyOf(elementData, elementCount);
743 if (a.length < elementCount)
744 return (T[]) Arrays.copyOf(elementData, elementCount, a.getClass());
746 System.arraycopy(elementData, 0, a, 0, elementCount);
748 if (a.length > elementCount)
749 a[elementCount] = null;
776 if (index >= elementCount)
794 if (index >= elementCount)
811 elementCount = s + 1;
823 add(e, elementData, elementCount);
870 if (index >= elementCount)
874 int numMoved = elementCount - index - 1;
878 elementData[--elementCount] = null; // Let gc do its work
930 final int s = elementCount;
934 elementCount = s + numNew;
1009 final int end = elementCount;
1032 for (i = elementCount = w; i < end; i++)
1060 if (index < 0 || index > elementCount)
1069 final int s = elementCount;
1079 elementCount = s + numNew;
1167 System.arraycopy(es, hi, es, lo, elementCount - hi);
1168 for (int to = elementCount, i = (elementCount -= hi - lo); i < to; i++)
1187 fields.put("elementCount", elementCount);
1207 if (index < 0 || index > elementCount)
1246 return cursor != elementCount;
1253 if (i >= elementCount)
1276 final int size = elementCount;
1360 final int size = elementCount;
1375 final int size = elementCount;
1387 Arrays.sort((E[]) elementData, 0, elementCount, c);
1433 hi = fence = elementCount;
1481 // assert elementCount >= 0;
1482 // assert elementCount == elementData.length || elementData[elementCount] == null;