python十一:集合(set)

"""
 集合(set): 元素无序,并且不重复,并且元素不可变
"""
sets = {"tian", "xia", "algo", "zero", "color", 12, 432}
for i in sets:
    print(i)

# set()方法创建set
sets = set(["abc","def","ppp","qqq","color"])
print(sets)

# add() 添加元素
sets.add("yyyy")
print(sets)

# copy() 复制集合(不知道是不是浅拷贝)
v = sets.copy();
print(v)

# 随机删除
# sets.pop()
print(sets)
# 指定删除某个值(当删除元素不存在,会报错)
sets.remove("ppp")
print(sets)
# 指定删除某个值(当删除元素不存在,不会报错)
sets.discard("pppppppp")
print(sets)

# 清空set集合
sets.clear()
print(sets)

s_1 = {"x", "i", "a", "t", "r"}
s_2 = {"x", "i", "b", "q", "s"}
# intersection(),求两个set集合的交集, 相当于 s_1&s_2
v = s_1.intersection(s_2)
print(v)
v = s_1&s_2
print(v)

# union(),求两个集合的并集,相当于 s_1|s_2
v = s_1.union(s_2)
print(v)
v = s_1|s_2
print(v)

# difference(),求两个集合的差集,相当于 s_1 - s_2
v = s_1.difference(s_2)
print(v)
v = s_1 - s_2
print(v)

# 交叉补集
v = s_1.symmetric_difference(s_2)
print(v)
v = s_1^s_2
print(v)

# 如果两个集合没有交集,返回True
v = s_1.isdisjoint(s_2)
print(v)

# 判断s_1 是否是 s_2的子集
v = s_1.issubset(s_2)
print(v)
# 判断s_2 是否是 s_1的父集
v = s_2.issuperset(s_1)
print(v)

# 将两个集合的并集更新给s_1
s_1.update(s_2)
print(s_1)

# frozenset创建的对象不能更改,删除,没有add,remove等方法
s = frozenset("12345")