列出多个匹配实例的交集

# 定义几个匹配实例的集合
set1 = {1, 2, 3, 4, 5}
set2 = {4, 5, 6, 7, 8}
set3 = {5, 8, 9, 10}

# 计算两个集合的交集
intersection_1_2 = set1 & set2
print("Intersection of set1 and set2:", intersection_1_2)  # 输出: {4, 5}

# 计算三个集合的交集
intersection_all = set1 & set2 & set3
print("Intersection of all sets:", intersection_all)  # 输出: {5}

import multiprocessing as mp

def find_intersection(set_a, set_b):
    return set_a & set_b

# 假设我们有非常大的集合需要处理
large_set1 = ...  # 很大的集合1
large_set2 = ...  # 很大的集合2
large_set3 = ...  # 很大的集合3

# 使用多进程加速交集计算
with mp.Pool(processes=3) as pool:
    results = pool.starmap(find_intersection, [(large_set1, large_set2), (large_set2, large_set3), (large_set1, large_set3)])
    
# 最终的交集是所有结果中再取一次交集
final_intersection = results[0] & results[1] & results[2]