Schnittstelle ShortPriorityDequeue

Alle Superschnittstellen:
Iterable<Short>, ShortIterable, ShortPriorityQueue
Alle bekannten Implementierungsklassen:
ShortArrayFIFOQueue, ShortLinkedList, ShortPriorityQueues.SynchronizedPriorityDequeue

public interface ShortPriorityDequeue extends ShortPriorityQueue
A Type Speciifc PriorityDeque or Dequeue interface to allow implementations like FIFO queues.
  • Methodendetails

    • enqueueFirst

      void enqueueFirst(short e)
      Method to insert a element into the first Index instead of the last.
      Parameter:
      e - the element that should be inserted into the first place
    • enqueueAllFirst

      default void enqueueAllFirst(short... e)
      Method to mass insert a elements into the first Index of the PriorityDequeue.
      Parameter:
      e - the elements that should be inserted
    • enqueueAllFirst

      default void enqueueAllFirst(short[] e, int length)
      Method to mass insert a elements into the first Index of the PriorityDequeue.
      Parameter:
      e - the elements that should be inserted
      length - the amount of elements that should be inserted
    • enqueueAllFirst

      default void enqueueAllFirst(short[] e, int offset, int length)
      Method to mass insert a elements into the first Index of the PriorityDequeue.
      Parameter:
      e - the elements that should be inserted
      offset - the offset where in the array should be started
      length - the amount of elements that should be inserted
    • enqueueAllFirst

      default void enqueueAllFirst(ShortCollection c)
      Method to mass insert elements into first Index of the PriorityDequeue.
      Parameter:
      c - the elements that should be inserted from the Collection
    • dequeueLast

      short dequeueLast()
      A Method to remove a element from the last place instead of the first
      Gibt zurück:
      the last element inserted
      Löst aus:
      NoSuchElementException - if no element is in the deque
    • last

      default short last()
      Peeking function for the last element
      Gibt zurück:
      the Last Element within the dequeue without deleting it
    • synchronizeQueue

      default ShortPriorityDequeue synchronizeQueue()
      Creates a Wrapped PriorityDequeue that is Synchronized
      Angegeben von:
      synchronizeQueue in Schnittstelle ShortPriorityQueue
      Gibt zurück:
      a new PriorityDequeue that is synchronized
      Siehe auch:
    • synchronizeQueue

      default ShortPriorityDequeue synchronizeQueue(Object mutex)
      Creates a Wrapped PriorityDequeue that is Synchronized
      Angegeben von:
      synchronizeQueue in Schnittstelle ShortPriorityQueue
      Parameter:
      mutex - is the controller of the synchronization block
      Gibt zurück:
      a new PriorityDequeue Wrapper that is synchronized
      Siehe auch:
    • copy

      Beschreibung aus Schnittstelle kopiert: ShortPriorityQueue
      A Function that does a shallow clone of the PriorityQueue itself. This function is more optimized then a copy constructor since the PriorityQueue does not have to be unsorted/resorted. It can be compared to Cloneable but with less exception risk
      Angegeben von:
      copy in Schnittstelle ShortPriorityQueue
      Gibt zurück:
      a Shallow Copy of the PriorityQueue