A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://mail.python.org/pipermail/python-dev/2000-August/009012.html below:

[Python-Dev] stack check on Unix: any suggestions?

[Python-Dev] stack check on Unix: any suggestions? [Python-Dev] stack check on Unix: any suggestions?Barry A. Warsaw bwarsaw@beopen.com
Thu, 31 Aug 2000 11:53:19 -0400 (EDT)
>>>>> "GS" == Greg Stein <gstein@lyra.org> writes:

    GS> 10k iterations on my linux box

9143 on mine.

I'll note that Emacs has a similar concept, embodied in
max-lisp-eval-depth.  The documentation for this variable clearly
states that its purpose is to avoid infinite recursions that would
overflow the C stack and crash Emacs.  On my XEmacs 21.1.10,
max-lisp-eval-depth is 500.  Lisp tends to be more recursive than
Python, but it's also possible that there are fewer ways to `hide'
lots of C stack between Lisp function calls.

So random.choice(range(500, 9143)) seems about right to me <wink>.

-Barry



RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4