Message188415
If you take the union/intersection/symmetric difference of n sets, the result is a set with all items that appears in one/all/an odd number of the n sets. The union and intersection methods actually accept n inputs, because the result is obvious, useful, and can be obtained faster that with n-1 binary operations. The symmetric_difference method does not, I presume because the result in not obvious (but that cuts both ways), not known to be useful, and perhaps would not be much faster than than n-1 binary operations. |
|
Date |
User |
Action |
Args |
2013-05-04 22:12:48 | terry.reedy | set | recipients:
+ terry.reedy, georg.brandl, rhettinger, ezio.melotti, docs@python, Amit.Saha |
2013-05-04 22:12:48 | terry.reedy | set | messageid: <1367705568.49.0.496832692578.issue17854@psf.upfronthosting.co.za> |
2013-05-04 22:12:48 | terry.reedy | link | issue17854 messages |
2013-05-04 22:12:48 | terry.reedy | create | |
|