3 ms·
...what are you talking about? array-like storage with dynamic size has existed since forever - it's vector. over or undercommitting is a solved problem VLA i
by konstantinua00 1y ago
...what are you talking about?
array-like storage with dynamic size has existed since forever - it's vector. over or undercommitting is a solved problem
VLA is the way to bring that into type system, so that it can be it's own variable or struct member, with compiler auto-magic-ing size reading to access members after it
- Out_of_Characte 1y ago> auto-magic-ing size reading to access members after it From the article >we now have everything we need to calculate the size, offset and alignment of every field, regardless of their positioning in the struct. >init to allocate the memory >get to get a pointer to a field >resize to resize the arrays >deinit to free the memory You're now suggesting to do exactly what the article is about without being aware of it.