Martin Erwig wrote:
For discrete value domains, you might also want to take a look at:
http://eecs.oregonstate.edu/~erwig/diet/
http://eecs.oregonstate.edu/~erwig/papers/abstracts.html#JFP98
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).
Paul.
_______________________________________________
Haskell mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell
