Optimizing the any function in python

Optimizing the any function in python(oliverspohngellert.com)

1 points by ospohngellert 7 years ago | 7 comments

detaro 7 years ago |

So you're artificially building something that's gives you some of the benefit of using a generator expression in a list expression, instead of just using a generator expression?

ospohngellert 7 years ago | |

I wouldn't call it artificially building something, but I suppose yes. I also find this code to be much more readable than generator code. Once you understand the function, all you have to do is pass it a function that returns a boolean.

detaro 7 years ago | | |

How is

    any(function_takes_time(i) for i in range(10 ** 3))

harder to read than

    fast_any([(lambda x: (lambda: function_takes_time(x)))(i) for i in range(10 ** 3)])