Proposal: Add `restriction` to Data.Map and Data.IntMap

[David Feuer]

I got distracted from this discussion for a bit. Based on input from
the list, and Ross Paterson's remark about argument order, I'm
currently thinking

restrictKeys :: Ord k => Map k a -> Set k -> Map k a

and

withoutKeys :: Ord k => Map k a -> Set k -> Map k a

Are there any major objections?

On Thu, Jul 14, 2016 at 12:54 PM, Alexey Vagarenko <vagarenko at gmail.com> wrote:
> How about `keepKeys`?
>
> 2016-07-14 21:36 GMT+05:00 Daniel Trstenjak <daniel.trstenjak at gmail.com>:
>>
>> On Thu, Jul 14, 2016 at 12:02:51PM -0400, David Feuer wrote:
>> > If you name it, it will come!
>>
>> intersectKeys and differentiateKeys
>>
>> or
>>
>> intersectionWithSet and differenceWithSet
>>
>> or ;)
>>
>> intersectionOfKeys and differenceOfKeys
>>
>>
>> Greetings,
>> Daniel
>> _______________________________________________
>> Libraries mailing list
>> Libraries at haskell.org
>> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>
>
>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries
>