Comment

Comment on Explain yourselves, comp sci.

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 with.

of the same type: all the objects in the list are the same kind of object

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.

source

Sort:hotnew top

kbotc@lemmy.world ⁨11⁩ ⁨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.

source
- Killing_Spark@feddit.de ⁨11⁩ ⁨months⁩ ago
  Contiguous storage is very fast in terms of iteration though often offsetting the cost of allocation
  
  source
  - Slotos@feddit.nl ⁨11⁩ ⁨months⁩ ago
    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.
    
    source
- IAmVeraGoodAtThis@lemmy.blahaj.zone ⁨11⁩ ⁨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)
  
  source
- yetiftw@lemmy.world ⁨11⁩ ⁨months⁩ ago
  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!
  
  source
- tamal3@lemmy.world ⁨11⁩ ⁨months⁩ ago
  Is that churn or chum? (RN or M)
  
  source
  - Khanzarate@lemmy.world ⁨11⁩ ⁨months⁩ ago
    Churm
    
    source