3 ms·

> In the latter case you are definitely screwed No, you're not. You just have to handle the case of not having heap memory to spare. If you were out of _stack_

> In the latter case you are definitely screwed No, you're not. You just have to handle the case of not having heap memory to spare. If you were out of _stack_ space, now that's being screwed. > and Rust's choice here is fine Of course it's fine - for a language that doesn't claim to be safe. So, for Rust, it is not fine. > any imagined recovery is a fantasy That is the attitude of people who write non-critical applications where it's ok to be lazy and just let the process die and restart things. It is not fantasy, it is not imaginary, and it is quite doable (except in corner cases of tiny machines for which 4 KB is a lot, in which case you would probably not do dynamic memory management on a heap anyway).

tialaramex 3y ago
> You just have to handle the case of not having heap memory to spare You have to successfully handle this case. Rust already handles this case by panicking, which you've unilaterally decided isn't safe for some reason. If that's not good enough you need to succeed. You must conjure the 4kB from nowhere. Show us all how it's done, or, and this might be the better choice, slink away to your fantasy land. You are right at the end though, if you can't accept that running out of memory might happen what you do about that isn't dream up miraculous ways to "handle" it, you don't do dynamic allocations. Which of course works just fine in Rust.
- Strom 3y ago
  Dynamic allocations work fine in a memory constrained environment. Successful handling can mean just postponing a task. [1] You just have to build your app in a way where there is a core that can continue running with no further allocations. Chrome is a decent example. Some of its processes might crash in an out-of-memory situation, but that only causes some tabs to lose their display state. The browser as a whole keeps running just fine. A similar solution can be done within a single process too. -- [1] By task I mean some app specific unit of work that makes sense, not some Rust std lib string allocation.
  - tialaramex 3y ago
    > [1] By task I mean some app specific unit of work that makes sense, not some Rust std lib string allocation. Congratulations on successfully moving the goalposts. You don't get to decide which dynamic allocations fail, if you did obviously you'd choose "none of them". > You just have to build your app in a way where there is a core that can continue running with no further allocations. Again Rust - unlike say C++ - is actually defined so that this just works. So whereas C++ std::array can't exist in the standard without also having a heap allocator - yes really, Rust's [T; N] works just fine even including fancy features like select_nth_unstable_by_key() without needing an allocator.

tialaramex 3y ago

> You just have to handle the case of not having heap memory to spare You have to successfully handle this case. Rust already handles this case by panicking, which you've unilaterally decided isn't safe for some reason. If that's not good enough you need to succeed. You must conjure the 4kB from nowhere. Show us all how it's done, or, and this might be the better choice, slink away to your fantasy land. You are right at the end though, if you can't accept that running out of memory might happen what you do about that isn't dream up miraculous ways to "handle" it, you don't do dynamic allocations. Which of course works just fine in Rust.

Strom 3y ago
Dynamic allocations work fine in a memory constrained environment. Successful handling can mean just postponing a task. [1] You just have to build your app in a way where there is a core that can continue running with no further allocations. Chrome is a decent example. Some of its processes might crash in an out-of-memory situation, but that only causes some tabs to lose their display state. The browser as a whole keeps running just fine. A similar solution can be done within a single process too. -- [1] By task I mean some app specific unit of work that makes sense, not some Rust std lib string allocation.
- tialaramex 3y ago
  > [1] By task I mean some app specific unit of work that makes sense, not some Rust std lib string allocation. Congratulations on successfully moving the goalposts. You don't get to decide which dynamic allocations fail, if you did obviously you'd choose "none of them". > You just have to build your app in a way where there is a core that can continue running with no further allocations. Again Rust - unlike say C++ - is actually defined so that this just works. So whereas C++ std::array can't exist in the standard without also having a heap allocator - yes really, Rust's [T; N] works just fine even including fancy features like select_nth_unstable_by_key() without needing an allocator.