Is there any good methods to place recursion stack on heap to prevent stack overflowing?
Of course, there is method to store own stack and place there function's variables (frame) and just simulate recursion, and, by all appearances, I'm looking for something like decorator, which will do it automatically.
There are a few options here.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.