mirrors
/
micropython
mirror of https://github.com/micropython/micropython.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

tests/recursive_iternext.py: Make low-heap friendly.

This commit is contained in:
Paul Sokolovsky 2016-02-13 15:50:22 +02:00
parent db984b73f3
commit b86c20676e
1 changed files with 10 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
tests/misc/recursive_iternext.py
View File

@ -1,8 +1,14 @@
# This tests that recursion with iternext doesn't lead to segfault. # This tests that recursion with iternext doesn't lead to segfault.
try:
[0] * 10000
N = 1000
except:
N = 100
try: try:
x = (1, 2) x = (1, 2)
for i in range(1000): for i in range(N):
x = enumerate(x) x = enumerate(x)
tuple(x) tuple(x)
except RuntimeError: except RuntimeError:
@ -10,7 +16,7 @@ except RuntimeError:
try: try:
x = (1, 2) x = (1, 2)
for i in range(1000): for i in range(N):
x = filter(None, x) x = filter(None, x)
tuple(x) tuple(x)
except RuntimeError: except RuntimeError:
@ -18,7 +24,7 @@ except RuntimeError:
try: try:
x = (1, 2) x = (1, 2)
for i in range(1000): for i in range(N):
x = map(max, x, ()) x = map(max, x, ())
tuple(x) tuple(x)
except RuntimeError: except RuntimeError:
@ -26,7 +32,7 @@ except RuntimeError:
try: try:
x = (1, 2) x = (1, 2)
for i in range(1000): for i in range(N):
x = zip(x) x = zip(x)
tuple(x) tuple(x)
except RuntimeError: except RuntimeError: