Interface Linked<T extends Linked<T>>

  • All Known Implementing Classes:
    ConcurrentLinkedHashMap.Node

    interface Linked<T extends Linked<T>>
    An element that is linked on the Deque.
    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      T getNext()
      Retrieves the next element or null if either the element is unlinked or the last element on the deque.
      T getPrevious()
      Retrieves the previous element or null if either the element is unlinked or the first element on the deque.
      void setNext​(T next)
      Sets the next element or null if there is no link.
      void setPrevious​(T prev)
      Sets the previous element or null if there is no link.
    • Method Detail

      • getPrevious

        T getPrevious()
        Retrieves the previous element or null if either the element is unlinked or the first element on the deque.
      • setPrevious

        void setPrevious​(T prev)
        Sets the previous element or null if there is no link.
      • getNext

        T getNext()
        Retrieves the next element or null if either the element is unlinked or the last element on the deque.
      • setNext

        void setNext​(T next)
        Sets the next element or null if there is no link.