I don't remember the answer to either of your questions, I'm afraid --
queuelike was last updated in 2009 (!), and that's really the last time I
looked at it. That said, I'm not sure I follow how queuelike is a psqueue
at all as opposed to a pqueue?
Louis Wasserman
wasserman.
have any
more source history than you do.
> Is it possible to make pqueue a full pSqueue implementation?
Not without rewriting the API and data structure...or, equivalently, just
starting from scratch.
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
On Thu,
/hackage.haskell.org/package/pqueue, the darcs
repo is http://code.haskell.org/containers-pqueue/
Louis Wasserman
wasserman.lo...@gmail.com
http://profiles.google.com/wasserman.louis
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/rangeminefficiently
(in effectively linear lazy preprocessing time) processes an
array to find minimum elements of subranges of the array in constant time.
--
Louis Wasserman
wasserman.lo...@gmail.com
