ViewVC Help

View File | Revision Log | Show Annotations | Download File | Root Listing

root/jsr166/jsr166/src/main/java/util/ArrayList.java

Comparing jsr166/src/main/java/util/ArrayList.java (file contents):
Revision 1.16 by jsr166, Tue Feb 7 20:54:24 2006 UTC vs.
Revision 1.22 by jsr166, Mon Jun 26 01:38:57 2006 UTC

#	Line 66 | Line 66 | package java.util;
66		* should be used only to detect bugs.</i><p>
67		*
68		* This class is a member of the
69	<	* <a href="{@docRoot}/../guide/collections/index.html">
69	>	* <a href="{@docRoot}/../technotes/guides/collections/index.html">
70		* Java Collections Framework</a>.
71		*
72		* @author  Josh Bloch
#	Line 122 | Line 122 | public class ArrayList<E> extends Abstra
122		/**
123		* Constructs a list containing the elements of the specified
124		* collection, in the order they are returned by the collection's
125	<	* iterator.  The <tt>ArrayList</tt> instance has an initial capacity of
126	<	* 110% the size of the specified collection.
125	>	* iterator.
126		*
127		* @param c the collection whose elements are to be placed into this list
128		* @throws NullPointerException if the specified collection is null
129		*/
130		public ArrayList(Collection<? extends E> c) {
132	–	int size = c.size();
133	–	// 10% for growth
134	–	int cap = ((size/10)+1)*11;
135	–	if (cap > 0) {
136	–	Object[] a = new Object[cap];
137	–	a[size] = a[size+1] = UNALLOCATED;
138	–	Object[] b = c.toArray(a);
139	–	if (b[size] == null && b[size+1] == UNALLOCATED) {
140	–	b[size+1] = null;
141	–	elementData = b;
142	–	this.size = size;
143	–	return;
144	–	}
145	–	}
146	–	initFromConcurrentlyMutating(c);
147	–	}
148	–
149	–	private void initFromConcurrentlyMutating(Collection<? extends E> c) {
131		elementData = c.toArray();
132		size = elementData.length;
133		// c.toArray might (incorrectly) not return Object[] (see 6260652)
#	Line 154 | Line 135 | public class ArrayList<E> extends Abstra
135		elementData = Arrays.copyOf(elementData, size, Object[].class);
136		}
137
157	–	private final static Object UNALLOCATED = new Object();
158	–
138		/**
139		* Trims the capacity of this <tt>ArrayList</tt> instance to be the
140		* list's current size.  An application can use this operation to minimize
#	Line 188 | Line 167 | public class ArrayList<E> extends Abstra
167		* @param minCapacity the desired minimum capacity
168		*/
169		private void growArray(int minCapacity) {
170	<	if (minCapacity < 0) // overflow
171	<	throw new OutOfMemoryError();
170	>	if (minCapacity < 0) // overflow
171	>	throw new OutOfMemoryError();
172		int oldCapacity = elementData.length;
173		// Double size if small; else grow by 50%
174	<	int newCapacity = ((oldCapacity < 64)?
175	<	((oldCapacity + 1) * 2):
174	>	int newCapacity = ((oldCapacity < 64) ?
175	>	((oldCapacity + 1) * 2) :
176		((oldCapacity / 2) * 3));
177		if (newCapacity < 0) // overflow
178		newCapacity = Integer.MAX_VALUE;
#	Line 346 | Line 325 | public class ArrayList<E> extends Abstra
325		// Positional Access Operations
326
327		/**
328	<	* Returns error message string for IndexOutOfBoundsExceptions
328	>	* Throws an appropriate exception for indexing errors.
329		*/
330	<	private String ioobe(int index) {
331	<	return "Index: " + index + ", Size: " + size;
330	>	private static void indexOutOfBounds(int i, int s) {
331	>	throw new IndexOutOfBoundsException("Index: " + i + ", Size: " + s);
332		}
333
334		/**
#	Line 361 | Line 340 | public class ArrayList<E> extends Abstra
340		*/
341		public E get(int index) {
342		if (index >= size)
343	<	throw new IndexOutOfBoundsException(ioobe(index));
344	<	return (E)elementData[index];
343	>	indexOutOfBounds(index, size);
344	>	return (E) elementData[index];
345		}
346
347		/**
#	Line 376 | Line 355 | public class ArrayList<E> extends Abstra
355		*/
356		public E set(int index, E element) {
357		if (index >= size)
358	<	throw new IndexOutOfBoundsException(ioobe(index));
380	<
358	>	indexOutOfBounds(index, size);
359		E oldValue = (E) elementData[index];
360		elementData[index] = element;
361		return oldValue;
#	Line 395 | Line 373 | public class ArrayList<E> extends Abstra
373		if (s >= elementData.length)
374		growArray(s + 1);
375		elementData[s] = e;
376	<	size = s + 1;
377	<	return true;
376	>	size = s + 1;
377	>	return true;
378		}
379
380		/**
#	Line 411 | Line 389 | public class ArrayList<E> extends Abstra
389		public void add(int index, E element) {
390		int s = size;
391		if (index > s || index < 0)
392	<	throw new IndexOutOfBoundsException(ioobe(index));
392	>	indexOutOfBounds(index, s);
393		modCount++;
394		if (s >= elementData.length)
395		growArray(s + 1);
396		System.arraycopy(elementData, index,
397	<	elementData, index + 1, s - index);
397	>	elementData, index + 1, s - index);
398		elementData[index] = element;
399		size = s + 1;
400		}
#	Line 433 | Line 411 | public class ArrayList<E> extends Abstra
411		public E remove(int index) {
412		int s = size - 1;
413		if (index > s)
414	<	throw new IndexOutOfBoundsException(ioobe(index));
414	>	indexOutOfBounds(index, size);
415		modCount++;
416	<	E oldValue = (E)elementData[index];
416	>	E oldValue = (E) elementData[index];
417		int numMoved = s - index;
418		if (numMoved > 0)
419		System.arraycopy(elementData, index + 1,
420	<	elementData, index, numMoved);
420	>	elementData, index, numMoved);
421		elementData[s] = null;
422	<	size = s;
422	>	size = s;
423		return oldValue;
424		}
425
#	Line 541 | Line 519 | public class ArrayList<E> extends Abstra
519		*/
520		public boolean addAll(int index, Collection<? extends E> c) {
521		if (index > size || index < 0)
522	<	throw new IndexOutOfBoundsException(ioobe(index));
522	>	indexOutOfBounds(index, size);
523
524		Object[] a = c.toArray();
525		int numNew = a.length;
#	Line 626 | Line 604 | public class ArrayList<E> extends Abstra
604		for (int i=0; i<size; i++)
605		a[i] = s.readObject();
606		}
629	–
630	–
631	–	/**
632	–	* Returns a list-iterator of the elements in this list (in proper
633	–	* sequence), starting at the specified position in the list.
634	–	* Obeys the general contract of <tt>List.listIterator(int)</tt>.<p>
635	–	*
636	–	* The list-iterator is <i>fail-fast</i>: if the list is structurally
637	–	* modified at any time after the Iterator is created, in any way except
638	–	* through the list-iterator's own <tt>remove</tt> or <tt>add</tt>
639	–	* methods, the list-iterator will throw a
640	–	* <tt>ConcurrentModificationException</tt>.  Thus, in the face of
641	–	* concurrent modification, the iterator fails quickly and cleanly, rather
642	–	* than risking arbitrary, non-deterministic behavior at an undetermined
643	–	* time in the future.
644	–	*
645	–	* @param index index of the first element to be returned from the
646	–	*              list-iterator (by a call to <tt>next</tt>)
647	–	* @return a ListIterator of the elements in this list (in proper
648	–	*         sequence), starting at the specified position in the list
649	–	* @throws IndexOutOfBoundsException {@inheritDoc}
650	–	* @see List#listIterator(int)
651	–	*/
652	–	public ListIterator<E> listIterator(int index) {
653	–	if (index < 0 || index > size)
654	–	throw new IndexOutOfBoundsException(ioobe(index));
655	–	return new ArrayListIterator(index);
656	–	}
657	–
658	–	/**
659	–	* {@inheritDoc}
660	–	*/
661	–	public ListIterator<E> listIterator() {
662	–	return new ArrayListIterator(0);
663	–	}
664	–
665	–	/**
666	–	* Returns an iterator over the elements in this list in proper sequence.
667	–	*
668	–	* @return an iterator over the elements in this list in proper sequence
669	–	*/
670	–	public Iterator<E> iterator() {
671	–	return new ArrayListIterator(0);
672	–	}
673	–
674	–	/**
675	–	* A streamlined version of AbstractList.ListItr
676	–	*/
677	–	final class ArrayListIterator implements ListIterator<E> {
678	–	int cursor;           // index of next element to return;
679	–	int lastRet;          // index of last element, or -1 if no such
680	–	int expectedModCount; // to check for CME
681	–
682	–	ArrayListIterator(int index) {
683	–	cursor = index;
684	–	lastRet = -1;
685	–	expectedModCount = modCount;
686	–	}
687	–
688	–	public boolean hasNext() {
689	–	return cursor != size;
690	–	}
691	–
692	–	public boolean hasPrevious() {
693	–	return cursor != 0;
694	–	}
695	–
696	–	public int nextIndex() {
697	–	return cursor;
698	–	}
699	–
700	–	public int previousIndex() {
701	–	return cursor - 1;
702	–	}
703	–
704	–	public E next() {
705	–	try {
706	–	int i = cursor;
707	–	E next = get(i);
708	–	lastRet = i;
709	–	cursor = i + 1;
710	–	return next;
711	–	} catch (IndexOutOfBoundsException ex) {
712	–	throw new NoSuchElementException();
713	–	} finally {
714	–	if (expectedModCount != modCount)
715	–	throw new ConcurrentModificationException();
716	–	}
717	–	}
718	–
719	–	public E previous() {
720	–	try {
721	–	int i = cursor - 1;
722	–	E prev = get(i);
723	–	lastRet = i;
724	–	cursor = i;
725	–	return prev;
726	–	} catch (IndexOutOfBoundsException ex) {
727	–	throw new NoSuchElementException();
728	–	} finally {
729	–	if (expectedModCount != modCount)
730	–	throw new ConcurrentModificationException();
731	–	}
732	–	}
733	–
734	–	public void remove() {
735	–	if (lastRet < 0)
736	–	throw new IllegalStateException();
737	–	if (expectedModCount != modCount)
738	–	throw new ConcurrentModificationException();
739	–	ArrayList.this.remove(lastRet);
740	–	if (lastRet < cursor)
741	–	cursor--;
742	–	lastRet = -1;
743	–	expectedModCount = modCount;
744	–	}
745	–
746	–	public void set(E e) {
747	–	if (lastRet < 0)
748	–	throw new IllegalStateException();
749	–	if (expectedModCount != modCount)
750	–	throw new ConcurrentModificationException();
751	–	ArrayList.this.set(lastRet, e);
752	–	expectedModCount = modCount;
753	–	}
754	–
755	–	public void add(E e) {
756	–	if (expectedModCount != modCount)
757	–	throw new ConcurrentModificationException();
758	–	try {
759	–	ArrayList.this.add(cursor++, e);
760	–	lastRet = -1;
761	–	expectedModCount = modCount;
762	–	} catch (IndexOutOfBoundsException ex) {
763	–	throw new ConcurrentModificationException();
764	–	}
765	–	}
766	–	}
607		}

Diff Legend

–	Removed lines
+	Added lines
<	Changed lines
>	Changed lines