Uses of Class
org.cicirello.ds.SimpleBinaryHeap
Packages that use SimpleBinaryHeap
Package
Description
This package includes core data structures used by other of our libraries and projects.
-
Uses of SimpleBinaryHeap in org.cicirello.ds
Classes in org.cicirello.ds that implement interfaces with type arguments of type SimpleBinaryHeapModifier and TypeClassDescriptionfinal classAn implementation of a Binary Heap.final classAn implementation of a Binary Heap.Methods in org.cicirello.ds that return SimpleBinaryHeapModifier and TypeMethodDescriptionSimpleBinaryHeap.copy()static <E> SimpleBinaryHeap<E> SimpleBinaryHeap.createMaxHeap()Creates an empty SimpleBinaryHeap with theSimpleBinaryHeap.DEFAULT_INITIAL_CAPACITYas the initial capacity, and a maximum-priority-first-out priority order.static <E> SimpleBinaryHeap<E> SimpleBinaryHeap.createMaxHeap(int initialCapacity) Creates an empty SimpleBinaryHeap with a specified initial capacity, and 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> SimpleBinaryHeap<E> SimpleBinaryHeap.createMinHeap()Creates an empty SimpleBinaryHeap with theSimpleBinaryHeap.DEFAULT_INITIAL_CAPACITYas the initial capacity, and a minimum-priority-first-out priority order.static <E> SimpleBinaryHeap<E> SimpleBinaryHeap.createMinHeap(int initialCapacity) Creates an empty SimpleBinaryHeap with a specified initial capacity, and 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.Methods in org.cicirello.ds with parameters of type SimpleBinaryHeapModifier and TypeMethodDescriptionbooleanSimpleBinaryHeap.merge(SimpleBinaryHeap<E> other) Merges another priority queue into this one, adding all of its (element, priority) pairs.