Message158350
| Author |
terry.reedy |
| Recipients |
ezio.melotti, kristjan.jonsson, meador.inge, pitrou, progrper, rhettinger, terry.reedy |
| Date |
2012年04月15日.18:32:55 |
| SpamBayes Score |
-1.0 |
| Marked as misclassified |
Yes |
| Message-id |
<1334514777.54.0.244052029761.issue14507@psf.upfronthosting.co.za> |
| In-reply-to |
| Content |
[Raymond: I presume you meant that C iterators have not been a problem in the wild and have done fine.]
The RuntimeError message "maximum recursion depth exceeded" is not exactly correct. As Kristján implied in his first message, what has been reached is the maximum call stack or nested call depth. It happens to be that recursive calls are the easiest way to do that, but Python makes it somewhat easy to dynamically generate thousands of different callables making thousands of non-recursive nested calls. (A static expression with even 100 nested calls fails compilation with a MemoryError (3.2.3).) |
|