this post was submitted on 28 Apr 2024
495 points (96.8% liked)

Science Memes

9997 readers
2806 users here now

Welcome to c/science_memes @ Mander.xyz!

A place for majestic STEMLORD peacocking, as well as memes about the realities of working in a lab.



Rules

  1. Don't throw mud. Behave like an intellectual and remember the human.
  2. Keep it rooted (on topic).
  3. No spam.
  4. Infographics welcome, get schooled.


Sister Communities

Science and Research

Biology and Life Sciences

Physical Sciences

Humanities and Social Sciences

Practical and Applied Sciences

Memes

Miscellaneous

founded 2 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 72 points 3 months ago (13 children)
[–] [email protected] 81 points 3 months ago* (last edited 3 months ago) (7 children)

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.

[–] [email protected] 15 points 3 months ago (6 children)

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.

[–] [email protected] 7 points 3 months ago* (last edited 3 months ago)

Which is why you should:

  1. Preallocate the vector if you can guesstimate the size
  2. 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 (5 replies)
load more comments (10 replies)