我最喜欢的用法是“过滤”和“减少”操作。

假设我们正在读取一个文件，并且只想要以“##”开头的行。

def filter2sharps( aSequence ):
    for l in aSequence:
        if l.startswith("##"):
            yield l

然后，我们可以在适当的循环中使用生成器函数

source= file( ... )
for line in filter2sharps( source.readlines() ):
    print line
source.close()

reduce的例子类似。假设我们有一个文件，其中我们需要定位<Location>…< / >位置线。[不是HTML标签，而是恰好看起来像标签的行。]

def reduceLocation( aSequence ):
    keep= False
    block= None
    for line in aSequence:
        if line.startswith("</Location"):
            block.append( line )
            yield block
            block= None
            keep= False
        elif line.startsWith("<Location"):
            block= [ line ]
            keep= True
        elif keep:
            block.append( line )
        else:
            pass
    if block is not None:
        yield block # A partial block, icky

同样，我们可以在一个合适的for循环中使用这个生成器。

source = file( ... )
for b in reduceLocation( source.readlines() ):
    print b
source.close()

其思想是，生成器函数允许我们过滤或减少序列，每次生成一个值的另一个序列。

请参阅PEP 255中的“动机”部分。

生成器的一个不太明显的用途是创建可中断函数，它允许您在不使用线程的情况下“同时”执行更新UI或运行多个作业(实际上是交错的)。

我最喜欢的用法是“过滤”和“减少”操作。

假设我们正在读取一个文件，并且只想要以“##”开头的行。

def filter2sharps( aSequence ):
    for l in aSequence:
        if l.startswith("##"):
            yield l

然后，我们可以在适当的循环中使用生成器函数

source= file( ... )
for line in filter2sharps( source.readlines() ):
    print line
source.close()

reduce的例子类似。假设我们有一个文件，其中我们需要定位<Location>…< / >位置线。[不是HTML标签，而是恰好看起来像标签的行。]

def reduceLocation( aSequence ):
    keep= False
    block= None
    for line in aSequence:
        if line.startswith("</Location"):
            block.append( line )
            yield block
            block= None
            keep= False
        elif line.startsWith("<Location"):
            block= [ line ]
            keep= True
        elif keep:
            block.append( line )
        else:
            pass
    if block is not None:
        yield block # A partial block, icky

同样，我们可以在一个合适的for循环中使用这个生成器。

source = file( ... )
for b in reduceLocation( source.readlines() ):
    print b
source.close()

其思想是，生成器函数允许我们过滤或减少序列，每次生成一个值的另一个序列。

生成器提供惰性求值。你可以通过对它们进行迭代来使用它们，或者显式地使用'for'，或者隐式地将它传递给任何迭代的函数或构造。您可以将生成器视为返回多个项，就像它们返回一个列表一样，但它们不是一次返回所有项，而是一个接一个地返回它们，并且生成器函数将暂停，直到请求下一个项。

生成器很适合计算大量结果集(特别是涉及循环本身的计算)，因为您不知道是否需要所有结果，或者您不想同时为所有结果分配内存。或者在发电机使用另一个发电机，或者消耗其他资源的情况下，如果发生得越晚越方便。

Another use for generators (that is really the same) is to replace callbacks with iteration. In some situations you want a function to do a lot of work and occasionally report back to the caller. Traditionally you'd use a callback function for this. You pass this callback to the work-function and it would periodically call this callback. The generator approach is that the work-function (now a generator) knows nothing about the callback, and merely yields whenever it wants to report something. The caller, instead of writing a separate callback and passing that to the work-function, does all the reporting work in a little 'for' loop around the generator.

For example, say you wrote a 'filesystem search' program. You could perform the search in its entirety, collect the results and then display them one at a time. All of the results would have to be collected before you showed the first, and all of the results would be in memory at the same time. Or you could display the results while you find them, which would be more memory efficient and much friendlier towards the user. The latter could be done by passing the result-printing function to the filesystem-search function, or it could be done by just making the search function a generator and iterating over the result.

如果您想查看后两种方法的示例，请参阅os.path.walk()(带有回调的旧文件系统遍历函数)和os.walk()(新的文件系统遍历生成器)。当然，如果你真的想收集一个列表中的所有结果，生成器方法转换为大列表方法是微不足道的:

big_list = list(the_generator)

缓冲。当以大块获取数据是有效的，但以小块处理数据时，生成器可能会有所帮助:

def bufferedFetch():
  while True:
     buffer = getBigChunkOfData()
     # insert some code to break on 'end of data'
     for i in buffer:    
          yield i

上面的方法可以让您轻松地将缓冲与处理分开。消费者函数现在可以一个一个地获取值，而不用担心缓冲。

也适用于打印到n的质数:

def genprime(n=10):
    for num in range(3, n+1):
        for factor in range(2, num):
            if num%factor == 0:
                break
        else:
            yield(num)

for prime_num in genprime(100):
    print(prime_num)