使用您的列表comp strip被调用两次,如果您只想调用一次并保持理解,则使用gen exp:
input_list[:] = [x for x in (s.strip() for s in input_list) if x]
输入:
input_list = [' \n ',' data1\n ',' data2\n',' \n','data3\n']
输出:
['data1', 'data2', 'data3']
input_list [:]将更改原始列表,这些列表可能是也可能不是您想要的,如果您真的要创建一个新列表,只需使用purge_up_list = ….
我总是发现在python 2中使用itertools.imap,并且在python 3中映射,而不是生成器对于较大的输入是最有效的:
from itertools import imap
input_list[:] = [x for x in imap(str.strip, input_list) if x]
不同方法的一些时间:
In [17]: input_list = [choice(input_list) for _ in range(1000000)]
In [19]: timeit filter(None, imap(str.strip, input_list))
10 loops, best of 3: 115 ms per loop
In [20]: timeit list(ifilter(None,imap(str.strip,input_list)))
10 loops, best of 3: 110 ms per loop
In [21]: timeit [x for x in imap(str.strip,input_list) if x]
10 loops, best of 3: 125 ms per loop
In [22]: timeit [x for x in (s.strip() for s in input_list) if x]
10 loops, best of 3: 145 ms per loop
In [23]: timeit [data.strip() for data in input_list if data.strip()]
10 loops, best of 3: 160 ms per loop
In [24]: %%timeit
....: cleaned_up_list = []
....: for data in input_list:
....: clean_data = data.strip()
....: if clean_data:
....: cleaned_up_list.append(clean_data)
....:
10 loops, best of 3: 150 ms per loop
In [25]:
In [25]: %%timeit
....: cleaned_up_list = []
....: append = cleaned_up_list.append
....: for data in input_list:
....: clean_data = data.strip()
....: if clean_data:
....: append(clean_data)
....:
10 loops, best of 3: 123 ms per loop
最快的方法实际上是itertools.ifilter结合itertools.imap紧跟着用imap过滤.
删除重新评估函数引用列表的需要.每次迭代更有效,如果你被卡住了一个循环并且想要最有效的方法,那么它是一个可行的替代方法.