Uses of Record Class
org.cicirello.ds.IntegerPriorityQueueNode
Packages that use IntegerPriorityQueueNode
Package
Description
This package includes core data structures used by other of our libraries and projects.
-
Uses of IntegerPriorityQueueNode in org.cicirello.ds
Subinterfaces with type arguments of type IntegerPriorityQueueNode in org.cicirello.dsModifier and TypeInterfaceDescriptioninterfaceInterface common to the classes that provide implementations of a priority queue with int valued priorities.Methods in org.cicirello.ds that return IntegerPriorityQueueNodeModifier and TypeMethodDescriptiondefault IntegerPriorityQueueNode<E> PriorityQueue.element()Gets the next (element, priority) pair in priority order from this priority queue, without removing it.final IntegerPriorityQueueNode<E> BinaryHeap.peek()FibonacciHeap.peek()PriorityQueue.peek()Gets the next (element, priority) pair in priority order from this priority queue, without removing it.final IntegerPriorityQueueNode<E> SimpleBinaryHeap.peek()SimpleFibonacciHeap.peek()final IntegerPriorityQueueNode<E> BinaryHeap.poll()FibonacciHeap.poll()PriorityQueue.poll()Removes and returns the next (element, priority) pair in priority order from this priority queue.final IntegerPriorityQueueNode<E> SimpleBinaryHeap.poll()SimpleFibonacciHeap.poll()final IntegerPriorityQueueNode<E> BinaryHeap.pollThenAdd(IntegerPriorityQueueNode<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 IntegerPriorityQueueNode<E> PriorityQueue.pollThenAdd(IntegerPriorityQueueNode<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 IntegerPriorityQueueNode<E> SimpleBinaryHeap.pollThenAdd(IntegerPriorityQueueNode<E> pair) default IntegerPriorityQueueNode<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 IntegerPriorityQueueNodeModifier and TypeMethodDescriptionfinal Iterator<IntegerPriorityQueueNode<E>> BinaryHeap.iterator()FibonacciHeap.iterator()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<IntegerPriorityQueueNode<E>> SimpleBinaryHeap.iterator()SimpleFibonacciHeap.iterator()Methods in org.cicirello.ds with parameters of type IntegerPriorityQueueNodeModifier and TypeMethodDescriptiondefault booleanPriorityQueue.add(IntegerPriorityQueueNode<E> pair) Adds an (element, priority) pair to the priority queue.final booleanSimpleBinaryHeap.add(IntegerPriorityQueueNode<E> pair) final booleanBinaryHeap.offer(IntegerPriorityQueueNode<E> pair) booleanFibonacciHeap.offer(IntegerPriorityQueueNode<E> pair) booleanPriorityQueue.offer(IntegerPriorityQueueNode<E> pair) Adds an (element, priority) pair to the priority queue.final booleanSimpleBinaryHeap.offer(IntegerPriorityQueueNode<E> pair) booleanSimpleFibonacciHeap.offer(IntegerPriorityQueueNode<E> pair) final IntegerPriorityQueueNode<E> BinaryHeap.pollThenAdd(IntegerPriorityQueueNode<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 IntegerPriorityQueueNode<E> PriorityQueue.pollThenAdd(IntegerPriorityQueueNode<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 IntegerPriorityQueueNode<E> SimpleBinaryHeap.pollThenAdd(IntegerPriorityQueueNode<E> pair) Method parameters in org.cicirello.ds with type arguments of type IntegerPriorityQueueNodeModifier and TypeMethodDescriptionfinal booleanBinaryHeap.addAll(Collection<? extends IntegerPriorityQueueNode<E>> c) Adds all (element, priority) pairs from a Collection to the priority queue.default booleanPriorityQueue.addAll(Collection<? extends IntegerPriorityQueueNode<E>> c) Adds all (element, priority) pairs from a Collection to the priority queue.final booleanSimpleBinaryHeap.addAll(Collection<? extends IntegerPriorityQueueNode<E>> c) Adds all (element, priority) pairs from a Collection to the priority queue.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> FibonacciHeap<E> FibonacciHeap.createMaxHeap(Collection<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<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<IntegerPriorityQueueNode<E>> initialElements) Creates a SimpleFibonacciHeap from a collection of (element, priority) pairs, with a minimum-priority-first-out priority order.