python中用来计算集合交集的是_python – 计算集合列表中所有组合的交集

IIUC,这样的事情应该有效：

from itertools import combinations

def venn_count(named_sets):

names = set(named_sets)

for i in range(1, len(named_sets)+1):

for to_intersect in combinations(sorted(named_sets), i):

others = names.difference(to_intersect)

intersected = set.intersection(*(named_sets[k] for k in to_intersect))

unioned = set.union(*(named_sets[k] for k in others)) if others else set()

yield to_intersect, others, len(intersected - unioned)

ns = {"a": {1,2,5,10,12}, "b": {1,2,6,9,12,15}, "c": {1,2,7,8,15}}

for intersected, unioned, count in venn_count(ns):

print 'len({}{}) = {}'.format(' & '.join(sorted(intersected)),

' - ' + ' - '.join(sorted(unioned)) if unioned else '',

count)

这使

len(a - b - c) = 2

len(b - a - c) = 2

len(c - a - b) = 2

len(a & b - c) = 1

len(a & c - b) = 0

len(b & c - a) = 1

len(a & b & c) = 2