Message237898
I found a simpler one, like Amaury's eval("+1" * 748580):
def f(x):
y = x+x+x+x+x
return y
print f(0)
(Except there are 74875 x+'s. This is exactly enough for a segfault, one less runs fine.)
I've tried something like:
loopcount = 0
loopcount += (1-a36)*(a37)*(1-a41)
...
return loopcount
It works, but it's still pretty slow. (At least it doesn't crash.) I tried converting to C with Cython, but it's too big to be processed in a reasonable amount of time, but this is irrelevant to the bug. |
|
Date |
User |
Action |
Args |
2015-03-11 18:26:11 | Michael Klein | set | recipients:
+ Michael Klein, ronaldoussoren, amaury.forgeotdarc, ned.deily, SilentGhost |
2015-03-11 18:26:11 | Michael Klein | set | messageid: <1426098371.73.0.59418391959.issue23643@psf.upfronthosting.co.za> |
2015-03-11 18:26:11 | Michael Klein | link | issue23643 messages |
2015-03-11 18:26:11 | Michael Klein | create | |
|