It’s a dynamically-sized list of objects of the same type stored contiguously in memory.
dynamically-sized: The size of it can change as needed.
list: It stores multiple things together.
object: A bit of programmer defined data.
of the same type: all the objects in the list are defined the same way
stored contigiously in memory: if you think of memory as a bookshelf then all the objects on the list would be stored right next to each other on the bookshelf rather than spread across the bookshelf.
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.
Preallocate the vector if you can guesstimate the size
Use a vector library that won’t reallocate the entire vector on every single addition (like Rust, whose 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!
It’s like a fancy list.
So is a wedding gift registry.
No, this is Patrick!
dynamically-sized: The size of it can change as needed.
list: It stores multiple things together.
object: A bit of programmer defined data.
of the same type: all the objects in the list are defined the same way
stored contigiously in memory: if you think of memory as a bookshelf then all the objects on the list would be stored right next to each other on the bookshelf rather than spread across the bookshelf.
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:
Vecdoubles 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
Many things like each other lined up in a row, and you can take some away or put more in.
It’s how you want an array to work.