ViewVC Help
View File | Revision Log | Show Annotations | Download File | Root Listing
root/jsr166/jsr166/src/main/java/util/LinkedList.java
(Generate patch)

Comparing jsr166/src/main/java/util/LinkedList.java (file contents):
Revision 1.37 by jsr166, Mon Jul 18 01:14:34 2005 UTC vs.
Revision 1.42 by jsr166, Mon Dec 5 02:56:59 2005 UTC

# Line 1 | Line 1
1   /*
2   * %W% %E%
3   *
4 < * Copyright 2005 Sun Microsystems, Inc. All rights reserved.
4 > * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
5   * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
6   */
7  
# Line 193 | Line 193 | public class LinkedList<E>
193       * <p>This method is equivalent to {@link #addLast}.
194       *
195       * @param e element to be appended to this list
196 <     * @return <tt>true</tt> (as per the spec for {@link Collection#add})
196 >     * @return <tt>true</tt> (as specified by {@link Collection#add})
197       */
198      public boolean add(E e) {
199          addBefore(e, header);
# Line 486 | Line 486 | public class LinkedList<E>
486       * Adds the specified element as the tail (last element) of this list.
487       *
488       * @param e the element to add
489 <     * @return <tt>true</tt> (as per the spec for {@link Queue#offer})
489 >     * @return <tt>true</tt> (as specified by {@link Queue#offer})
490       * @since 1.5
491       */
492      public boolean offer(E e) {
# Line 498 | Line 498 | public class LinkedList<E>
498       * Inserts the specified element at the front of this list.
499       *
500       * @param e the element to insert
501 <     * @return <tt>true</tt> (as per the spec for {@link Deque#offerFirst})
501 >     * @return <tt>true</tt> (as specified by {@link Deque#offerFirst})
502       * @since 1.6
503       */
504      public boolean offerFirst(E e) {
# Line 510 | Line 510 | public class LinkedList<E>
510       * Inserts the specified element at the end of this list.
511       *
512       * @param e the element to insert
513 <     * @return <tt>true</tt> (as per the spec for {@link Deque#offerLast})
513 >     * @return <tt>true</tt> (as specified by {@link Deque#offerLast})
514       * @since 1.6
515       */
516      public boolean offerLast(E e) {
# Line 547 | Line 547 | public class LinkedList<E>
547      }
548  
549      /**
550 <     * Retrieves and removes the first element of this list, or
551 <     * <tt>null</tt> if this list is empty.
550 >     * Retrieves and removes the first element of this list,
551 >     * or returns <tt>null</tt> if this list is empty.
552       *
553       * @return the first element of this list, or <tt>null</tt> if
554       *     this list is empty
# Line 561 | Line 561 | public class LinkedList<E>
561      }
562  
563      /**
564 <     * Retrieves and removes the last element of this list, or
565 <     * <tt>null</tt> if this list is empty.
564 >     * Retrieves and removes the last element of this list,
565 >     * or returns <tt>null</tt> if this list is empty.
566       *
567       * @return the last element of this list, or <tt>null</tt> if
568       *     this list is empty
# Line 798 | Line 798 | public class LinkedList<E>
798          return result;
799      }
800  
801 +    public Iterator<E> descendingIterator() {
802 +        return new DescendingIterator();
803 +    }
804 +
805 +    /** Adapter to provide descending iterators via ListItr.previous */
806 +    private class DescendingIterator implements Iterator {
807 +        final ListItr itr = new ListItr(size());
808 +        public boolean hasNext() {
809 +            return itr.hasPrevious();
810 +        }
811 +        public E next() {
812 +            return itr.previous();
813 +        }
814 +        public void remove() {
815 +            itr.remove();
816 +        }
817 +    }
818 +
819      /**
820       * Returns a shallow copy of this <tt>LinkedList</tt>. (The elements
821       * themselves are not cloned.)

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines