remove a Set of keys from a Map

[Sean Leather]

On Sat, Dec 10, 2011 at 12:33, Henning Thielemann wrote:

> I have (x :: Set key) and (m :: Map key a) and want to remove all keys and
> corresponding values from m that are in x. I could solve it efficiently
> with a
>
> differenceSet :: Map key a -> Set key -> Map key a
>

I have implemented this in the past, though it was certainly inefficient.
It would be nice to have something similar and efficient.

Regards,
Sean
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/libraries/attachments/20111211/cda4486e/attachment.htm>