really excited about the Rust alloca! RFC (https://github.com/rust-lang/rfcs/pull/1808 …); it'll make it possible to allocate a linked list or a tree w/o heap...
-
-
The latter can be fixed with -fstack-check type solution, but the former requires knowledge of stack limits.
-
And even if you avoid the limit, once you alloca successfully, next stack frame may run out of fixed-size space.
-
this also applies to recursive algorithms
-
Yes. Recursion considered harmful. (Sshhh, don't tell the functional crowd.)
-
languages that cannot manage their stack properly considered harmful ;p
-
If you want a "managed stack", there go your performance benefits over using an allocator. :-)
-
whut? I want reliable stack overflow checking, that's it
-
Overflow checking that traps/crashes is easy. Making () operator something that can fail & report failure is not.
- 6 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.