[Haskell-cafe] Segment Tree based Set

Stephen Tetley stephen.tetley at gmail.com
Mon Oct 29 18:55:09 CET 2012

Are Martin Erwig's "diets" anything close?


On 29 October 2012 04:48, Tony Morris <tonymorris at gmail.com> wrote:
> Hi,
> I was wondering if anyone knows of a package implementing a fast lookup
> for an element in ranges.
> For example, this operation:
> Ord a => a -> [(a, a)] -> Bool

More information about the Haskell-Cafe mailing list