sources for test_generator_nested.py [rev. unknown]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162

from __future__ import generators

import py

try:

    from py.magic import greenlet

except (ImportError, RuntimeError), e:

    py.test.skip(str(e))

class genlet(greenlet):

    def __init__(self, *args, **kwds):

        self.args = args

        self.kwds = kwds

        self.child = None

    def run(self):

        fn, = self.fn

        fn(*self.args, **self.kwds)

    def __iter__(self):

        return self

    def set_child(self, child):

        self.child = child

    def next(self):

        if self.child:

            child = self.child

            while child.child:

                tmp = child

                child = child.child

                tmp.child = None

            result = child.switch()

        else:

            self.parent = greenlet.getcurrent()

            result = self.switch()

        if self:

            return result

        else:

            raise StopIteration

def Yield(value, level = 1):

    g = greenlet.getcurrent()

    while level != 0:

        if not isinstance(g, genlet):

            raise RuntimeError, 'yield outside a genlet'

        if level > 1:

            g.parent.set_child(g)

        g = g.parent

        level -= 1

    g.switch(value)

def Genlet(func):

    class Genlet(genlet):

        fn = (func,)

    return Genlet

# ____________________________________________________________

def g1(n, seen):

    for i in range(n):

        seen.append(i+1)

        yield i

def g2(n, seen):

    for i in range(n):

        seen.append(i+1)

        Yield(i)

g2 = Genlet(g2)

def nested(i):

    Yield(i)

def g3(n, seen):

    for i in range(n):

        seen.append(i+1)

        nested(i)

g3 = Genlet(g3)

def test_genlet_simple():

    for g in [g1, g2, g3]:

        seen = []

        for k in range(3):

            for j in g(5, seen):

                seen.append(j)

        assert seen == 3 * [1, 0, 2, 1, 3, 2, 4, 3, 5, 4]

def test_genlet_bad():

    try:

        Yield(10)

    except RuntimeError:

        pass

test_genlet_bad()

test_genlet_simple()

test_genlet_bad()

def a(n):

    if n == 0:

        return

    for ii in ax(n-1):

        Yield(ii)

    Yield(n)

ax = Genlet(a)

def test_nested_genlets():

    seen = []

    for ii in ax(5):

        seen.append(ii)

test_nested_genlets()

def perms(l):

    if len(l) > 1:

        for e in l:

            # No syntactical sugar for generator expressions

            [Yield([e] + p) for p in perms([x for x in l if x!=e])]

    else:

        Yield(l)

perms = Genlet(perms)

def test_perms():

    gen_perms = perms(range(4))

    permutations = list(gen_perms)

    assert len(permutations) == 4*3*2*1

    assert [0,1,2,3] in permutations

    assert [3,2,1,0] in permutations

    res = []

    for ii in zip(perms(range(4)), perms(range(3))):

        res.append(ii)

    # XXX Test to make sure we are working as a generator expression

test_perms()

def gr1(n):

    for ii in range(1, n):

        Yield(ii)

        Yield(ii * ii, 2)

gr1 = Genlet(gr1)

def gr2(n, seen):

    for ii in gr1(n):

        seen.append(ii)

gr2 = Genlet(gr2)

def test_layered_genlets():

    seen = []

    for ii in gr2(5, seen):

        seen.append(ii)

    assert seen == [1, 1, 2, 4, 3, 9, 4, 16]

test_layered_genlets()