Uses of Record Class
org.cicirello.ds.DoublePriorityQueueNode

Packages that use DoublePriorityQueueNode

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

Uses of DoublePriorityQueueNode in org.cicirello.ds

Subinterfaces with type arguments of type DoublePriorityQueueNode in org.cicirello.ds

Modifier and Type	Interface	Description
interface	PriorityQueueDouble<E>	Interface common to the classes that provide implementations of a priority queue with double valued priorities.

Methods in org.cicirello.ds that return DoublePriorityQueueNode

Modifier and Type	Method	Description
default DoublePriorityQueueNode<E>	PriorityQueueDouble.element()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final DoublePriorityQueueNode<E>	BinaryHeapDouble.peek()
DoublePriorityQueueNode<E>	FibonacciHeapDouble.peek()
DoublePriorityQueueNode<E>	PriorityQueueDouble.peek()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final DoublePriorityQueueNode<E>	SimpleBinaryHeapDouble.peek()
DoublePriorityQueueNode<E>	SimpleFibonacciHeapDouble.peek()
final DoublePriorityQueueNode<E>	BinaryHeapDouble.poll()
DoublePriorityQueueNode<E>	FibonacciHeapDouble.poll()
DoublePriorityQueueNode<E>	PriorityQueueDouble.poll()	Removes and returns the next (element, priority) pair in priority order from this priority queue.
final DoublePriorityQueueNode<E>	SimpleBinaryHeapDouble.poll()
DoublePriorityQueueNode<E>	SimpleFibonacciHeapDouble.poll()
final DoublePriorityQueueNode<E>	BinaryHeapDouble.pollThenAdd(DoublePriorityQueueNode<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 DoublePriorityQueueNode<E>	PriorityQueueDouble.pollThenAdd(DoublePriorityQueueNode<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 DoublePriorityQueueNode<E>	SimpleBinaryHeapDouble.pollThenAdd(DoublePriorityQueueNode<E> pair)
default DoublePriorityQueueNode<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 DoublePriorityQueueNode

Modifier and Type	Method	Description
final Iterator<DoublePriorityQueueNode<E>>	BinaryHeapDouble.iterator()
Iterator<DoublePriorityQueueNode<E>>	FibonacciHeapDouble.iterator()
Iterator<DoublePriorityQueueNode<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<DoublePriorityQueueNode<E>>	SimpleBinaryHeapDouble.iterator()
Iterator<DoublePriorityQueueNode<E>>	SimpleFibonacciHeapDouble.iterator()

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

Modifier and Type	Method	Description
default boolean	PriorityQueueDouble.add(DoublePriorityQueueNode<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeapDouble.add(DoublePriorityQueueNode<E> pair)
final boolean	BinaryHeapDouble.offer(DoublePriorityQueueNode<E> pair)
boolean	FibonacciHeapDouble.offer(DoublePriorityQueueNode<E> pair)
boolean	PriorityQueueDouble.offer(DoublePriorityQueueNode<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeapDouble.offer(DoublePriorityQueueNode<E> pair)
boolean	SimpleFibonacciHeapDouble.offer(DoublePriorityQueueNode<E> pair)
final DoublePriorityQueueNode<E>	BinaryHeapDouble.pollThenAdd(DoublePriorityQueueNode<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 DoublePriorityQueueNode<E>	PriorityQueueDouble.pollThenAdd(DoublePriorityQueueNode<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 DoublePriorityQueueNode<E>	SimpleBinaryHeapDouble.pollThenAdd(DoublePriorityQueueNode<E> pair)

Method parameters in org.cicirello.ds with type arguments of type DoublePriorityQueueNode

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