Uses of Class
org.cicirello.ds.BinaryHeap

Packages that use BinaryHeap

Package	Description
org.cicirello.ds	This package includes core data structures used by other of our libraries and projects.

Uses of BinaryHeap in org.cicirello.ds

Classes in org.cicirello.ds that implement interfaces with type arguments of type BinaryHeap

Modifier and Type	Class	Description
final class	BinaryHeap<E>	An implementation of a Binary Heap.
final class	BinaryHeap<E>	An implementation of a Binary Heap.

Methods in org.cicirello.ds that return BinaryHeap

Modifier and Type	Method	Description
BinaryHeap<E>	BinaryHeap.copy()
static <E> BinaryHeap<E>	BinaryHeap.createMaxHeap()	Creates an empty BinaryHeap with the BinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a maximum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMaxHeap(int initialCapacity)	Creates an empty BinaryHeap with a specified initial capacity, and a maximum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMaxHeap(Collection<IntegerPriorityQueueNode<E>> initialElements)	Creates a BinaryHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMinHeap()	Creates an empty BinaryHeap with the BinaryHeap.DEFAULT_INITIAL_CAPACITY as the initial capacity, and a minimum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMinHeap(int initialCapacity)	Creates an empty BinaryHeap with a specified initial capacity, and a minimum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMinHeap(Collection<IntegerPriorityQueueNode<E>> initialElements)	Creates a BinaryHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.

Methods in org.cicirello.ds with parameters of type BinaryHeap

Modifier and Type	Method	Description
boolean	BinaryHeap.merge(BinaryHeap<E> other)	Merges another priority queue into this one, adding all of its (element, priority) pairs.