Proposal for containers: Add 'lookup' function to Data.Set

[David Feuer]

Paint it what you like. Just not `lookup` :-).

On Wed, Jun 29, 2016 at 6:06 PM, Bardur Arantsson <spam at scientician.net> wrote:
> On 06/29/2016 11:48 PM, Alec wrote:
>> `lookupEntry` seems fine to me...
>>
>> \begin{bikeshedding}
>> but it bugs me a little that (according to the API) Sets have "members"
>> (`member`, `notMember`, and `splitMember`) and "elems" (`elems`,
>> `elemAt`), but (at least as of yet) no "entries".  (In my brief scan of
>> the docs, it appears "element" is the preferred English for "thing that
>> can be in a Set").  Andreas' suggestion applies the name to Map as well,
>> so I buy that "entry" is actually a new notion distinct from "element"
>> or "member"---but if a user isn't expected to have that notion in mind
>> when seeking this functionality, it seems mildly disadvantageous to
>> introduce a new word for "thing that can be in a Set" to the API.
>> \end{bikeshedding}
>>
>
> "I love bikesheds! Don't you!?" :)
>
> I can only agree that it's a little incongrouous... but I'll defer to
> maintainer's privilege in the interest of getting things done :).
>
> Regards,
>
> _______________________________________________
> Libraries mailing list
> Libraries at haskell.org
> http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries