List comprehension vs. lambda + filter

前端 未结 14 2144
挽巷
挽巷 2020-11-22 02:01

I happened to find myself having a basic filtering need: I have a list and I have to filter it by an attribute of the items.

My code looked like this:



        
相关标签:
14条回答
  • 2020-11-22 02:41

    I find the second way more readable. It tells you exactly what the intention is: filter the list.
    PS: do not use 'list' as a variable name

    0 讨论(0)
  • 2020-11-22 02:49

    I thought I'd just add that in python 3, filter() is actually an iterator object, so you'd have to pass your filter method call to list() in order to build the filtered list. So in python 2:

    lst_a = range(25) #arbitrary list
    lst_b = [num for num in lst_a if num % 2 == 0]
    lst_c = filter(lambda num: num % 2 == 0, lst_a)
    

    lists b and c have the same values, and were completed in about the same time as filter() was equivalent [x for x in y if z]. However, in 3, this same code would leave list c containing a filter object, not a filtered list. To produce the same values in 3:

    lst_a = range(25) #arbitrary list
    lst_b = [num for num in lst_a if num % 2 == 0]
    lst_c = list(filter(lambda num: num %2 == 0, lst_a))
    

    The problem is that list() takes an iterable as it's argument, and creates a new list from that argument. The result is that using filter in this way in python 3 takes up to twice as long as the [x for x in y if z] method because you have to iterate over the output from filter() as well as the original list.

    0 讨论(0)
  • 2020-11-22 02:52

    Although filter may be the "faster way", the "Pythonic way" would be not to care about such things unless performance is absolutely critical (in which case you wouldn't be using Python!).

    0 讨论(0)
  • 2020-11-22 02:53

    generally filter is slightly faster if using a builtin function.

    I would expect the list comprehension to be slightly faster in your case

    0 讨论(0)
  • 2020-11-22 02:55

    Curiously on Python 3, I see filter performing faster than list comprehensions.

    I always thought that the list comprehensions would be more performant. Something like: [name for name in brand_names_db if name is not None] The bytecode generated is a bit better.

    >>> def f1(seq):
    ...     return list(filter(None, seq))
    >>> def f2(seq):
    ...     return [i for i in seq if i is not None]
    >>> disassemble(f1.__code__)
    2         0 LOAD_GLOBAL              0 (list)
              2 LOAD_GLOBAL              1 (filter)
              4 LOAD_CONST               0 (None)
              6 LOAD_FAST                0 (seq)
              8 CALL_FUNCTION            2
             10 CALL_FUNCTION            1
             12 RETURN_VALUE
    >>> disassemble(f2.__code__)
    2           0 LOAD_CONST               1 (<code object <listcomp> at 0x10cfcaa50, file "<stdin>", line 2>)
              2 LOAD_CONST               2 ('f2.<locals>.<listcomp>')
              4 MAKE_FUNCTION            0
              6 LOAD_FAST                0 (seq)
              8 GET_ITER
             10 CALL_FUNCTION            1
             12 RETURN_VALUE
    

    But they are actually slower:

       >>> timeit(stmt="f1(range(1000))", setup="from __main__ import f1,f2")
       21.177661532000116
       >>> timeit(stmt="f2(range(1000))", setup="from __main__ import f1,f2")
       42.233950221000214
    
    0 讨论(0)
  • 2020-11-22 02:58

    It is strange how much beauty varies for different people. I find the list comprehension much clearer than filter+lambda, but use whichever you find easier.

    There are two things that may slow down your use of filter.

    The first is the function call overhead: as soon as you use a Python function (whether created by def or lambda) it is likely that filter will be slower than the list comprehension. It almost certainly is not enough to matter, and you shouldn't think much about performance until you've timed your code and found it to be a bottleneck, but the difference will be there.

    The other overhead that might apply is that the lambda is being forced to access a scoped variable (value). That is slower than accessing a local variable and in Python 2.x the list comprehension only accesses local variables. If you are using Python 3.x the list comprehension runs in a separate function so it will also be accessing value through a closure and this difference won't apply.

    The other option to consider is to use a generator instead of a list comprehension:

    def filterbyvalue(seq, value):
       for el in seq:
           if el.attribute==value: yield el
    

    Then in your main code (which is where readability really matters) you've replaced both list comprehension and filter with a hopefully meaningful function name.

    0 讨论(0)
提交回复
热议问题