<div dir="ltr"><blockquote style="margin:0px 0px 0px 40px;border:none;padding:0px"><div><div class="gmail_signature">2017-08-09 12:23 GMT+09:00 Xiaodi Wu <span dir="ltr">&lt;<a href="mailto:xiaodi.wu@gmail.com" target="_blank">xiaodi.wu@gmail.com</a>&gt;</span>:<br></div></div><div class="gmail_quote"><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"></blockquote></div><div class="gmail_extra"><span style="font-size:14px"><br>For consistency, the name for this function would be `isSuperset(of:)`, and it would be equally interesting to have `isStrictSuperset(of:)`, `isSubset(of:)`, `isStrictSubset(of:)` and `isDisjoint(with:)`--all currently available for types that conform to `SetAlgebra`.</span></div></blockquote><div class="gmail_extra"><span style="font-size:14px"><br></span></div><div class="gmail_extra"><span style="font-size:14px">Thank you for your feedback. It certainly seems better to rename `contains` to </span><span style="font-size:14px">`isSuperset(of:)`. Also I&#39;ll try to implement </span><span style="font-size:14px">`isStrictSuperset(<wbr>of:)` and so on.</span></div><div class="gmail_extra"><span style="font-size:14px"><br></span></div><div class="gmail_extra"><span style="font-size:14px">--</span></div><div class="gmail_extra"><span style="font-size:14px">Yuta</span></div><div class="gmail_extra"><br></div></div>