Class ShortHeapPriorityQueue

java.lang.Object
it.unimi.dsi.fastutil.shorts.ShortHeapPriorityQueue
All Implemented Interfaces:
PriorityQueue<java.lang.Short>, ShortPriorityQueue, java.io.Serializable

public class ShortHeapPriorityQueue
extends java.lang.Object
implements ShortPriorityQueue, java.io.Serializable
A type-specific heap-based priority queue.

Instances of this class represent a priority queue using a heap. The heap is enlarged as needed, but it is never shrunk. Use the trim() method to reduce its size, if necessary.

See Also:
Serialized Form
  • Constructor Details

    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(int capacity, ShortComparator c)
      Creates a new empty queue with a given capacity and comparator.
      Parameters:
      capacity - the initial capacity of this queue.
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(int capacity)
      Creates a new empty queue with a given capacity and using the natural order.
      Parameters:
      capacity - the initial capacity of this queue.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(ShortComparator c)
      Creates a new empty queue with a given comparator.
      Parameters:
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue()
      Creates a new empty queue using the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(short[] a, int size, ShortComparator c)
      Wraps a given array in a queue using a given comparator.

      The queue returned by this method will be backed by the given array. The first size element of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of a one by one).

      Parameters:
      a - an array.
      size - the number of elements to be included in the queue.
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(short[] a, ShortComparator c)
      Wraps a given array in a queue using a given comparator.

      The queue returned by this method will be backed by the given array. The elements of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of a one by one).

      Parameters:
      a - an array.
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(short[] a, int size)
      Wraps a given array in a queue using the natural order.

      The queue returned by this method will be backed by the given array. The first size element of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of a one by one).

      Parameters:
      a - an array.
      size - the number of elements to be included in the queue.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(short[] a)
      Wraps a given array in a queue using the natural order.

      The queue returned by this method will be backed by the given array. The elements of the array will be rearranged so to form a heap (this is more efficient than enqueing the elements of a one by one).

      Parameters:
      a - an array.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(ShortCollection collection, ShortComparator c)
      Creates a queue using the elements in a type-specific collection using a given comparator.

      This constructor is more efficient than enqueing the elements of collection one by one.

      Parameters:
      collection - a collection; its elements will be used to initialize the queue.
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(ShortCollection collection)
      Creates a queue using the elements in a type-specific collection using the natural order.

      This constructor is more efficient than enqueing the elements of collection one by one.

      Parameters:
      collection - a collection; its elements will be used to initialize the queue.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(java.util.Collection<? extends java.lang.Short> collection, ShortComparator c)
      Creates a queue using the elements in a collection using a given comparator.

      This constructor is more efficient than enqueing the elements of collection one by one.

      Parameters:
      collection - a collection; its elements will be used to initialize the queue.
      c - the comparator used in this queue, or null for the natural order.
    • ShortHeapPriorityQueue

      public ShortHeapPriorityQueue​(java.util.Collection<? extends java.lang.Short> collection)
      Creates a queue using the elements in a collection using the natural order.

      This constructor is more efficient than enqueing the elements of collection one by one.

      Parameters:
      collection - a collection; its elements will be used to initialize the queue.
  • Method Details