Message24059
Logged In: YES
user_id=699438
This looks like a stack overflow. There's not much python
can do when the stack runs out of memory, which is why the
default recursion limit is set to 1000.
Also, at least in the reproducable, the number you are building
is going to consume excessive amounts of memory.
I ran this test (to avoid creating a giant long number) and still
got the segfault.
from sys import *
n = 30000
setrecursionlimit(n+1)
def nofact(n):
if n==1:
return 1
return nofact(n-1)
nofact(n)
|
|
Date |
User |
Action |
Args |
2007-08-23 14:29:08 | admin | link | issue1110055 messages |
2007-08-23 14:29:08 | admin | create | |
|