from numpy import random
a = random.random(10000)
lst = []
for i in a:
lst.append(i * i) # 不推薦作法
lst = [i * i for i in a] # 使用列表生成式
gen = (i * i for i in a) # 生成器更節省內存數組
a = {'apple': 5.6, 'orange': 4.7, 'banana': 2.8}
da = {key: value for key, value in a.items() if value > 4.0}
print(da) # {'apple': 5.6, 'orange': 4.7}app
from operator import itemgetter
a = [{'date': '2019-12-15', 'weather': 'cloud'},
{'date': '2019-12-13', 'weather': 'sunny'},
{'date': '2019-12-14', 'weather': 'cloud'}]
a.sort(key=itemgetter('weather', 'date'))
print(a)
# [{'date': '2019-12-14', 'weather': 'cloud'}, {'date': '2019-12-15', 'weather': 'cloud'}, {'date': '2019-12-13', 'weather': 'sunny'}]dom
from operator import itemgetter
from itertools import groupby
a.sort(key=itemgetter('weather', 'date')) # 必須先排序再分組
for k, items in groupby(a, key=itemgetter('weather')):
print(k)
for i in items:
print(i)
Python中的聚合類函數sum
,min
,max
第一個參數是iterable
類型,通常使用方法以下:函數
a = [4,2,5,1]
sum([i+1 for i in a]) # 16
使用列表生成式[i+1 for i in a]
建立一個長度與a
同樣的臨時列表,這步完成後,再作sum
聚合。試想若是你的數組a
長度是百萬級,再建立一個這樣的臨時列表就很不划算,最好是一邊算一邊聚合,稍改動爲以下:code
a = [4,2,5,1]
sum(i+1 for i in a) # 16
此時i+1 for i in a
是(i+1 for i in a)
的簡寫,獲得一個生成器(generator
)對象,以下所示:對象
In [8]:(i+1 for i in a)
OUT [8]:<generator object <genexpr> at 0x000002AC7FFA8CF0>
生成器每迭代一步吐出(yield
)一個元素並計算和聚合後,進入下一次迭代,直到終點。blog
dic1 = {'x': 1, 'y': 2 }
dic2 = {'y': 3, 'z': 4 }
merged = {**dic1, **dic2} # {'x': 1, 'y': 3, 'z': 4}排序
修改merged['x']=10
,dic1中的x
值不變
ChainMap
只在邏輯上
合併,在內部建立了一個容納這些字典的列表。內存
from collections import ChainMap
merged = ChainMap(dic1,dic2)
print(merged)
# ChainMap({'x': 1, 'y': 2}, {'y': 3, 'z': 4})
使用ChainMap
合併字典,修改merged['x']=10
,dic1中的x
值改變
get