python 高級特性：Generator(生成器)

格式對比：

    List Imprehensions 格式：[ 語句 for .. in ..]

    Generator 格式：（語句 for .. in ..）

區(qū)別：List存儲的是具體內(nèi)容，每個元素都占用空間，當(dāng)需要存儲N條數(shù)據(jù)時，占用空間大

            而Generator存儲的是表達式，通過計算而推算出下個元素，因此占空間少。

一、2種輸入方式

#!/usr/bin/python

#generator.next()輸出：很痛苦的方式
g = (x for x in range(0, 10))
print "g:"
print "1g.next():", g.next();
print "2g.next():", g.next();
print "3g.next():", g.next();
print "4g.next():", g.next();
print "5g.next():", g.next();
print "6g.next():", g.next();
print "7g.next():", g.next();
print "8g.next():", g.next();
print "9g.next():", g.next();
print "10g.next():", g.next();
#print "11g.next():", g.next();  --->超范圍后，提示 StopIteration

可見 generator是從中斷處繼續(xù)向下執(zhí)行。

#for循環(huán)輸出

k = (x for x in range(0, 10))
for x in k:
    print x

二、斐波拉契數(shù)列：list 與 generator對比

##Fibonacci : 1 2 3 5 8 13 21 ..

##in list
def fib(n):
    i, a, b = 0, 0, 1;
    print "in list:"
    while i < n:
        print b;
        a, b = b, a+b
        i += 1;

print fib(6);

##in generator  -----> yield ：generator標(biāo)志
def fibo(n):
    i, a, b = 0, 0, 1;
    print "in generator:"
    while i < n:
        yield b;
        a, b = b, a+b
        i += 1;
for n in fibo(6):
    print n;