Class AccessOrderDeque<E extends AccessOrderDeque.AccessOrder<E>>

  • Type Parameters:
    E - the type of elements held in this collection
    All Implemented Interfaces:
    LinkedDeque<E>, java.lang.Iterable<E>, java.util.Collection<E>, java.util.Deque<E>, java.util.Queue<E>

    @NotThreadSafe
    final class AccessOrderDeque<E extends AccessOrderDeque.AccessOrder<E>>
    extends AbstractLinkedDeque<E>
    A linked deque implementation used to represent an access-order queue.
    • Constructor Detail

      • AccessOrderDeque

        AccessOrderDeque()
    • Method Detail

      • remove

        boolean remove​(E e)
      • getPrevious

        public E getPrevious​(E e)
        Description copied from interface: LinkedDeque
        Retrieves the previous element or null if either the element is unlinked or the first element on the deque.
      • setPrevious

        public void setPrevious​(E e,
                                E prev)
        Description copied from interface: LinkedDeque
        Sets the previous element or null if there is no link.
      • getNext

        public E getNext​(E e)
        Description copied from interface: LinkedDeque
        Retrieves the next element or null if either the element is unlinked or the last element on the deque.
      • setNext

        public void setNext​(E e,
                            E next)
        Description copied from interface: LinkedDeque
        Sets the next element or null if there is no link.