Query: heap::fibonacci
OS: debian
Section: 3pm
Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar
Heap::Fibonacci(3pm) User Contributed Perl Documentation Heap::Fibonacci(3pm)NAMEHeap::Fibonacci - a fibonacci heap to keep data partially sortedSYNOPSISuse Heap::Fibonacci; $heap = Heap::Fibonacci->new; # see Heap(3) for usageDESCRIPTIONKeeps 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.AUTHORJohn Macdonald, john@perlwolf.comCOPYRIGHTCopyright 1998-2007, O'Reilly & Associates. This code is distributed under the same copyright terms as perl itself.SEE ALSOHeap(3), Heap::Elem(3). perl v5.8.8 2007-10-23 Heap::Fibonacci(3pm)
Related Man Pages |
---|
jocamlrun(1) - debian |
rdsalloc(3) - debian |
heap071::elem(3pm) - debian |
heap::elem(3pm) - debian |
heap::elem::numrev(3pm) - debian |
Similar Topics in the Unix Linux Community |
---|
awk or sed - Convert 2 lines to 1 line |
How can I do this in VI editor? |
Introduction |
Detecting unused variables... |
Weird 'find' results |