Comment by saagarjha
4 days ago
The idea here is that x <= X, y <= Y, but x' + y' <= Z where x' and y' may be (individually) greater than x or y
4 days ago
The idea here is that x <= X, y <= Y, but x' + y' <= Z where x' and y' may be (individually) greater than x or y
Sure, but how do you prove that you won't end up with `x' + y' > Z` for some value of x' and y'? In practice, it's always easier to prove `x < X, y < Y`.
Generally the idea is that all of these are (more or less) easy to prove but the other policy allows for x' and y' to be independent
Dynamic stacks with linked granular chunks? It consumes even less memory.
Not contiguous
Obviously chunk size is larger than class of objects to allocate.
4 replies →