Re:Optimizing the any function in python
by detaro on Thursday October 18, 2018 @08:51AM
(#18247857)
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?
[ Parent
| on HN ]
Re:Optimizing the any function in python
by ospohngellert on Thursday October 18, 2018 @09:05AM
(#18247952)
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.
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)])
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 :)
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.
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!