Uses of Class
org.cicirello.ds.SimpleBinaryHeapDouble

Packages that use SimpleBinaryHeapDouble

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

Uses of SimpleBinaryHeapDouble in org.cicirello.ds

Methods in org.cicirello.ds that return SimpleBinaryHeapDouble

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

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

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