Introduction
QuickHeaps is a Julia package providing versatile binary heaps and priority queues. These data structures are more flexible and may be quite significantly faster than those provided by DataStructures.
Table of contents
Index of types and methods
QuickHeaps.AbstractBinaryHeapQuickHeaps.AbstractNodeQuickHeaps.AbstractPriorityQueueQuickHeaps.BinaryHeapQuickHeaps.FastBinaryHeapQuickHeaps.FastForwardOrderingQuickHeaps.FastPriorityQueueQuickHeaps.NodeQuickHeaps.PriorityQueueDataStructures.dequeue!DataStructures.dequeue_pair!QuickHeaps.default_orderingQuickHeaps.dequeue_node!QuickHeaps.get_keyQuickHeaps.get_valQuickHeaps.has_bad_valuesQuickHeaps.has_standard_linear_indexingQuickHeaps.heap_indexQuickHeaps.heapifyQuickHeaps.heapify!QuickHeaps.heapify_down!QuickHeaps.heapify_up!QuickHeaps.in_rangeQuickHeaps.indexQuickHeaps.is_one_based_unit_rangeQuickHeaps.isheapQuickHeaps.linear_indexQuickHeaps.nodesQuickHeaps.orderingQuickHeaps.setroot!QuickHeaps.storageQuickHeaps.to_keyQuickHeaps.to_nodeQuickHeaps.to_valQuickHeaps.typenameQuickHeaps.unsafe_grow!QuickHeaps.unsafe_heapify_down!QuickHeaps.unsafe_heapify_up!QuickHeaps.unsafe_shrink!