I'd like to announce the beginning of the review of the Heap library, written by Tim Blechmann
A quick glance. On the surface it looks really good.
Also, if it is not already possible, those heaps that use an std::vector ir similar internally should have this data-structure as a template argument s.t. we can easily change this. In some application it might even be possible to use boost::array<T,N>.
hm ... not sure about this: the implementations requires push_back/pop_back (which are not available for boost::array) and random access iterators. the std::vector can be configured to use a different allocator using parameters and one can use `reserve' to reserve memory for the vector ... so i do not really see a specific use case, where one really wants to use a different container, or do you have a specific case? cheers, tim