Package algs24

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

java.lang.Object

algs24.XFixedMaxPQ<K>

All Implemented Interfaces:

Iterable<K>

public class XFixedMaxPQ<K extends Comparable<? super K>>
extends Object
implements Iterable<K>

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
private class	XFixedMaxPQ.HeapIterator

Field Summary

Fields

Modifier and Type	Field	Description
private final int	MAXN
private int	N
private final K[]	pq

Constructor Summary

Constructors

Constructor	Description
XFixedMaxPQ(int initCapacity)

Method Summary

Modifier and Type	Method	Description
K	delMax()	Delete and return the largest key on the priority queue.
private void	exch(int i, int j)
void	insert(K x)	Add a new key to the priority queue.
boolean	isEmpty()	Is the priority queue empty?
boolean	isFull()	Is the priority queue full?
private boolean	isMaxHeap()
private boolean	isMaxHeap(int k)
Iterator<K>	iterator()	Return an iterator that iterates over all of the keys on the priority queue in descending order.
private boolean	less(int i, int j)
static void	main(String[] args)	A test client.
K	max()	Return the largest key on the priority queue.
private void	showHeap()
private void	sink(int k)
int	size()	Return the number of items on the priority queue.
private void	swim(int k)

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Details

pq

private final K extends Comparable<? super K>[] pq

N

private int N

MAXN

private final int MAXN

Constructor Details

XFixedMaxPQ

public XFixedMaxPQ(int initCapacity)

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.

max

public K max()

Return the largest 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.

delMax

public K delMax()

Delete and return the largest key on the priority queue. Throw an exception if the priority queue is empty.

swim

private void swim(int k)

sink

private void sink(int k)

less

private boolean less(int i,
 int j)

exch

private void exch(int i,
 int j)

isMaxHeap

private boolean isMaxHeap()

isMaxHeap

private boolean isMaxHeap(int k)

iterator

public Iterator<K> iterator()

Return an iterator that iterates over all of the keys on the priority queue in descending order.

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

Specified by:

iterator in interface Iterable<K extends Comparable<? super K>>

showHeap

private void showHeap()

main

public static void main(String[] args)

A test client.