Re: [Haskell-cafe] Re: Data.Map: Enumerating ordered subset of keys

[Svein Ove Aas]

On Mon, Feb 9, 2009 at 8:02 AM, Jared Updike <jupd...@gmail.com> wrote:
> It looks like two "Map.split"s will do what I need except for allowing
> more exact testing of <= vs. < (since == elements are left out of both
> maps...?)
>
If your key is an instance of Enum, you can use succ/pred to work
around that little problem.
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe