Hugo wrote:
Hi! I want to write a Priority Queue but I can't find a TtdCompareFunc
in order to keep the priority queue properties
It is defined in the unit TDBasics. Just Google for it. It really gives a
faster response than a mailing list ;)
Bram
PS I hope you were planning to use the heap version of the priority queue! It
has O(log N) add/remove instead of O(1) insert/O(N) remove.
_________________________________________________________________
To unsubscribe: mail [EMAIL PROTECTED] with
"unsubscribe" as the Subject
archives at http://www.lazarus.freepascal.org/mailarchives
