… | |
… | |
28 | =cut |
28 | =cut |
29 | |
29 | |
30 | package Array::Heap; |
30 | package Array::Heap; |
31 | |
31 | |
32 | BEGIN { |
32 | BEGIN { |
33 | $VERSION = 3.2; |
33 | $VERSION = 3.21; |
34 | |
34 | |
35 | require XSLoader; |
35 | require XSLoader; |
36 | XSLoader::load ("Array::Heap", $VERSION); |
36 | XSLoader::load ("Array::Heap", $VERSION); |
37 | } |
37 | } |
38 | |
38 | |
… | |
… | |
203 | function exits unexpectedly (e.g. C<last>) or throws an exception, so do |
203 | function exits unexpectedly (e.g. C<last>) or throws an exception, so do |
204 | not do that. |
204 | not do that. |
205 | |
205 | |
206 | =back |
206 | =back |
207 | |
207 | |
208 | =cut |
208 | =head1 SEE ALSO |
|
|
209 | |
|
|
210 | This module has a rather low-level interface. If it seems daunting, you |
|
|
211 | should have a look at L<Array::Heap::ModifiablePriorityQueue>, which is |
|
|
212 | based on this module but provides more and higher-level operations with an |
|
|
213 | object-oriented API which makes it harder to make mistakes. |
|
|
214 | |
|
|
215 | A slightly less flexible (only numeric weights), but also |
|
|
216 | slightly faster variant of that module can be found as |
|
|
217 | L<Array::Heap::PriorityQueue::Numeric> on CPAN. |
209 | |
218 | |
210 | =head1 AUTHOR AND CONTACT INFORMATION |
219 | =head1 AUTHOR AND CONTACT INFORMATION |
211 | |
220 | |
212 | Marc Lehmann <schmorp@schmorp.de> |
221 | Marc Lehmann <schmorp@schmorp.de> |
213 | http://software.schmorp.de/pkg/Array-Heap |
222 | http://software.schmorp.de/pkg/Array-Heap |