On Tuesday 21 October 2003 05:59 pm, Phillip J. Eby wrote: ... > If you make it a list that's lazy, it doesn't lose the memory allocation > overhead for the list. If I understand Alex's benchmarks, making a lazy > list would end up being *slower* than list comprehension is now. No, my benchmarks show that NOT having to "incarnate" the list, when all you do is loop on it, is a modest but repeatable win (20%-30% or so). Alex
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4