News for hackers. Stuff that matters.

A comment on Optimizing the any function in python. Parent comment

Re:Optimizing the any function in python by detaro on Thursday October 18, 2018 @09:15AM (#18248007)
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)])
[ Parent | on HN ]
Re:Optimizing the any function in python by ospohngellert on Thursday October 18, 2018 @09:35AM (#18248162)
Yeah, sorry. Looking back into it looks like I was really re-inventing the wheel here. Still a fun exercise for me. Thanks :)
[ Parent | on HN ]
Re:Optimizing the any function in python by ospohngellert on Thursday October 18, 2018 @09:29AM (#18248114)
The first one is clearly easier to read than the second. However the first one is slow. I believe fast_any is easier to read than generator code.
[ Parent | on HN ]
Re:Optimizing the any function in python by ospohngellert on Thursday October 18, 2018 @09:32AM (#18248132)
Actually, apologies I see now. I always associated generator's with the `yields` keyword, but maybe I have to look into them again. Thanks!
[ Parent | on HN ]
Re:Optimizing the any function in python by detaro on Thursday October 18, 2018 @09:31AM (#18248124)
The first IS generator code. That's a generator expression, note that it does not have the [] of a list expression.
[ Parent | on HN ]