"D. S. McNeil" <[email protected]> writes: > On Fri, Jun 1, 2012 at 10:59 AM, Jeroen Demeyer <[email protected]> > wrote: > >> Looks like an infinite recursion, leading to stack exhaustion, leading >> to a SIGSEGV: > > I agree with the last two but not the first. I think it's just a > really long LazyBinop chain, which is why I was having trouble > debugging the problematic part of polynomial_element.pyx: > > elif (d < 4 or d > 50000) and self._compiled is None: > while i >= 0: > result = result * a + self[i] > i -= 1 > > Even putting in print statements triggered "unlazification", or > whatever the word is (evaluation?), which blew the stack. For > example:
I think in the functional programming world they say "forcing thunks". -Keshav ---- Join us in #sagemath on irc.freenode.net ! -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
