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.13 by dl, Mon Nov 28 23:53:32 2005 UTC vs.
Revision 1.24 by jsr166, Sun May 20 07:54:01 2007 UTC

#	Line 1 | Line 1
1		/*
2	<	* %W% %E%
2	>	* Copyright 1997-2007 Sun Microsystems, Inc.  All Rights Reserved.
3	>	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4		*
5	<	* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
6	<	* SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
5	>	* This code is free software; you can redistribute it and/or modify it
6	>	* under the terms of the GNU General Public License version 2 only, as
7	>	* published by the Free Software Foundation.  Sun designates this
8	>	* particular file as subject to the "Classpath" exception as provided
9	>	* by Sun in the LICENSE file that accompanied this code.
10	>	*
11	>	* This code is distributed in the hope that it will be useful, but WITHOUT
12	>	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13	>	* FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
14	>	* version 2 for more details (a copy is included in the LICENSE file that
15	>	* accompanied this code).
16	>	*
17	>	* You should have received a copy of the GNU General Public License version
18	>	* 2 along with this work; if not, write to the Free Software Foundation,
19	>	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20	>	*
21	>	* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
22	>	* CA 95054 USA or visit www.sun.com if you need additional information or
23	>	* have any questions.
24		*/
25
26		package java.util;
9	–	import java.util.*; // for javadoc (till 6280605 is fixed)
27
28		/**
29		* Resizable-array implementation of the <tt>List</tt> interface.  Implements
#	Line 67 | Line 84 | import java.util.*; // for javadoc (till
84		* should be used only to detect bugs.</i><p>
85		*
86		* This class is a member of the
87	<	* <a href="{@docRoot}/../guide/collections/index.html">
87	>	* <a href="{@docRoot}/../technotes/guides/collections/index.html">
88		* Java Collections Framework</a>.
89		*
90		* @author  Josh Bloch
#	Line 123 | Line 140 | public class ArrayList<E> extends Abstra
140		/**
141		* Constructs a list containing the elements of the specified
142		* collection, in the order they are returned by the collection's
143	<	* iterator.  The <tt>ArrayList</tt> instance has an initial capacity of
127	<	* 110% the size of the specified collection.
143	>	* iterator.
144		*
145		* @param c the collection whose elements are to be placed into this list
146		* @throws NullPointerException if the specified collection is null
147		*/
148		public ArrayList(Collection<? extends E> c) {
133	–	int size = c.size();
134	–	// 10% for growth
135	–	int cap = ((size/10)+1)*11;
136	–	if (cap > 0) {
137	–	Object[] a = new Object[cap];
138	–	a[size] = a[size+1] = UNALLOCATED;
139	–	Object[] b = c.toArray(a);
140	–	if (b[size] == null && b[size+1] == UNALLOCATED) {
141	–	b[size+1] = null;
142	–	elementData = b;
143	–	this.size = size;
144	–	return;
145	–	}
146	–	}
147	–	initFromConcurrentlyMutating(c);
148	–	}
149	–
150	–	private void initFromConcurrentlyMutating(Collection<? extends E> c) {
149		elementData = c.toArray();
150		size = elementData.length;
151		// c.toArray might (incorrectly) not return Object[] (see 6260652)
#	Line 155 | Line 153 | public class ArrayList<E> extends Abstra
153		elementData = Arrays.copyOf(elementData, size, Object[].class);
154		}
155
158	–	private final static Object UNALLOCATED = new Object();
159	–
156		/**
157		* Trims the capacity of this <tt>ArrayList</tt> instance to be the
158		* list's current size.  An application can use this operation to minimize
#	Line 189 | Line 185 | public class ArrayList<E> extends Abstra
185		* @param minCapacity the desired minimum capacity
186		*/
187		private void growArray(int minCapacity) {
188	<	if (minCapacity < 0) // overflow
189	<	throw new OutOfMemoryError();
188	>	if (minCapacity < 0) // overflow
189	>	throw new OutOfMemoryError();
190		int oldCapacity = elementData.length;
191		// Double size if small; else grow by 50%
192	<	int newCapacity = ((oldCapacity < 64)?
193	<	((oldCapacity + 1) * 2):
192	>	int newCapacity = ((oldCapacity < 64) ?
193	>	((oldCapacity + 1) * 2) :
194		((oldCapacity / 2) * 3));
195		if (newCapacity < 0) // overflow
196		newCapacity = Integer.MAX_VALUE;
#	Line 347 | Line 343 | public class ArrayList<E> extends Abstra
343		// Positional Access Operations
344
345		/**
346	<	* Returns error message string for IndexOutOfBoundsExceptions
346	>	* Throws an appropriate exception for indexing errors.
347		*/
348	<	private String ioobe(int index) {
349	<	return "Index: " + index + ", Size: " + size;
348	>	private static void indexOutOfBounds(int i, int s) {
349	>	throw new IndexOutOfBoundsException("Index: " + i + ", Size: " + s);
350		}
351
352		/**
#	Line 362 | Line 358 | public class ArrayList<E> extends Abstra
358		*/
359		public E get(int index) {
360		if (index >= size)
361	<	throw new IndexOutOfBoundsException(ioobe(index));
362	<	return (E)elementData[index];
361	>	indexOutOfBounds(index, size);
362	>	return (E) elementData[index];
363		}
364
365		/**
#	Line 377 | Line 373 | public class ArrayList<E> extends Abstra
373		*/
374		public E set(int index, E element) {
375		if (index >= size)
376	<	throw new IndexOutOfBoundsException(ioobe(index));
381	<
376	>	indexOutOfBounds(index, size);
377		E oldValue = (E) elementData[index];
378		elementData[index] = element;
379		return oldValue;
#	Line 396 | Line 391 | public class ArrayList<E> extends Abstra
391		if (s >= elementData.length)
392		growArray(s + 1);
393		elementData[s] = e;
394	<	size = s + 1;
395	<	return true;
394	>	size = s + 1;
395	>	return true;
396		}
397
398		/**
#	Line 412 | Line 407 | public class ArrayList<E> extends Abstra
407		public void add(int index, E element) {
408		int s = size;
409		if (index > s || index < 0)
410	<	throw new IndexOutOfBoundsException(ioobe(index));
410	>	indexOutOfBounds(index, s);
411		modCount++;
412		if (s >= elementData.length)
413		growArray(s + 1);
414		System.arraycopy(elementData, index,
415	<	elementData, index + 1, s - index);
415	>	elementData, index + 1, s - index);
416		elementData[index] = element;
417		size = s + 1;
418		}
#	Line 434 | Line 429 | public class ArrayList<E> extends Abstra
429		public E remove(int index) {
430		int s = size - 1;
431		if (index > s)
432	<	throw new IndexOutOfBoundsException(ioobe(index));
432	>	indexOutOfBounds(index, size);
433		modCount++;
434	<	E oldValue = (E)elementData[index];
434	>	E oldValue = (E) elementData[index];
435		int numMoved = s - index;
436		if (numMoved > 0)
437		System.arraycopy(elementData, index + 1,
438	<	elementData, index, numMoved);
438	>	elementData, index, numMoved);
439		elementData[s] = null;
440	<	size = s;
440	>	size = s;
441		return oldValue;
442		}
443
#	Line 542 | Line 537 | public class ArrayList<E> extends Abstra
537		*/
538		public boolean addAll(int index, Collection<? extends E> c) {
539		if (index > size || index < 0)
540	<	throw new IndexOutOfBoundsException(ioobe(index));
540	>	indexOutOfBounds(index, size);
541
542		Object[] a = c.toArray();
543		int numNew = a.length;
#	Line 627 | Line 622 | public class ArrayList<E> extends Abstra
622		for (int i=0; i<size; i++)
623		a[i] = s.readObject();
624		}
630	–
631	–
632	–	/**
633	–	* Returns a list-iterator of the elements in this list (in proper
634	–	* sequence), starting at the specified position in the list.
635	–	* Obeys the general contract of <tt>List.listIterator(int)</tt>.<p>
636	–	*
637	–	* The list-iterator is <i>fail-fast</i>: if the list is structurally
638	–	* modified at any time after the Iterator is created, in any way except
639	–	* through the list-iterator's own <tt>remove</tt> or <tt>add</tt>
640	–	* methods, the list-iterator will throw a
641	–	* <tt>ConcurrentModificationException</tt>.  Thus, in the face of
642	–	* concurrent modification, the iterator fails quickly and cleanly, rather
643	–	* than risking arbitrary, non-deterministic behavior at an undetermined
644	–	* time in the future.
645	–	*
646	–	* @param index index of the first element to be returned from the
647	–	*              list-iterator (by a call to <tt>next</tt>)
648	–	* @return a ListIterator of the elements in this list (in proper
649	–	*         sequence), starting at the specified position in the list
650	–	* @throws IndexOutOfBoundsException {@inheritDoc}
651	–	* @see List#listIterator(int)
652	–	*/
653	–	public ListIterator<E> listIterator(int index) {
654	–	if (index < 0 || index > size)
655	–	throw new IndexOutOfBoundsException(ioobe(index));
656	–	return new ArrayListIterator(index);
657	–	}
658	–
659	–	/**
660	–	* {@inheritDoc}
661	–	*/
662	–	public ListIterator<E> listIterator() {
663	–	return new ArrayListIterator(0);
664	–	}
665	–
666	–	/**
667	–	* Returns an iterator over the elements in this list in proper sequence.
668	–	*
669	–	* @return an iterator over the elements in this list in proper sequence
670	–	*/
671	–	public Iterator<E> iterator() {
672	–	return new ArrayListIterator(0);
673	–	}
674	–
675	–	/**
676	–	* A streamlined version of AbstractList.ListItr
677	–	*/
678	–	final class ArrayListIterator implements ListIterator<E> {
679	–	int cursor;           // index of next element to return;
680	–	int lastRet;          // index of last element, or -1 if no such
681	–	int expectedModCount; // to check for CME
682	–
683	–	ArrayListIterator(int index) {
684	–	cursor = index;
685	–	lastRet = -1;
686	–	expectedModCount = modCount;
687	–	}
688	–
689	–	public boolean hasNext() {
690	–	return cursor != size;
691	–	}
692	–
693	–	public boolean hasPrevious() {
694	–	return cursor != 0;
695	–	}
696	–
697	–	public int nextIndex() {
698	–	return cursor;
699	–	}
700	–
701	–	public int previousIndex() {
702	–	return cursor - 1;
703	–	}
704	–
705	–	public E next() {
706	–	try {
707	–	int i = cursor;
708	–	E next = get(i);
709	–	lastRet = i;
710	–	cursor = i + 1;
711	–	return next;
712	–	} catch (IndexOutOfBoundsException ex) {
713	–	throw new NoSuchElementException();
714	–	} finally {
715	–	if (expectedModCount != modCount)
716	–	throw new ConcurrentModificationException();
717	–	}
718	–	}
719	–
720	–	public E previous() {
721	–	try {
722	–	int i = cursor - 1;
723	–	E prev = get(i);
724	–	lastRet = i;
725	–	cursor = i;
726	–	return prev;
727	–	} catch (IndexOutOfBoundsException ex) {
728	–	throw new NoSuchElementException();
729	–	} finally {
730	–	if (expectedModCount != modCount)
731	–	throw new ConcurrentModificationException();
732	–	}
733	–	}
734	–
735	–	public void remove() {
736	–	if (lastRet < 0)
737	–	throw new IllegalStateException();
738	–	if (expectedModCount != modCount)
739	–	throw new ConcurrentModificationException();
740	–	ArrayList.this.remove(lastRet);
741	–	if (lastRet < cursor)
742	–	cursor--;
743	–	lastRet = -1;
744	–	expectedModCount = modCount;
745	–	}
746	–
747	–	public void set(E e) {
748	–	if (lastRet < 0)
749	–	throw new IllegalStateException();
750	–	if (expectedModCount != modCount)
751	–	throw new ConcurrentModificationException();
752	–	ArrayList.this.set(lastRet, e);
753	–	expectedModCount = modCount;
754	–	}
755	–
756	–	public void add(E e) {
757	–	if (expectedModCount != modCount)
758	–	throw new ConcurrentModificationException();
759	–	try {
760	–	ArrayList.this.add(cursor++, e);
761	–	lastRet = -1;
762	–	expectedModCount = modCount;
763	–	} catch (IndexOutOfBoundsException ex) {
764	–	throw new ConcurrentModificationException();
765	–	}
766	–	}
767	–	}
625		}

Diff Legend

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