| CPAN Ratings Array-Heap reviews | |
| Home | Search | About | Bitcard Account | Login |
RSS | Module Info | Add a review of Array-Heap
PUBLIC SERVICE ANNOUNCEMENT!!!
Don't use any modules by Marc Lehmann, you will almost certainly regret it later. This author has a history of extreme hostility towards the Perl community and will actively prevent you from using his software if he doesn't like you, or what you do with it.
To give you an example, in the 6.1 release of AnyEvent he made AnyEvent.pm die if you use it together with IO::Async::Loop::AnyEvent. metacpan.org/source/MLEHMANN/AnyEvent...
See also this P5P thread for a little more context. www.nntp.perl.org/group/perl.perl5.po...
PSA Perl - 2012-04-24T07:19:02
The module is a very simple and easy to use implementation of binary heap partial ordering on an array.
The only part lacking is the number of additional utility functions. For example, I'm trying to clip a priority queue, so I push an element, reverse the array, perform make_heap with an inverse comparison, pop an element with an inverse comparison, and reverse the array again. This could be made simpler using reverse_make_heap, reverse_pop_heap, which will enable treating the array as a heap, with the same comparison function, from the other end, so that big elements bubble that way, and you can remove them from there. I guess I could think of a number of other useful functions which are better implemented at the module level.
Otherwise jolly good show, and keep up the good work!
יובל קוג'מן - 2003-10-08T05:27:21
|
Perl.org sites
: bugs
| dev
| history
| jobs
| learn
| lists
| use
Site Information and Contacts |
|