Class ByteHeapSemiIndirectPriorityQueue

java.lang.Object
it.unimi.dsi.fastutil.bytes.ByteHeapSemiIndirectPriorityQueue
All Implemented Interfaces:
ByteIndirectPriorityQueue, IndirectPriorityQueue<Byte>
Direct Known Subclasses:
ByteHeapIndirectPriorityQueue

public class ByteHeapSemiIndirectPriorityQueue
extends Object
implements ByteIndirectPriorityQueue
A type-specific heap-based semi-indirect priority queue.

Instances of this class use as reference list a reference array, which must be provided to each constructor. The priority queue is represented using a heap. The heap is enlarged as needed, but it is never shrunk. Use the trim() method to reduce its size, if necessary.

This implementation allows one to enqueue several time the same index, but you must be careful when calling changed().

  • Constructor Details

    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int capacity, ByteComparator c)
      Creates a new empty queue without elements with a given capacity and comparator.
      Parameters:
      refArray - the reference array.
      capacity - the initial capacity of this queue.
      c - the comparator used in this queue, or null for the natural order.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int capacity)
      Creates a new empty queue with given capacity and using the natural order.
      Parameters:
      refArray - the reference array.
      capacity - the initial capacity of this queue.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, ByteComparator c)
      Creates a new empty queue with capacity equal to the length of the reference array and a given comparator.
      Parameters:
      refArray - the reference array.
      c - the comparator used in this queue, or null for the natural order.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray)
      Creates a new empty queue with capacity equal to the length of the reference array and using the natural order.
      Parameters:
      refArray - the reference array.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int[] a, int size, ByteComparator 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:
      refArray - the reference array.
      a - an array of indices into refArray.
      size - the number of elements to be included in the queue.
      c - the comparator used in this queue, or null for the natural order.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int[] a, ByteComparator 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:
      refArray - the reference array.
      a - an array of indices into refArray.
      c - the comparator used in this queue, or null for the natural order.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int[] 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:
      refArray - the reference array.
      a - an array of indices into refArray.
      size - the number of elements to be included in the queue.
    • ByteHeapSemiIndirectPriorityQueue

      public ByteHeapSemiIndirectPriorityQueue​(byte[] refArray, int[] 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:
      refArray - the reference array.
      a - an array of indices into refArray.
  • Method Details