Heap071::Fibonacci3pm
A perl extension for keeping data partially sorted
Usage
use Heap::Fibonacci;$heap = Heap::Fibonacci->new;# see Heap(3) for usage
Overview
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.
Releases
5 releases since Debian 6.0 (Squeeze); the text changed 3 times.