I have a situation where I need to find the smallest N elements from a very large dataset, and I think a Heap sort work wonderfully. I tried Heap.pm but it is rather old, has mixed reviews, and seems to choke on the example code in the POD. Before I dig further into it I am seeking the wisdom of other monks...

Has anyone played with Heap? Any recommendations for other heap implementations that allow arbritray comparison functions?

-Blake