python any语句_python – 在any()语句中迭代一个小列表会更快吗？

在低长度迭代次数的限制中考虑以下操作,

d = (3, slice(None, None, None), slice(None, None, None))

In [215]: %timeit any([type(i) == slice for i in d])

1000000 loops, best of 3: 695 ns per loop

In [214]: %timeit any(type(i) == slice for i in d)

1000000 loops, best of 3: 929 ns per loop

设置为列表比使用生成器表达式快25％？

为什么会这样,因为设置列表是一项额外的操作.

注意：在两次运行中,我都获得了警告：最慢的运行时间比最快的运行时长6.42倍.这可能意味着我正在缓存中间结果

分析

在这个特定的测试中,list()结构的速度更快,长度为4,发生器的性能提高了.

红线表示此事件发生的位置,黑线表示两者在性能上相等.

通过利用所有内核,代码大约需要1分钟才能在我的MacBook Pro上运行：

import timeit, pylab, multiprocessing

import numpy as np

manager = multiprocessing.Manager()

g = manager.list([])

l = manager.list([])

rng = range(1,16) # list lengths

max_series = [3,slice(None, None, None)]*rng[-1] # alternate array types

series = [max_series[:n] for n in rng]

number, reps = 1000000, 5

def func_l(d):

l.append(timeit.repeat("any([type(i) == slice for i in {}])".format(d),repeat=reps, number=number))

print "done List, len:{}".format(len(d))

def func_g(d):

g.append(timeit.repeat("any(type(i) == slice for i in {})".format(d), repeat=reps, number=number))

print "done Generator, len:{}".format(len(d))

p = multiprocessing.Pool(processes=min(16,rng[-1])) # optimize for 16 processors

p.map(func_l, series) # pool list

p.map(func_g, series) # pool gens

ratio = np.asarray(g).mean(axis=1) / np.asarray(l).mean(axis=1)

pylab.plot(rng, ratio, label='av. generator time / av. list time')

pylab.title("{} iterations, averaged over {} runs".format(number,reps))

pylab.xlabel("length of iterable")

pylab.ylabel("Time Ratio (Higher is worse)")

pylab.legend()

lt_zero = np.argmax(ratio<1.)

pylab.axhline(y=1, color='k')

pylab.axvline(x=lt_zero+1, color='r')

pylab.ion() ; pylab.show()