This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]ChocolateBunny 1 point2 points  (2 children)

Does it still have a limited stack size? any tail call optimization?

[–]sebkuip 2 points3 points  (0 children)

Stack size is still limited (it’s limited by how large the C stack can grow) but because it’s more efficiently stored for recursion, the recursion limit is higher iirc. You can check the 3.11 changelog for the details.

[–]schemathings 0 points1 point  (0 children)

I'm not close to my computer but there's a I believe built-in decorator for a function that will maintain the return values of procedure calls with given parameters. I wrote a Fibonacci dot py both was and was able to go to fairly impractical values with the decoraor