Heap::Binary - a binary heap to keep data partially sorted River stage two • 6 direct dependents • 36 total dependents

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 GMT

Binary::Heap::Search - Binary search-able heap in 100% Pure Perl River stage zero No dependents

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

Heap - Perl extensions for keeping data partially sorted River stage two • 6 direct dependents • 36 total dependents

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 GMT

Array::Heap - treat perl arrays as binary heaps/priority queues River stage one • 2 direct dependents • 4 total dependents

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 GMT

Heap::MinMax - Min-Max Heap for Priority Queues etc. River stage zero No dependents

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 GMT

5 results (0.039 seconds)