blob: e43f593b85ce9aa557583acdf613d7f6f5d194a6 [file] [log] [blame]
Raymond Hettinger354433a2004-05-19 08:20:33 +00001doctests = """
2
3Test simple loop with conditional
4
5 >>> sum(i*i for i in range(100) if i&1 == 1)
6 166650
7
8Test simple nesting
9
10 >>> list((i,j) for i in range(3) for j in range(4) )
11 [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 3)]
12
13Test nesting with the inner expression dependent on the outer
14
15 >>> list((i,j) for i in range(4) for j in range(i) )
16 [(1, 0), (2, 0), (2, 1), (3, 0), (3, 1), (3, 2)]
17
18Make sure the induction variable is not exposed
19
20 >>> i = 20
21 >>> sum(i*i for i in range(100))
22 328350
23 >>> i
24 20
25
26Test first class
27
28 >>> g = (i*i for i in range(4))
29 >>> type(g)
30 <type 'generator'>
31 >>> list(g)
32 [0, 1, 4, 9]
33
34Test direct calls to next()
35
36 >>> g = (i*i for i in range(3))
37 >>> g.next()
38 0
39 >>> g.next()
40 1
41 >>> g.next()
42 4
43 >>> g.next()
44 Traceback (most recent call last):
45 File "<pyshell#21>", line 1, in -toplevel-
46 g.next()
47 StopIteration
48
49Does it stay stopped?
50
51 >>> g.next()
52 Traceback (most recent call last):
53 File "<pyshell#21>", line 1, in -toplevel-
54 g.next()
55 StopIteration
56 >>> list(g)
57 []
58
59Test running gen when defining function is out of scope
60
61 >>> def f(n):
62 ... return (i*i for i in xrange(n))
Raymond Hettinger354433a2004-05-19 08:20:33 +000063 >>> list(f(10))
64 [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
65
66 >>> def f(n):
67 ... return ((i,j) for i in xrange(3) for j in xrange(n))
Raymond Hettinger354433a2004-05-19 08:20:33 +000068 >>> list(f(4))
69 [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 3)]
70 >>> def f(n):
71 ... return ((i,j) for i in xrange(3) for j in xrange(4) if j in xrange(n))
Raymond Hettinger354433a2004-05-19 08:20:33 +000072 >>> list(f(4))
73 [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 3)]
74 >>> list(f(2))
75 [(0, 0), (0, 1), (1, 0), (1, 1), (2, 0), (2, 1)]
76
Raymond Hettinger3258e722004-08-16 01:35:28 +000077Verify that parenthesis are required in a statement
78>>> def f(n):
79... return i*i for i in xrange(n)
80Traceback (most recent call last):
81 ...
82SyntaxError: invalid syntax
Raymond Hettinger354433a2004-05-19 08:20:33 +000083
84Verify early binding for the outermost for-expression
85
86 >>> x=10
87 >>> g = (i*i for i in range(x))
88 >>> x = 5
89 >>> list(g)
90 [0, 1, 4, 9, 16, 25, 36, 49, 64, 81]
91
Raymond Hettinger83ee7952004-05-20 23:04:13 +000092Verify that the outermost for-expression makes an immediate check
93for iterability
94
95 >>> (i for i in 6)
96 Traceback (most recent call last):
97 File "<pyshell#4>", line 1, in -toplevel-
98 (i for i in 6)
99 TypeError: iteration over non-sequence
100
Raymond Hettinger354433a2004-05-19 08:20:33 +0000101Verify late binding for the outermost if-expression
102
103 >>> include = (2,4,6,8)
104 >>> g = (i*i for i in range(10) if i in include)
105 >>> include = (1,3,5,7,9)
106 >>> list(g)
107 [1, 9, 25, 49, 81]
108
109Verify late binding for the innermost for-expression
110
111 >>> g = ((i,j) for i in range(3) for j in range(x))
112 >>> x = 4
113 >>> list(g)
114 [(0, 0), (0, 1), (0, 2), (0, 3), (1, 0), (1, 1), (1, 2), (1, 3), (2, 0), (2, 1), (2, 2), (2, 3)]
115
116Verify re-use of tuples (a side benefit of using genexps over listcomps)
117
118 >>> tupleids = map(id, ((i,i) for i in xrange(10)))
119 >>> max(tupleids) - min(tupleids)
120 0
121
122
123
124########### Tests borrowed from or inspired by test_generators.py ############
125
126Make a generator that acts like range()
127
128 >>> yrange = lambda n: (i for i in xrange(n))
129 >>> list(yrange(10))
130 [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
131
132Generators always return to the most recent caller:
133
134 >>> def creator():
135 ... r = yrange(5)
136 ... print "creator", r.next()
137 ... return r
Raymond Hettinger354433a2004-05-19 08:20:33 +0000138 >>> def caller():
139 ... r = creator()
140 ... for i in r:
141 ... print "caller", i
Raymond Hettinger354433a2004-05-19 08:20:33 +0000142 >>> caller()
143 creator 0
144 caller 1
145 caller 2
146 caller 3
147 caller 4
148
149Generators can call other generators:
150
151 >>> def zrange(n):
152 ... for i in yrange(n):
153 ... yield i
Raymond Hettinger354433a2004-05-19 08:20:33 +0000154 >>> list(zrange(5))
155 [0, 1, 2, 3, 4]
156
157
158Verify that a gen exp cannot be resumed while it is actively running:
159
160 >>> g = (me.next() for i in xrange(10))
161 >>> me = g
162 >>> me.next()
163 Traceback (most recent call last):
164 File "<pyshell#30>", line 1, in -toplevel-
165 me.next()
166 File "<pyshell#28>", line 1, in <generator expression>
167 g = (me.next() for i in xrange(10))
168 ValueError: generator already executing
169
170Verify exception propagation
171
172 >>> g = (10 // i for i in (5, 0, 2))
173 >>> g.next()
174 2
175 >>> g.next()
176 Traceback (most recent call last):
177 File "<pyshell#37>", line 1, in -toplevel-
178 g.next()
179 File "<pyshell#35>", line 1, in <generator expression>
180 g = (10 // i for i in (5, 0, 2))
181 ZeroDivisionError: integer division or modulo by zero
182 >>> g.next()
183 Traceback (most recent call last):
184 File "<pyshell#38>", line 1, in -toplevel-
185 g.next()
186 StopIteration
187
188Make sure that None is a valid return value
189
190 >>> list(None for i in xrange(10))
191 [None, None, None, None, None, None, None, None, None, None]
192
193Check that generator attributes are present
194
195 >>> g = (i*i for i in range(3))
196 >>> expected = set(['gi_frame', 'gi_running', 'next'])
197 >>> set(attr for attr in dir(g) if not attr.startswith('__')) >= expected
198 True
199
200 >>> print g.next.__doc__
201 x.next() -> the next value, or raise StopIteration
202 >>> import types
203 >>> isinstance(g, types.GeneratorType)
204 True
205
206Check the __iter__ slot is defined to return self
207
208 >>> iter(g) is g
209 True
210
211Verify that the running flag is set properly
212
213 >>> g = (me.gi_running for i in (0,1))
214 >>> me = g
215 >>> me.gi_running
216 0
217 >>> me.next()
218 1
219 >>> me.gi_running
220 0
221
222Verify that genexps are weakly referencable
223
224 >>> import weakref
225 >>> g = (i*i for i in range(4))
226 >>> wr = weakref.ref(g)
227 >>> wr() is g
228 True
229 >>> p = weakref.proxy(g)
230 >>> list(p)
231 [0, 1, 4, 9]
232
233
234"""
235
236
237__test__ = {'doctests' : doctests}
238
239def test_main(verbose=None):
240 import sys
241 from test import test_support
242 from test import test_genexps
243 test_support.run_doctest(test_genexps, verbose)
244
245 # verify reference counting
246 if verbose and hasattr(sys, "gettotalrefcount"):
247 import gc
248 counts = [None] * 5
249 for i in xrange(len(counts)):
250 test_support.run_doctest(test_genexps, verbose)
251 gc.collect()
252 counts[i] = sys.gettotalrefcount()
253 print counts
254
255if __name__ == "__main__":
256 test_main(verbose=True)