ViewVC Help

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

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

Comparing jsr166/src/main/java/util/LinkedList.java (file contents):
Revision 1.30 by jsr166, Tue May 17 06:36:47 2005 UTC vs.
Revision 1.34 by dl, Wed May 25 14:05:06 2005 UTC

#	Line 232 | Line 232 | public class LinkedList<E>
232		* this list, in the order that they are returned by the specified
233		* collection's iterator.  The behavior of this operation is undefined if
234		* the specified collection is modified while the operation is in
235	<	* progress.  (This implies that the behavior of this call is undefined if
236	<	* the specified Collection is this list, and this list is nonempty.)
235	>	* progress.  (Note that this will occur if the specified collection is
236	>	* this list, and it's nonempty.)
237		*
238	<	* @param c the elements to be inserted into this list
238	>	* @param c collection containing elements to be added to this list
239		* @return <tt>true</tt> if this list changed as a result of the call
240		* @throws NullPointerException if the specified collection is null
241		*/
#	Line 253 | Line 253 | public class LinkedList<E>
253		*
254		* @param index index at which to insert the first element
255		*              from the specified collection
256	<	* @param c elements to be inserted into this list
256	>	* @param c collection containing elements to be added to this list
257		* @return <tt>true</tt> if this list changed as a result of the call
258		* @throws IndexOutOfBoundsException {@inheritDoc}
259		* @throws NullPointerException if the specified collection is null
#	Line 621 | Line 621 | public class LinkedList<E>
621		*/
622		public boolean removeLastOccurrence(Object o) {
623		if (o==null) {
624	<	for (Entry e = header.previous; e != header; e = e.previous) {
624	>	for (Entry<E> e = header.previous; e != header; e = e.previous) {
625		if (e.element==null) {
626		remove(e);
627		return true;
628		}
629		}
630		} else {
631	<	for (Entry e = header.previous; e != header; e = e.previous) {
631	>	for (Entry<E> e = header.previous; e != header; e = e.previous) {
632		if (o.equals(e.element)) {
633		remove(e);
634		return true;
#	Line 827 | Line 827 | public class LinkedList<E>
827		* <p>The returned array will be "safe" in that no references to it are
828		* maintained by this list.  (In other words, this method must allocate
829		* a new array).  The caller is thus free to modify the returned array.
830	<	*
830	>	*
831		* <p>This method acts as bridge between array-based and collection-based
832		* APIs.
833		*

Diff Legend

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