Perhaps this has something to due with uniqueness. A list can have many duplicate elements while a set is supposed to be unique.<br><br><div class="gmail_quote">On Nov 12, 2007 2:48 PM, Neil Mitchell <<a href="mailto:ndmitchell@gmail.com">
ndmitchell@gmail.com</a>> wrote:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">Hi,<br><br>Is there a good reason that Data.Set uses the name "member" while
<br>Data.List (or the Prelude) uses the name "elem", for what to me seem<br>identical concepts. I realise that in Set's the traditional test is<br>for "membership", but it seems awfully arbitrary that one jumped one
<br>way and one jumped the other. I've just written an entire module's<br>worth of Haskell with Set.elem, as that "felt" right, now I'm going<br>back and fixing it.<br><br>Thanks<br><br>Neil<br>_______________________________________________
<br>Haskell-Cafe mailing list<br><a href="mailto:Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe
</a><br></blockquote></div><br>