11 May
2011
11 May
'11
4:25 p.m.
Hi Tim, Tim Blechmann <tim@klingt.org>
boost.heap is an implementation of different priority queue data structures. they can be found at:
tarball: http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz git repository: git://tim.klingt.org/boost_heap.git documentation: http://tim.klingt.org/boost_heap/
there will be a `formal' review announcement, i want to invite people to check out code, examples and documentation ...
One quick note: your benchmarks operate on just 16 items and execute in microseconds. I encourage you to consider cases that are orders of magnitude larger. Regards, Phil.