503

Explain yourselves, comp sci. (mander.xyz)

submitted 6 months ago by fossilesque@mander.xyz to c/science_memes@mander.xyz

71 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[-] fossilesque@mander.xyz 72 points 6 months ago

[-] Fosheze@lemmy.world 81 points 6 months ago* (last edited 6 months ago)

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.

[-] kbotc@lemmy.world 15 points 6 months ago

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.

[-] IAmVeraGoodAtThis@lemmy.blahaj.zone 7 points 6 months ago* (last edited 6 months ago)

Which is why you should:

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.

load more comments (5 replies)

load more comments (10 replies)

this post was submitted on 28 Apr 2024

503 points (96.8% liked)