Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
590 views
in Technique[技术] by (71.8m points)

iterator - Why does Python's itertools.cycle need to create a copy of the iterable?

The documentation for Python's itertools.cycle() gives a pseudo-code implementation as:

def cycle(iterable):
    # cycle('ABCD') --> A B C D A B C D A B C D ...
    saved = []
    for element in iterable:
        yield element
        saved.append(element)
    while saved:
        for element in saved:
              yield element

Below, it states: "Note, this member of the toolkit may require significant auxiliary storage (depending on the length of the iterable)."

I basically was going down this path, except I did this, which does not require creating a copy of the iterable:

def loop(iterable):
    it = iterable.__iter__()

    while True:
        try:
            yield it.next()
        except StopIteration:
            it = iterable.__iter__()
            yield it.next()

x = {1, 2, 3}

hard_limit = 6
for i in loop(x):
    if hard_limit <= 0:
        break

    print i
    hard_limit -= 1

prints:

1
2
3
1
2
3

Yes, I realize my implementation wouldn't work for str's, but it could be made to. I'm more curious as to why it creates another copy. I have a feeling it has to do with garbage collection, but I'm not well studied in this area of Python.

Thanks!

See Question&Answers more detail:os

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)

Iterables can only be iterated over once.

You create a new iterable in your loop instead. Cycle cannot do that, it has to work with whatever you passed in. cycle cannot simply recreate the iterable. It thus is forced to store all the elements the original iterator produces.

If you were to pass in the following generator instead, your loop() fails:

def finite_generator(source=[3, 2, 1]):
    while source:
        yield source.pop()

Now your loop() produces:

>>> hard_limit = 6
>>> for i in loop(finite_generator()):
...     if hard_limit <= 0:
...         break
...     print i
...     hard_limit -= 1
... 
1
2
3

Your code would only work for sequences, for which using cycle() would be overkill; you don't need the storage burden of cycle() in that case. Simplify it down to:

def loop_sequence(seq):
    while True:
        for elem in seq:
            yield elem

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...