Lines Matching refs:size
80 int size = array.length;
81 E[] data = newElementArray(size);
82 for (int i = 0; i < size; i++) {
93 int size = old.length;
94 data = newElementArray(size + 1);
95 System.arraycopy(old, 0, data, 0, size);
96 data[size] = e;
109 int size = old.length;
110 checkIndexInclusive(index, size);
111 data = newElementArray(size+1);
114 if (size > index) {
115 System.arraycopy(old, index, data, index + 1, size - index);
125 int ssize = c.size();
128 int size = size();
131 int nSize = size + ssize;
133 System.arraycopy(old, 0, data, 0, size);
135 data[size++] = (E) it.next();
146 int ssize = c.size();
149 int size = size();
150 checkIndexInclusive(index, size);
153 int nSize = size + ssize;
160 if (size > index) {
161 System.arraycopy(old, index, data, index + ssize, size - index);
180 if (c.size() == 0) {
186 int size = old.length;
187 E[] toAdd = newElementArray(c.size());
195 E[] data = newElementArray(size + i);
196 System.arraycopy(old, 0, data, 0, size);
197 System.arraycopy(toAdd, 0, data, size, i);
218 int size = old.length;
219 if (size != 0) {
224 data = newElementArray(size + 1);
225 System.arraycopy(old, 0, data, 0, size);
226 data[size] = e;
326 return size() == 0;
405 int size = size();
406 checkIndexExlusive(index, size);
408 data = newElementArray(size);
410 System.arraycopy(oldArr, 0, data, 0, size);
420 public int size() {
457 private final E[] newElementArray(int size) {
458 return (E[])new Object[size];
490 final int removeAll(Collection c, int start, int size) {
491 int ssize = c.size();
500 Object[] data = new Object[size];
502 for (int i = start; i < (start + size); i++) {
507 if (j != size) {
508 E[] result = newElementArray(arrsize - (size - j));
511 System.arraycopy(old, start + size, result, start + j, arrsize
512 - (start + size));
514 return (size - j);
526 int retainAll(Collection c, int start, int size) {
528 if (size == 0) {
531 if (c.size() == 0) {
533 if (size == old.length) {
536 data = newElementArray(old.length - size);
538 System.arraycopy(old, start + size, data, start, old.length
539 - start - size);
542 return size;
544 Object[] temp = new Object[size];
546 for (int i = start; i < (start + size); i++) {
551 if (pos == size) {
554 E[] data = newElementArray(pos + old.length - size);
557 System.arraycopy(old, start + size, data, start + pos, old.length
558 - start - size);
560 return (size - pos);
566 E removeRange(int start, int size) {
569 int sizeArr = size();
571 checkIndexInclusive(start + size, sizeArr);
573 data = newElementArray(sizeArr - size);
577 if (sizeArr > (start + size)) {
578 System.arraycopy(oldArr, start + size, data, start, sizeArr
579 - (start + size));
593 static Object[] toArray(Object[] data, int start, int size) {
594 Object[] result = new Object[size];
595 System.arraycopy(data, start, result, 0, size);
605 static Object[] toArray(Object[] to, Object[] data, int start, int size) {
615 System.arraycopy(data, start, to, 0, size);
626 * @param size size of the range
629 int size) {
630 if (size == 0) {
636 if (indexOf(next, data, start, size) < 0) {
650 * @param size size of the range
653 static final int lastIndexOf(Object o, Object[] data, int start, int size) {
654 if (size == 0) {
658 for (int i = start + size - 1; i > start - 1; i--) {
664 for (int i = start + size - 1; i > start - 1; i--) {
680 * @param size end index
683 static final int indexOf(Object o, Object[] data, int start, int size) {
684 if (size == 0) {
688 for (int i = start; i < start + size; i++) {
694 for (int i = start; i < start + size; i++) {
709 static final void checkIndexInclusive(int index, int size) {
710 if (index < 0 || index > size) {
711 throw new IndexOutOfBoundsException("Index is " + index + ", size is " + size);
721 static final void checkIndexExlusive(int index, int size) {
722 if (index < 0 || index >= size) {
723 throw new IndexOutOfBoundsException("Index is " + index + ", size is " + size);
746 private final int size;
748 final int size() {
749 return size;
755 size = data.length;
763 if (current < size) {
777 throw new NoSuchElementException("pos is " + current + ", size is " + size);
788 throw new NoSuchElementException("pos is " + (current-1) + ", size is " + size);
807 * size and array declared as final,
811 final int size;
815 SubListReadData(int size, Object[] data) {
816 this.size = size;
841 int size = toIdx - fromIdx;
844 read = new SubListReadData(size, list.getData());
873 checkIndexExlusive(index, read.size);
876 read = new SubListReadData(read.size, list.getData());
899 checkIndexExlusive(index, data.size);
904 * @see java.util.Collection#size()
906 public int size() {
907 return read.size;
916 checkIndexExlusive(index, read.size);
919 read = new SubListReadData(read.size - 1, list.getData());
932 checkIndexInclusive(index, read.size);
935 read = new SubListReadData(read.size + 1, list.getData());
945 list.add(start + read.size, o);
946 read = new SubListReadData(read.size + 1, list.getData());
957 int d = list.size();
958 list.addAll(start + read.size, c);
959 read = new SubListReadData(read.size + (list.size() - d), list
971 list.removeRange(start, read.size);
984 return CopyOnWriteArrayList.containsAll(c, b.data, start, b.size);
989 int ind = CopyOnWriteArrayList.indexOf(o, b.data, start, b.size)
995 return read.size == 0;
1005 .lastIndexOf(o, b.data, start, b.size)
1024 read = new SubListReadData(read.size - 1, list.getData());
1036 int removed = list.removeAll(c, start, read.size);
1038 read = new SubListReadData(read.size - removed, list
1052 int removed = list.retainAll(c, start, read.size);
1054 read = new SubListReadData(read.size - removed, list
1070 return CopyOnWriteArrayList.toArray(r.data, start, r.size);
1075 return CopyOnWriteArrayList.toArray(a, r.data, start, r.size);
1084 checkIndexInclusive(index, read.size);
1086 int d = list.size();
1088 read = new SubListReadData(read.size + list.size() - d, list
1133 return nextIndex() < dataR.size;
1155 int size = back.length;
1157 oos.writeInt(size);
1158 for (int i = 0; i < size; i++) {