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

9 Feb 2009

      I had a similar thought. That will probably do the trick.

  Jared.

On 2/8/09, Svein Ove Aas  wrote:
...
On Mon, Feb 9, 2009 at 8:02 AM, Jared Updike  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.