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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
|
from pytest import raises
import types
def test_nested_scope():
x = 42
def f(): return x
assert f() == 42
def test_nested_scope2():
x = 42
y = 3
def f(): return x
assert f() == 42
def test_nested_scope3():
x = 42
def f():
def g():
return x
return g
assert f()() == 42
def test_nested_scope4():
def f():
x = 3
def g():
return x
a = g()
x = 4
b = g()
return (a, b)
assert f() == (3, 4)
def test_nested_scope_locals():
def f():
x = 3
def g():
i = x
return locals()
return g()
d = f()
assert d == {'i':3, 'x':3}
def test_deeply_nested_scope_locals():
def f():
x = 3
def g():
def h():
i = x
return locals()
return locals(), h()
return g()
outer_locals, inner_locals = f()
assert inner_locals == {'i':3, 'x':3}
keys = sorted(outer_locals.keys())
assert keys == ['h', 'x']
def test_lambda_in_genexpr():
assert [x() for x in (lambda: x for x in range(10))] == list(range(10))
def test_cell_repr():
import re
from reprlib import repr as r # Don't shadow builtin repr
def get_cell():
x = 42
def inner():
return x
return inner
x = get_cell().__closure__[0]
assert re.match(r'<cell at 0x[0-9A-Fa-f]+: int object at 0x[0-9A-Fa-f]+>', repr(x))
assert re.match(r'<cell at 0x.*\.\.\..*>', r(x))
def get_cell():
if False:
x = 42
def inner():
return x
return inner
x = get_cell().__closure__[0]
assert re.match(r'<cell at 0x[0-9A-Fa-f]+: empty>', repr(x))
def test_cell_contents():
def f(x):
def f(y):
return x + y
return f
g = f(10)
assert g.__closure__[0].cell_contents == 10
def test_set_cell_contents():
def f(x):
def g(y):
return x + y
return g
g10 = f(10)
assert g10(5) == 15
assert g10.__closure__[0].cell_contents == 10
g10.__closure__[0].cell_contents = 20
assert g10.__closure__[0].cell_contents == 20
assert g10(5) == 25
def test_del_cell_contents():
def f(x):
def g(y):
return x + y
return g
g10 = f(10)
del g10.__closure__[0].cell_contents
with raises(ValueError):
g10.__closure__[0].cell_contents
del g10.__closure__[0].cell_contents # does nothing
with raises(NameError):
g10(6)
g10.__closure__[0].cell_contents = 20
assert g10(5) == 25
def test_empty_cell_contents():
def f():
def f(y):
return x + y
return f
x = 1
g = f()
with raises(ValueError):
g.__closure__[0].cell_contents
def test_compare_cells():
def f(n):
if n:
x = n
def f(y):
return x + y
return f
empty_cell_1 = f(0).__closure__[0]
empty_cell_2 = f(0).__closure__[0]
g1 = f(1).__closure__[0]
g2 = f(2).__closure__[0]
assert g1 < g2
assert g1 <= g2
assert g2 > g1
assert g2 >= g1
assert not g1 == g2
assert g1 != g2
assert g1 == g1
assert not g1 != g1
#
assert empty_cell_1 == empty_cell_2
assert empty_cell_1 <= empty_cell_2
assert empty_cell_1 >= empty_cell_2
assert not empty_cell_1 != empty_cell_2
assert empty_cell_1 < g1
assert not g1 < empty_cell_1
assert g1 > empty_cell_1
assert not empty_cell_1 > g1
assert empty_cell_1 <= g1
assert not g1 <= empty_cell_1
assert g1 >= empty_cell_1
assert not empty_cell_1 >= g1
def test_leaking_class_locals():
def f(x):
class X:
x = 12
def f(self):
return x
locals()
return X
assert f(1).x == 12
def test_nested_scope_locals_mutating_cellvars():
def f():
x = 12
def m():
locals()
x
locals()
return x
return m
assert f()() == 12
def test_unbound_local_after_del():
"""
# #4617: It is now legal to delete a cell variable.
# The following functions must obviously compile,
# and give the correct error when accessing the deleted name.
def errorInOuter():
y = 1
del y
print(y)
def inner():
return y
def errorInInner():
def inner():
return y
y = 1
del y
inner()
raises(UnboundLocalError, "errorInOuter()")
raises(NameError, "errorInInner()")
"""
def test_new_cell():
c = types.CellType(1)
assert c.cell_contents == 1
def test_cell_richcmp():
class A:
def __le__(self, other):
return 12
assert (types.CellType(A()) <= types.CellType(A())) == 12
|
