497
Explain yourselves, comp sci.
(mander.xyz)
A place for majestic STEMLORD peacocking, as well as memes about the realities of working in a lab.
Rules
This is a science community. We use the Dawkins definition of meme.
Dynamically sized but stored contiguously makes the systems performance engineer in me weep. If the lists get big, the kernel is going to do so much churn.
Contiguous storage is very fast in terms of iteration though often offsetting the cost of allocation
Modern CPUs are also extremely efficient at dealing with contiguous data structures. Branch prediction and caching get to shine on them.
Avoiding memory access or helping CPU access it all upfront switches physical domain of computation.
Which is why you should:
Vec
doubles in size every time it runs out of space)Memory is fairly cheap. Allocation time not so much.
matlab likes to pick the smallest available spot in memory to store a list, so for loops that increase the size of a matrix it's recommended to preallocate the space using a matrix full of zeros!
Is that churn or chum? (RN or M)
Churm