[Oren Tirosh] > My implementation from http://www.tothink.com/python/dataflow/xlazy.py: > [...] Special-casing the 2 argument case helps a lot. Good idea! I added such speed-up code for cartesians, subsets and permutations, and am now seeking how to do it (nicely) for combinations and arrangements as well. > Slurping the tail into a list loses the lazy efficiency of this function. Generators are an elegant way to be lazy. I agree that we are likely to loose something if we attempt to do too much, too soon. -- François Pinard http://www.iro.umontreal.ca/~pinard
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