[Haskell-cafe] Segment Tree based Set

Chaddaï Fouché chaddai.fouche at gmail.com
Mon Oct 29 11:33:35 CET 2012

On Mon, Oct 29, 2012 at 9:43 AM, Tony Morris <tonymorris at gmail.com> wrote:
> It is not a Set, but a Map. Of course, I could use it to implement the
> function I need with something like: type SSet a = STree [()] a, but
> then I'd have to unnecessarily go beyond Haskell98.

Couldn't you just use :

> instance Measured (Interval a) Bool where
>   measure _ = True

Then the normal functions of SegmentTree would do what you wish for,
no ? You don't need much beyond Haskell 98 (MPTC is used everywhere


More information about the Haskell-Cafe mailing list