如果标准库中有heapq.merge(),为什么要自己滚动?不幸的是,它没有提供一个关键的论点 – 你必须做装饰 – 合并 – 不自然的舞蹈你自己:
from itertools import imap
from operator import itemgetter
import heapq
def extract_timestamp(line):
"""Extract timestamp and convert to a form that gives the
expected result in a comparison
"""
return line.split()[1] # for example
with open("log1.txt") as f1, open("log2.txt") as f2:
sources = [f1, f2]
with open("merged.txt", "w") as dest:
decorated = [
((extract_timestamp(line), line) for line in f)
for f in sources]
merged = heapq.merge(*decorated)
undecorated = imap(itemgetter(-1), merged)
dest.writelines(undecorated)
上面的每一步都是“懒惰”.当我避免使用file.readlines()时,会根据需要读取文件中的行.同样,装饰过程使用生成器表达式而不是list-comps. heapq.merge()也很懒惰 – 每个输入迭代器需要一个项目来进行必要的比较.最后我使用的是itertools.imap(),它是内置的undecorate的map()的惰性变体.
(在Python 3中map()变得很懒,所以你可以使用那个)