Fun with Generators

Tagged:  •    •  

Sometimes I just wander around in blogs looking for cool snippets in other programming languages. Since the upcoming GNU Smalltalk 3.0 will have some features from Python and Ruby (most notably generators), it is nice to test corner cases and see if GNU Smalltalk's behavior matches what happens in other languages.

I came across two implementations of the power-set function in Python, a recursive and an iterative one:

# by Guido van Rossum
def power(s):
    if len(s) == 0:
        yield Set()
        # Non-destructively choose a random element:

Syndicate content

User login