On Wed, 12 Jul 2000, Paul Prescod wrote: > Moshe Zadka wrote: > > > > What would people think about xmap(), which acts anologously to xrange(), > > IOW calculate lazilly instead of eagerly? Or even, calculate "on demand", > > without caching: > > .... > > Wouldn't this solve the parallel iteration problem? > > I don't think that using a function called "xmap" to build tuples is > very intuitive to start with. What's so wrong with a builtin called > "tuples()"? The name isn't so important -- what is more important is the lazy aspect of the thing. (And anyway, map/xmap is more general then tuples: def tuples(*lists): apply(map, (None,)+lists) ) and I see no reason not to support the stronger construct -- tuples could be build above it. -- Moshe Zadka <moshez@math.huji.ac.il> There is no GOD but Python, and HTTP is its prophet. http://advogato.org/person/moshez
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