>> * New method (proposed by Shane Holloway): s1.isdisjoint(s2). >> Logically equivalent to "not s1.intersection(s2)" but has an >> early-out if a common member is found. [MvL] > I'd rather see iterator versions of the set operations. Interesting idea. I'm not sure I see how to make it work. If s|t returned an iterator, then how would s|t|u work? Are you proposing lazy evaluation of unions, intersections, and differences? Raymond
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4