[Stackless] infinite recursion

Christian Tismer tismer at tismer.com
Fri Jun 13 01:42:58 CEST 2003


Hi John,

> Use an iterative solution? ;-)

Surely, this is almost always possible.
But in this case, I assume that Chao Heng
just wnated to figure out Stackless' capabilites, which
I think is a pretty acceptable approach, which I should
support.
And with 3.0, he *will* get a recursion depth of 1.000.000
or more, with ease.

ciao -- chris

-- 
Christian Tismer             :^)   <mailto:tismer at tismer.com>
Mission Impossible 5oftware  :     Have a break! Take a ride on Python's
Johannes-Niemeyer-Weg 9a     :    *Starship* http://starship.python.net/
14109 Berlin                 :     PGP key -> http://wwwkeys.pgp.net/
work +49 30 89 09 53 34  home +49 30 802 86 56  pager +49 173 24 18 776
PGP 0x57F3BF04       9064 F4E1 D754 C2FF 1619  305B C09C 5A3B 57F3 BF04
      whom do you want to sponsor today?   http://www.stackless.com/


_______________________________________________
Stackless mailing list
Stackless at www.tismer.com
http://www.tismer.com/mailman/listinfo/stackless




More information about the Stackless mailing list