Python迭代器（斐波拉切数列实例）

class Fibs:
    def __init__(self, n=10):
        self.a = 0
        self.b = 1
        self.n = n
    def __iter__(self):
        return self
    def __next__(self):
        self.a, self.b = self.b, self.a + self.b
        if self.a > self.n:
            raise StopIteration
        return self.a

    
>>> fibs = Fibs(100)
>>> for each in fibs:
    print(each)

1
1
2
3
5
8
13
21
34
55
89
>>>