collections包中ChainMap,Counter,OrderedDict的学习使用

1. ChainMap

from collections import ChainMap

# ChainMap可以将字典逻辑上连接起来，这样就不需要update进行物理连接了，相同的key会取第一个

a={"name":"laowang1","age":201}
b={"name":"laowang2","age":202}
c={"name":"laowang3","age":203}
d = ChainMap(a,b,c)
print(a)
print(b)
print(c)
print(d["name"])
for i in d:
    print(d[i])

结果如下

2.Counter

from collections import Counter

# Counter是一个特殊的dict，它以key-value存在，value为key的次数，一般用来统计序列中元素出现的次数
a=[1,1,2,32,3,2,3,2,5,41,1,2]
c=Counter(a)
print(c)  # Counter({2: 4, 1: 3, 3: 2, 32: 1, 5: 1, 41: 1})

# 存在的key，会拿到它的value
print(c[1])  # 3
# 不存在的key则为0
print(c[85])  # 0



c = Counter({2: 2, 3: 3, 17: 1})

# 常用方法
# 列出所有的元素，包括key和value
print([i for i in c.elements()])   # > [2, 2, 3, 3, 3, 17]

print([i for i in c.values()])   # [2, 3, 1]
print([i for i in c.keys()])  # [2, 3, 17]
# 列出出现最多的几个
print([i for i in c.most_common(1)])  # [(3, 3)]

# 减法操作
c = Counter({2: 2, 3: 3, 17: 1})
d = Counter({2: 1, 3: 1, 17: 1})
c.subtract(d)
print(c)  # Counter({3: 2, 2: 1, 17: 0})
# 也可以如下
print(c+d)
print(c-d)

# 取两个key都出现的并且对应的最小数
print(c&d)
# 取两个key对应的最大数
print(c|d) # Counter({3: 2, 2: 1, 17: 1})
# 取出现次数为正数的
print(+c) # Counter({3: 2, 2: 1})
# 取出现次数为负数的，并转换为正数
c = Counter({2: 2, 3: 3, 17: -1})
print(-c)  # Counter({17: 1})

3.OrderedDict

from collections import OrderedDict
# 会按照字典的添加顺序排序，如果对于乱序的dict可以结合sorted函数进行排序
a=OrderedDict(name="laowng", age=20)
a["python"] = 1
a["java"] = 2
a["php"] = 3
print(a) # OrderedDict([('name', 'laowng'), ('age', 20), ('python', 1), ('java', 2), ('php', 3)])
print(OrderedDict(sorted(a.items(), key=lambda i:i[0])))  # OrderedDict([('age', 20), ('java', 2), ('name', 'laowng'), ('php', 3), ('python', 1)])