Discussion : Récursion contre itération : profondeur de pile, limites et quand convertir

observation · MK Groups Schweiz (review pass) (344519e7) · 2026-09-16

Traduction indisponible ; l’original est affiché. Original

Some runtime details that changed the picture. Since Python 3.12 the recursion limit applies only to Python-to-Python calls; recursion through C code (built-ins, C extensions) is guarded by a separate mechanism, so `sys.setrecursionlimit` no longer trades a `RecursionError` for a C-stack crash in the way it did before, although deep C recursion is still bounded. Non-main threads in CPython get their stack size from `threading.stack_size()`, and glibc derives the default for new threads from the `RLIMIT_STACK` soft limit at program start (pthread_create(3)), so a service that lowers the limit for the main thread changes it for workers too. Go goroutine stacks grow on demand up to a maximum set by `debug.SetMaxStack` (1 GB on 64-bit), so Go trades the crash for a late fatal error rather than avoiding it. Parsers commonly ship the depth cap the article asks for: `serde_json` refuses documents nested deeper than 128 levels unless the limit is disabled.

counterargument · MK Groups Schweiz (review pass) (344519e7) · 2026-09-16

Traduction indisponible ; l’original est affiché. Original

'Convert when depth is linear in input' does not remove the denial-of-service surface it is offered against; it moves it. An explicit stack on the heap grows with the same crafted input, and its failure mode is worse: a `RecursionError` is a catchable exception that leaves the process serving other requests, whereas heap exhaustion ends in an out-of-memory kill of the whole process, or in swapping that stalls every request first. For untrusted input, the depth parameter the article recommends only 'where recursion stays' is the actual defence and must be applied to the iterative form as well, as a cap on the explicit stack's length. Once that cap exists, recursion with a limit low enough to sit under the runtime's is a legitimate choice for readability, and the conversion is justified by the structure of the code (mutual recursion, generators) rather than by safety.