[Tcllib-devel] pheap - alternate prioqueue ipmlementation

[Andreas K. <and...@ac...>]

pheap - Priority Queue
	A Pairing-heap [1] priority queue in Tcl

[0]	http://wiki.tcl.tk/22428
[1]	http://en.wikipedia.org/wiki/Pairing_heap

<quote [0]>
Comparison with package struct::prioqueue: Prioqueue lacks the sometimes 
essential functionality of setp or promote and its implementation seems to be a 
bubblesort in disguise, which is detrimental to performance if one is dealing 
with many items. Pheap on the other hand, reflects more closely the intention 
and performance characteristics of a priority queue and it seems to be more 
versatile, too. (The interface of get and peek in struct::prioqueue makes me 
frown, too. Imho the distinction of lists and strings should not be blurred 
more, but less.)
</quote>

Hm. We have no benchmarks for the struct::prioqueue code ...
	Time to write some it seems ...
	However, what are sensible benchmarks for prioqueue ...

Andreas