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

Packages that use PriorityQueueNode.Integer

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

Uses of PriorityQueueNode.Integer in org.cicirello.ds

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

Modifier and Type	Method	Description
PriorityQueueNode.Integer<E>	PriorityQueueNode.Integer.copy()	Creates an identical copy of this object.
default PriorityQueueNode.Integer<E>	PriorityQueue.element()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final PriorityQueueNode.Integer<E>	BinaryHeap.peek()
PriorityQueueNode.Integer<E>	FibonacciHeap.peek()
PriorityQueueNode.Integer<E>	PriorityQueue.peek()	Gets the next (element, priority) pair in priority order from this priority queue, without removing it.
final PriorityQueueNode.Integer<E>	SimpleBinaryHeap.peek()
PriorityQueueNode.Integer<E>	SimpleFibonacciHeap.peek()
final PriorityQueueNode.Integer<E>	BinaryHeap.poll()
PriorityQueueNode.Integer<E>	FibonacciHeap.poll()
PriorityQueueNode.Integer<E>	PriorityQueue.poll()	Removes and returns the next (element, priority) pair in priority order from this priority queue.
final PriorityQueueNode.Integer<E>	SimpleBinaryHeap.poll()
PriorityQueueNode.Integer<E>	SimpleFibonacciHeap.poll()
final PriorityQueueNode.Integer<E>	BinaryHeap.pollThenAdd(PriorityQueueNode.Integer<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.Integer<E>	PriorityQueue.pollThenAdd(PriorityQueueNode.Integer<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.Integer<E>	SimpleBinaryHeap.pollThenAdd(PriorityQueueNode.Integer<E> pair)
default PriorityQueueNode.Integer<E>	PriorityQueue.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.Integer

Modifier and Type	Method	Description
final Iterator<PriorityQueueNode.Integer<E>>	BinaryHeap.iterator()
Iterator<PriorityQueueNode.Integer<E>>	FibonacciHeap.iterator()
Iterator<PriorityQueueNode.Integer<E>>	PriorityQueue.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.Integer<E>>	SimpleBinaryHeap.iterator()
Iterator<PriorityQueueNode.Integer<E>>	SimpleFibonacciHeap.iterator()

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

Modifier and Type	Method	Description
default boolean	PriorityQueue.add(PriorityQueueNode.Integer<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeap.add(PriorityQueueNode.Integer<E> pair)
final boolean	BinaryHeap.offer(PriorityQueueNode.Integer<E> pair)
boolean	FibonacciHeap.offer(PriorityQueueNode.Integer<E> pair)
boolean	PriorityQueue.offer(PriorityQueueNode.Integer<E> pair)	Adds an (element, priority) pair to the priority queue.
final boolean	SimpleBinaryHeap.offer(PriorityQueueNode.Integer<E> pair)
boolean	SimpleFibonacciHeap.offer(PriorityQueueNode.Integer<E> pair)
final PriorityQueueNode.Integer<E>	BinaryHeap.pollThenAdd(PriorityQueueNode.Integer<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.Integer<E>	PriorityQueue.pollThenAdd(PriorityQueueNode.Integer<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.Integer<E>	SimpleBinaryHeap.pollThenAdd(PriorityQueueNode.Integer<E> pair)

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

Modifier and Type	Method	Description
final boolean	BinaryHeap.addAll(Collection<? extends PriorityQueueNode.Integer<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
default boolean	PriorityQueue.addAll(Collection<? extends PriorityQueueNode.Integer<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
final boolean	SimpleBinaryHeap.addAll(Collection<? extends PriorityQueueNode.Integer<E>> c)	Adds all (element, priority) pairs from a Collection to the priority queue.
static <E> BinaryHeap<E>	BinaryHeap.createMaxHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a BinaryHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> FibonacciHeap<E>	FibonacciHeap.createMaxHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a FibonacciHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> SimpleBinaryHeap<E>	SimpleBinaryHeap.createMaxHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a SimpleBinaryHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> SimpleFibonacciHeap<E>	SimpleFibonacciHeap.createMaxHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a SimpleFibonacciHeap from a collection of (element, priority) pairs, with a maximum-priority-first-out priority order.
static <E> BinaryHeap<E>	BinaryHeap.createMinHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a BinaryHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.
static <E> FibonacciHeap<E>	FibonacciHeap.createMinHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a FibonacciHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.
static <E> SimpleBinaryHeap<E>	SimpleBinaryHeap.createMinHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a SimpleBinaryHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.
static <E> SimpleFibonacciHeap<E>	SimpleFibonacciHeap.createMinHeap(Collection<PriorityQueueNode.Integer<E>> initialElements)	Creates a SimpleFibonacciHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.