You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In a typical long-running program that is performing allocations and deallocations as it goes, successive allocations are unlikely to be exactly adjacent in memory, but https://doc.rust-lang.org/stable/book/the-stack-and-the-heap.html may imply that there's more predictability than there is. That said, a normal allocator won't be completely unpredictable.
One suggestion from twitter was to use random numbers for heap allocs.
The text was updated successfully, but these errors were encountered:
Fixesrust-lang#29853Fixesrust-lang#29852
While these points are true, we're not going for 100% accuracy here,
this is introductory material. Changing these things would be more
confusing, but it is important to note that we're presenting an
abstraction here.
Fixes#29853Fixes#29852
While these points are true, we're not going for 100% accuracy here,
this is introductory material. Changing these things would be more
confusing, but it is important to note that we're presenting an
abstraction here.
r? @huonw
In a typical long-running program that is performing allocations and deallocations as it goes, successive allocations are unlikely to be exactly adjacent in memory, but https://doc.rust-lang.org/stable/book/the-stack-and-the-heap.html may imply that there's more predictability than there is. That said, a normal allocator won't be completely unpredictable.
One suggestion from twitter was to use random numbers for heap allocs.
The text was updated successfully, but these errors were encountered: