[Haskell] [ANNOUNCE]: Ranged Sets
paul at cogito.org.uk
Wed Dec 14 17:24:15 EST 2005
Martin Erwig wrote:
> For discrete value domains, you might also want to take a look at:
Thanks. I did actually consider using a tree structure instead of a
list. However trees don't cope with infinite lists, and I do
particularly want infinite lists of ranges.
(Short pause for someone to point out that Wyzchyvski Heaps can process
infinite lists in O(1) time).
More information about the Haskell