Does itertools.product evaluate its arguments lazily?

前端 未结 3 1104
感情败类
感情败类 2020-12-03 22:49

The following never prints anything in Python 3.6

from itertools import product, count

for f in product(count(), [1,2]): 
    print(f)

Ins

相关标签:
3条回答
  • 2020-12-03 23:10

    itertools.product generates its results lazily, but this is not true for the arguments. They are evaluated eagerly. Each iterable argument is first converted to a tuple:

    The evaluation of the arguments (not the production of results) is very similar to the Python implementation shown in the docs:

    ...
    pools = [tuple(pool) for pool in args] * repeat
    

    Whereas, in the CPython implementation, pools is a tuple of tuples:

    for (i=0; i < nargs ; ++i) {
         PyObject *item = PyTuple_GET_ITEM(args, i);
         PyObject *pool = PySequence_Tuple(item);   /* here */
         if (pool == NULL)
             goto error;
         PyTuple_SET_ITEM(pools, i, pool);
         indices[i] = 0;
     }
    

    This is so since product sometimes needs to go over an iterable more than once, which is not possible if the arguments were left as iterators that can only be consumed once.

    You practically cannot build a tuple from an itertools.count object. Consider slicing to a reasonable length with itertools.islice before passing to product.

    0 讨论(0)
  • 2020-12-03 23:15

    I found that

    for tup in ((x,y) for x in count() for y in [1,2]):
        print(tup)
    

    does what I expect. This is odd given that it is listed as equivelent in the docs. This seems like a bug in itertools.product, but it seems unlikely given how standard it is.

    0 讨论(0)
  • 2020-12-03 23:16

    The issue seems to be that product never returns an iterator

    No, product is already "lazy".

    The issue is thatcount() counts to infinity. From count's docs:

    Equivalent to:

    def count(start=0, step=1):
        # count(10) --> 10 11 12 13 14 ...
        # count(2.5, 0.5) -> 2.5 3.0 3.5 ...
        n = start
        while True:
            yield n
            n += step
    

    You code is basically the same as doing:

    def count():
        i = 0
        while True:
            yield i
            i += 1
    
    count()
    
    0 讨论(0)
提交回复
热议问题