Class PriorityQueue

java.lang.Object
org.locationtech.jts.util.PriorityQueue

public class PriorityQueue extends Object
A priority queue over a set of Comparable objects.
  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    private ArrayList
     
    private int
     
  • Constructor Summary

    Constructors
    Constructor
    Description
    Creates a new empty priority queue
  • Method Summary

    Modifier and Type
    Method
    Description
    void
    Insert into the priority queue.
    void
    Make the priority queue logically empty.
    boolean
    Test if the priority queue is logically empty.
    Remove the smallest item from the priority queue.
    private void
    reorder(int hole)
    Internal method to percolate down in the heap.
    int
    Returns size.

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Field Details

    • size

      private int size
    • items

      private ArrayList items
  • Constructor Details

    • PriorityQueue

      public PriorityQueue()
      Creates a new empty priority queue
  • Method Details

    • add

      public void add(Comparable x)
      Insert into the priority queue. Duplicates are allowed.
      Parameters:
      x - the item to insert.
    • isEmpty

      public boolean isEmpty()
      Test if the priority queue is logically empty.
      Returns:
      true if empty, false otherwise.
    • size

      public int size()
      Returns size.
      Returns:
      current size.
    • clear

      public void clear()
      Make the priority queue logically empty.
    • poll

      public Object poll()
      Remove the smallest item from the priority queue.
      Returns:
      the smallest item, or null if empty
    • reorder

      private void reorder(int hole)
      Internal method to percolate down in the heap.
      Parameters:
      hole - the index at which the percolate begins.