Am Sonntag, 24. September 2017, 21:39:33 CEST schrieb johannes hanika: > hi, > > i disagree. i really like variable length arrays. and std::vectors > dynamically allocate memory on the heap, with standard implementations > locking a global mutex on the way, causing slowdown for multithreaded > cases. just incrementing the stack pointer is a simple thing, it's > thread local and light weight. and memory resources will run out > whether i do a complicated or a simple memory allocation scheme (with > linux overcommitting, you can't even test malloc == 0, so i don't see > how heap allocation is any safer). also, variable sized arrays mean > it's not known compile time, but once you enter the function you know > exactly how large you need it (no need for dynamically growing > complicated structures).
alloca() FTW ;-) [...] > cheers, > jo Tobias [...]
signature.asc
Description: This is a digitally signed message part.
