The Heap collection of modules provide routines that manage a heap of elements. A heap is a partially sorted structure that is always able to easily extract the smallest of the elements in the structure (or the largest if a reversed compare routine i...

This is an inheritable class for Heap Elements. It provides the interface documentation and some inheritable methods. Only a child classes can be used - this class is not complete....

There are a multitude of heap and heap-like modules on CPAN, you might want to search for /Heap/ and /Priority/ to find many. They implement more or less fancy datastructures that might well be what you are looking for. This module takes a different ...

An implementation of a Min-Max Heap as described in "Min-Max Heaps and Generalized Priority Queues", Atkinson, Sack, Santoro, Strothotte, 1986. Min-Max heaps allow objects to be stored in a 'dual' partially-sorted manner, such that finding both the m...

A heap is a partially sorted structure where it's always easy to extract the smallest element. If the collection of elements is changing dynamically, a heap has less overhead than keeping the collection fully sorted. The order in which equal elements...

Keeps an array of elements in heap order. The *heap* method of an element is used to store the index into the array that refers to the element. See Heap for details on using this module....

Keeps elements in heap order using a linked list of binomial trees. The *heap* method of an element is used to store a reference to the node in the list that refers to the element. See Heap for details on using this module....

Keeps elements in heap order using a linked list of Fibonacci trees. The *heap* method of an element is used to store a reference to the node in the list that refers to the element. See Heap for details on using this module....

Heap::Elem::Num is used to wrap numeric values into an element that can be managed on a heap. The top of the heap will have the smallest element still remaining. (See Heap::Elem::NumRev if you want the heap to always return the largest element.) The ...

Heap::Elem::Str is used to wrap string values into an element that can be managed on a heap. The top of the heap will have the smallest element still remaining. (See Heap::Elem::StrRev if you want the heap to always return the largest element.) The d...

Heap::Elem::Ref is used to wrap object reference values into an element that can be managed on a heap. Each referenced object must have a method *cmp* which can compare itself with any of the other objects that have references on the same heap. These...

This module provides an XS implementation of the interface described in Heap::Simple. Look there for a description....

This module is a wrapper around a Berkeley DB using a btree structure to implement a heap. It is specifically for use by Cache::File for storing expiry times (although with a bit of work it could be made more general). See LIMITATIONS below....

Heap::Elem::RefRev is used to wrap object reference values into an element that can be managed on a heap. Each referenced object must have a method *cmp* which can compare itself with any of the other objects that have references on the same heap. Th...

Heap::Elem::NumRev is used to wrap numeric values into an element that can be managed on a heap. The top of the heap will have the largest element still remaining. (See Heap::Elem::Num if you want the heap to always return the smallest element.) The ...

This module provides a pure perl implementation of the interface described in Heap::Simple. Look there for a description....

Heap::Elem::StrRev is used to wrap string values into an element that can be managed on a heap. The top of the heap will have the largest element still remaining. (See Heap::Elem::Str if you want the heap to always return the smallest element.) The d...