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.20 by dl, Sun Mar 6 12:06:17 2005 UTC vs.
Revision 1.21 by dl, Tue Mar 8 12:27:06 2005 UTC

#	Line 19 | Line 19 | package java.util;
19		*
20		* The class implements the <tt>Deque</tt> interface, providing
21		* first-in-first-out queue operations for <tt>add</tt>,
22	<	* <tt>poll</tt>, along with other stack and deque operations.
22	>	* <tt>poll</tt>, along with other stack and deque operations.<p>
23		*
24		* All of the operations perform as could be expected for a doubly-linked
25		* list.  Operations that index into the list will traverse the list from
#	Line 499 | Line 499 | public class LinkedList<E>
499		/**
500		* Inserts the specified element to the front of this list.
501		*
502	<	* @param e the element to insert
502	>	* @param o the element to insert
503		* @return <tt>true</tt> (as per the spec for {@link Deque#offerFirst})
504		* @since 1.6
505		*/
506	<	public boolean offerFirst(E e) {
507	<	addFirst(e);
506	>	public boolean offerFirst(E o) {
507	>	addFirst(o);
508		return true;
509		}
510
511		/**
512		* Inserts the specified element to the end of this list.
513		*
514	<	* @param e the element to insert
514	>	* @param o the element to insert
515		* @return <tt>true</tt> (as per the spec for {@link Deque#offerLast})
516		* @since 1.6
517		*/
518	<	public boolean offerLast(E e) {
519	<	addLast(e);
518	>	public boolean offerLast(E o) {
519	>	addLast(o);
520		return true;
521		}
522
#	Line 582 | Line 582 | public class LinkedList<E>
582		*
583		* <p>This method is equivalent to {@link #addFirst}.
584		*
585	<	* @param e the element to push
585	>	* @param o the element to push
586		* @since 1.6
587		*/
588	<	public void push(E e) {
589	<	addFirst(e);
588	>	public void push(E o) {
589	>	addFirst(o);
590		}
591
592		/**
#	Line 609 | Line 609 | public class LinkedList<E>
609		* list (when traversing the list from head to tail).  If the list
610		* does not contain the element, it is unchanged.
611		*
612	<	* @param e element to be removed from this list, if present
612	>	* @param o element to be removed from this list, if present
613		* @return <tt>true</tt> if the list contained the specified element
614		* @since 1.6
615		*/
616	<	public boolean removeFirstOccurrence(Object e) {
617	<	return remove(e);
616	>	public boolean removeFirstOccurrence(Object o) {
617	>	return remove(o);
618		}
619
620		/**

Diff Legend

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