**Heap - Perl extensions for keeping data partially sorted**

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...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Elem - Base class for elements in a Heap**

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....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Array::Heap - treat perl arrays as binary heaps/priority queues**

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 ...

MLEHMANN/Array-Heap-3.22 - 07 Dec 2016 12:07:05 UTC**Heap::MinMax - Min-Max Heap for Priority Queues etc.**

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...

MBEEBE/Heap-MinMax-1.04 - 18 Mar 2013 14:25:39 UTC**Heap::Simple - Fast and easy to use classic heaps**

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...

THOSPEL/Heap-Simple-0.13 - 27 Jan 2008 15:14:03 UTC**Heap::Binary - a binary heap to keep data partially sorted**

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....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Binomial - a binomial heap to keep data partially sorted**

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....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Fibonacci - a fibonacci heap to keep data partially sorted**

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....

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Elem::Num - Numeric Heap Elements**

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 ...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Elem::Str - String Heap Elements**

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...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Elem::Ref - Object Reference Heap Elements**

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...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Simple::XS - An XS implementation of the Heap::Simple interface**

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

THOSPEL/Heap-Simple-XS-0.10 - 13 Jan 2008 16:36:38 UTC**Cache::File::Heap - A file based heap for use by Cache::File**

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....

SHLOMIF/Cache-2.11 - 24 Feb 2015 13:04:21 UTC**Heap::Elem::RefRev - Reversed Object Reverence Heap Elements**

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...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Elem::NumRev - Reversed Numeric Heap Elements**

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 ...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Heap::Simple::Perl - A pure perl implementation of the Heap::Simple interface**

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

THOSPEL/Heap-Simple-Perl-0.14 - 27 Jan 2008 23:49:53 UTC**Heap::Elem::StrRev - Reversed String Heap Elements**

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...

JMM/Heap-0.80 - 28 Apr 2007 18:19:57 UTC**Binary::Heap::Search - Binary search-able heap in 100% Pure Perl**

PRBRENAN/Binary-Heap-Search-2017.117 - 16 Jan 2017 23:27:14 UTC