… | |
… | |
150 | |
150 | |
151 | * This module can leak memory (or worse) when your comparison function |
151 | * This module can leak memory (or worse) when your comparison function |
152 | exits unexpectedly (e.g. "last") or throws an exception, so do not |
152 | exits unexpectedly (e.g. "last") or throws an exception, so do not |
153 | do that. |
153 | do that. |
154 | |
154 | |
|
|
155 | SEE ALSO |
|
|
156 | This module has a rather low-level interface. If it seems daunting, you |
|
|
157 | should have a look at Array::Heap::ModifiablePriorityQueue, which is |
|
|
158 | based on this module but provides more and higher-level operations with |
|
|
159 | an object-oriented API which makes it harder to make mistakes. |
|
|
160 | |
|
|
161 | A slightly less flexible (only numeric weights), but also slightly |
|
|
162 | faster variant of that module can be found as |
|
|
163 | Array::Heap::PriorityQueue::Numeric on CPAN. |
|
|
164 | |
155 | AUTHOR AND CONTACT INFORMATION |
165 | AUTHOR AND CONTACT INFORMATION |
156 | Marc Lehmann <schmorp@schmorp.de> |
166 | Marc Lehmann <schmorp@schmorp.de> |
157 | http://software.schmorp.de/pkg/Array-Heap |
167 | http://software.schmorp.de/pkg/Array-Heap |
158 | |
168 | |