斐波那契的例子说明生成器

#Author:donghuiya#用斐波那契的例子说明迭代器与生成器def fib(max):    n,a,b=0,0,1    while n<max:        yield b        a,b=b,a+b#t[]=[b,a+b] a=t[0] b=t[1]        n=n+1    return '----------done--------'g=fib(6)#把g转译成一个genetor，得到fib的地址，继续执行下一行代码while True:#异常处理    try:        x=next(g)#回到fib（）函数        print("g:",x)    except StopIteration as e:        print("Genetor stop value:",e.value)        break# print(g.__next__())# print(g.__next__())# print(g.__next__())# print(g.__next__())# print(g.__next__())# print(g.__next__())# print(g.__next__())