#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'"""保留最后n個(gè)元素"""from collections import dequedef search(file, pattern, history=5): previous_lines = deque(maxlen=history) for l in file: if pattern in l:  yield l, previous_lines # 使用yield表達(dá)式的生成器函數(shù)，將搜索過(guò)程的代碼和搜索結(jié)果的代碼解耦 previous_lines.append(l)with open(b'file.txt', mode='r', encoding='utf-8') as f: for line, prevlines in search(f, 'Python', 5): for pline in prevlines:  print(pline, end='') print(line, end='')d = deque()d.append(1)d.append("2")print(len(d))print(d[0], d[1])d.extendleft([0])print(d)d.extend([6, 7, 8])print(d)d2 = deque('12345')print(len(d2))d2.popleft()print(d2)d2.pop()print(d2)# 在隊(duì)列兩端插入或刪除元素時(shí)間復(fù)雜度都是 O(1) ，區(qū)別于列表，在列表的開(kāi)頭插入或刪除元素的時(shí)間復(fù)雜度為 O(N)d3 = deque(maxlen=2)d3.append(1)d3.append(2)print(d3)d3.append(3)print(d3)

class deque(object): """ deque([iterable[, maxlen]]) --> deque object  A list-like sequence optimized for data accesses near its endpoints. """ def append(self, *args, **kwargs): # real signature unknown """ Add an element to the right side of the deque. """ pass def appendleft(self, *args, **kwargs): # real signature unknown """ Add an element to the left side of the deque. """ pass def clear(self, *args, **kwargs): # real signature unknown """ Remove all elements from the deque. """ pass def copy(self, *args, **kwargs): # real signature unknown """ Return a shallow copy of a deque. """ pass def count(self, value): # real signature unknown; restored from __doc__ """ D.count(value) -> integer -- return number of occurrences of value """ return 0 def extend(self, *args, **kwargs): # real signature unknown """ Extend the right side of the deque with elements from the iterable """ pass def extendleft(self, *args, **kwargs): # real signature unknown """ Extend the left side of the deque with elements from the iterable """ pass def index(self, value, start=None, stop=None): # real signature unknown; restored from __doc__ """ D.index(value, [start, [stop]]) -> integer -- return first index of value. Raises ValueError if the value is not present. """ return 0 def insert(self, index, p_object): # real signature unknown; restored from __doc__ """ D.insert(index, object) -- insert object before index """ pass def pop(self, *args, **kwargs): # real signature unknown """ Remove and return the rightmost element. """ pass def popleft(self, *args, **kwargs): # real signature unknown """ Remove and return the leftmost element. """ pass def remove(self, value): # real signature unknown; restored from __doc__ """ D.remove(value) -- remove first occurrence of value. """ pass def reverse(self): # real signature unknown; restored from __doc__ """ D.reverse() -- reverse *IN PLACE* """ pass def rotate(self, *args, **kwargs): # real signature unknown """ Rotate the deque n steps to the right (default n=1). If n is negative, rotates left. """ pass

d = {}for key, value in pairs: if key not in d: d[key] = [] d[key].append(value)

d = defaultdict(list)for key, value in pairs: d[key].append(value)

#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'# 字典中的鍵映射多個(gè)值from collections import defaultdictd = defaultdict(list)print(d)d['a'].append([1, 2, 3])d['b'].append(2)d['c'].append(3)print(d)d = defaultdict(set)print(d)d['a'].add(1)d['a'].add(2)d['b'].add(4)print(d)

from collections import namedtuplewebsites = [ ('Sohu', 'http://www.sohu.com/', u'張朝陽(yáng)'), ('Sina', 'http://www.sina.com.cn/', u'王志東'), ('163', 'http://www.163.com/', u'丁磊')]Website = namedtuple('Website', ['name', 'url', 'founder'])for website in websites: website = Website._make(website) print website# 輸出結(jié)果:Website(name='Sohu', url='http://www.sohu.com/', founder=u'/u5f20/u671d/u9633')Website(name='Sina', url='http://www.sina.com.cn/', founder=u'/u738b/u5fd7/u4e1c')Website(name='163', url='http://www.163.com/', founder=u'/u4e01/u78ca')

#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'from collections import Counterwords = [ 'look', 'into', 'my', 'eyes', 'look', 'into', 'my', 'eyes', 'the', 'eyes', 'the', 'eyes', 'the', 'eyes', 'not', 'around', 'the', 'eyes', "don't", 'look', 'around', 'the', 'eyes', 'look', 'into', 'my', 'eyes', "you're", 'under']word_counts = Counter(words)# 出現(xiàn)頻率最高的三個(gè)單詞top_three = word_counts.most_common(3)print(top_three)# Outputs [('eyes', 8), ('the', 5), ('look', 4)]print(word_counts['eyes'])morewords = ['why', 'are', 'you', 'not', 'looking', 'in', 'my', 'eyes']# 如果你想手動(dòng)增加計(jì)數(shù)，可以簡(jiǎn)單的用加法：for word in morewords: print(word) word_counts[word] += 1print(word_counts['eyes'])

#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'from collections import OrderedDictd = OrderedDict()d['foo'] = 1d['bar'] = 2d['spam'] = 3d['grok'] = 4# d['bar'] = 22 #對(duì)于一個(gè)已經(jīng)存在的鍵，重復(fù)賦值不會(huì)改變鍵的順序for key in d: print(key, d[key])print(d)import jsonprint(json.dumps(d))

#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'from collections import ChainMapfrom itertools import chain# 不同集合上元素的迭代a = [1, 2, 3, 4]b = ('x', 'y', 'z')c = {1, 'a'}# 方法一，使用chainfor i in chain(a, b, c): print(i)print('--------------')# 方法二，使用chainmapfor j in ChainMap(a, b, c): print(j)# 這兩種均為節(jié)省內(nèi)存，效率更高的迭代方式

#!/usr/bin/env python# -*- coding:utf-8 -*-# __author__ = 'liao gao xiang'# 合并多個(gè)字典和映射a = {'x': 1, 'z': 3}b = {'y': 2, 'z': 4}# 現(xiàn)在假設(shè)你必須在兩個(gè)字典中執(zhí)行查找操作# (比如先從 a 中找，如果找不到再在 b 中找)。# 一個(gè)非常簡(jiǎn)單的解決方案就是使用collections模塊中的ChainMap類from collections import ChainMapc = ChainMap(a, b)print(c)a['x'] = 11 # 使用ChainMap時(shí)，原字典做了更新，這種更新會(huì)合并到新的字典中去print(c) # 按順序合并兩個(gè)字典print(c['x'])print(c['y'])print(c['z'])# 對(duì)于字典的更新或刪除操作影響的總是列中的第一個(gè)字典。c['z'] = 10c['w'] = 40del c['x']print(a)# del c['y']將出現(xiàn)報(bào)錯(cuò)# ChainMap對(duì)于編程語(yǔ)言中的作用范圍變量（比如globals,locals等）# 是非常有用的。事實(shí)上，有一些方法可以使它變得簡(jiǎn)單：values = ChainMap() # 默認(rèn)會(huì)創(chuàng)建一個(gè)空字典print('/t', values)values['x'] = 1values = values.new_child() # 添加一個(gè)空字典values['x'] = 2values = values.new_child()values['x'] = 30# values = values.new_child()print(values, values['x']) # values['x']輸出最后一次添加的值values = values.parents # 刪除上一次添加的字典print(values['x'])values = values.parentsprint(values)a = {'x': 1, 'y': 2}b = {'y': 2, 'z': 3}merge = dict(b)merge.update(a)print(merge['x'], merge['y'], merge['z'])a['x'] = 11print(merge['x'])