Package algs24

Class XFixedMinPQ<K extends Comparable<? super K>>

java.lang.Object
algs24.XFixedMinPQ<K>
All Implemented Interfaces:
Iterable<K>

public class XFixedMinPQ<K extends Comparable<? super K>> extends Object implements Iterable<K>
  • Constructor Summary

    Constructors
    Constructor
    Description
    XFixedMinPQ(int initCapacity)
    Create an empty priority queue with the given initial capacity, using the given comparator.
  • Method Summary

    Modifier and Type
    Method
    Description
    Delete and return the smallest key on the priority queue.
    void
    insert(K x)
    Add a new key to the priority queue.
    boolean
    Is the priority queue empty?
    boolean
    Is the priority queue full?
    Return an iterator that iterates over all of the keys on the priority queue in ascending order.
    static void
    main(String[] args)
    A test client.
    min()
    Return the smallest key on the priority queue.
    int
    Return the number of items on the priority queue.

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    Methods inherited from interface java.lang.Iterable

    forEach, spliterator
  • Constructor Details

    • XFixedMinPQ

      public XFixedMinPQ(int initCapacity)
      Create an empty priority queue with the given initial capacity, using the given comparator.
  • Method Details

    • isEmpty

      public boolean isEmpty()
      Is the priority queue empty?
    • isFull

      public boolean isFull()
      Is the priority queue full?
    • size

      public int size()
      Return the number of items on the priority queue.
    • min

      public K min()
      Return the smallest key on the priority queue. Throw an exception if the priority queue is empty.
    • insert

      public void insert(K x)
      Add a new key to the priority queue.
    • delMin

      public K delMin()
      Delete and return the smallest key on the priority queue. Throw an exception if the priority queue is empty.
    • iterator

      public Iterator<K> iterator()
      Return an iterator that iterates over all of the keys on the priority queue in ascending order.

      The iterator doesn't implement remove() since it's optional.

      Specified by:
      iterator in interface Iterable<K extends Comparable<? super K>>
    • main

      public static void main(String[] args)
      A test client.