Uses of Class
org.cicirello.ds.PriorityQueueNode.Double

Packages that use PriorityQueueNode.Double

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

Uses of PriorityQueueNode.Double in org.cicirello.ds

Methods in org.cicirello.ds that return PriorityQueueNode.Double

Modifier and Type	Method	Description
PriorityQueueNode.Double<E>	PriorityQueueNode.Double.copy()	Creates an identical copy of this object.
default PriorityQueueNode.Double<E>	PriorityQueueDouble.element()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final PriorityQueueNode.Double<E>	BinaryHeapDouble.peek()
PriorityQueueNode.Double<E>	FibonacciHeapDouble.peek()
PriorityQueueNode.Double<E>	PriorityQueueDouble.peek()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final PriorityQueueNode.Double<E>	SimpleBinaryHeapDouble.peek()
PriorityQueueNode.Double<E>	SimpleFibonacciHeapDouble.peek()
final PriorityQueueNode.Double<E>	BinaryHeapDouble.poll()
PriorityQueueNode.Double<E>	FibonacciHeapDouble.poll()
PriorityQueueNode.Double<E>	PriorityQueueDouble.poll()	Removes and returns the next (element, priority) pair in priority order from this priority queue.
final PriorityQueueNode.Double<E>	SimpleBinaryHeapDouble.poll()
PriorityQueueNode.Double<E>	SimpleFibonacciHeapDouble.poll()
final PriorityQueueNode.Double<E>	BinaryHeapDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)	Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.
default PriorityQueueNode.Double<E>	PriorityQueueDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)	Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.
final PriorityQueueNode.Double<E>	SimpleBinaryHeapDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)
default PriorityQueueNode.Double<E>	PriorityQueueDouble.remove()	Removes and returns the next (element, priority) pair in priority order from this priority queue.

Methods in org.cicirello.ds that return types with arguments of type PriorityQueueNode.Double

Modifier and Type	Method	Description
final Iterator<PriorityQueueNode.Double<E>>	BinaryHeapDouble.iterator()
Iterator<PriorityQueueNode.Double<E>>	FibonacciHeapDouble.iterator()
Iterator<PriorityQueueNode.Double<E>>	PriorityQueueDouble.iterator()	Returns an iterator over the (element, priority) pairs in a mostly arbitrary order (i.e., you must not assume any particular order).
final Iterator<PriorityQueueNode.Double<E>>	SimpleBinaryHeapDouble.iterator()
Iterator<PriorityQueueNode.Double<E>>	SimpleFibonacciHeapDouble.iterator()

Methods in org.cicirello.ds with parameters of type PriorityQueueNode.Double

Modifier and Type	Method	Description
default boolean	PriorityQueueDouble.add(PriorityQueueNode.Double<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeapDouble.add(PriorityQueueNode.Double<E> pair)
final boolean	BinaryHeapDouble.offer(PriorityQueueNode.Double<E> pair)
boolean	FibonacciHeapDouble.offer(PriorityQueueNode.Double<E> pair)
boolean	PriorityQueueDouble.offer(PriorityQueueNode.Double<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeapDouble.offer(PriorityQueueNode.Double<E> pair)
boolean	SimpleFibonacciHeapDouble.offer(PriorityQueueNode.Double<E> pair)
final PriorityQueueNode.Double<E>	BinaryHeapDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)	Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.
default PriorityQueueNode.Double<E>	PriorityQueueDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)	Removes and returns the next (element, priority) pair in priority order from this priority queue, adding a new (element, priority) pair prior to returning.
final PriorityQueueNode.Double<E>	SimpleBinaryHeapDouble.pollThenAdd(PriorityQueueNode.Double<E> pair)

Method parameters in org.cicirello.ds with type arguments of type PriorityQueueNode.Double

Modifier and Type	Method	Description
final boolean	BinaryHeapDouble.addAll(Collection<? extends PriorityQueueNode.Double<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
default boolean	PriorityQueueDouble.addAll(Collection<? extends PriorityQueueNode.Double<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
final boolean	SimpleBinaryHeapDouble.addAll(Collection<? extends PriorityQueueNode.Double<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
static <E> BinaryHeapDouble<E>	BinaryHeapDouble.createMaxHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a BinaryHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> FibonacciHeapDouble<E>	FibonacciHeapDouble.createMaxHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a FibonacciHeapDouble from a collection of (element, priority) pairs, with 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> SimpleFibonacciHeapDouble<E>	SimpleFibonacciHeapDouble.createMaxHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a SimpleFibonacciHeapDouble from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> BinaryHeapDouble<E>	BinaryHeapDouble.createMinHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a BinaryHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.
static <E> FibonacciHeapDouble<E>	FibonacciHeapDouble.createMinHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a FibonacciHeapDouble from a collection of (element, priority) pairs, with 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.
static <E> SimpleFibonacciHeapDouble<E>	SimpleFibonacciHeapDouble.createMinHeap(Collection<PriorityQueueNode.Double<E>> initialElements)	Creates a SimpleFibonacciHeapDouble from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.