503
you are viewing a single comment's thread
view the rest of the comments
[-] SpaceNoodle@lemmy.world 122 points 4 months ago

It's a dynamically-sized list of objects of the same type stored contiguously in memory.

[-] fossilesque@mander.xyz 72 points 4 months ago
[-] ipha@lemm.ee 101 points 4 months ago
[-] fossilesque@mander.xyz 40 points 4 months ago

So is a wedding gift registry.

[-] whereBeWaldo@lemmy.dbzer0.com 6 points 4 months ago* (last edited 4 months ago)

No, this is Patrick!

[-] Fosheze@lemmy.world 81 points 4 months ago* (last edited 4 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 4 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.

[-] Killing_Spark@feddit.de 15 points 4 months ago

Contiguous storage is very fast in terms of iteration though often offsetting the cost of allocation

[-] Slotos@feddit.nl 7 points 4 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.

[-] IAmVeraGoodAtThis@lemmy.blahaj.zone 7 points 4 months ago* (last edited 4 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.

[-] yetiftw@lemmy.world 4 points 4 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!

[-] tamal3@lemmy.world 2 points 4 months ago

Is that churn or chum? (RN or M)

[-] SpaceNoodle@lemmy.world 3 points 4 months ago

Many things like each other lined up in a row, and you can take some away or put more in.

[-] mindbleach@sh.itjust.works 1 points 4 months ago

It's how you want an array to work.

[-] Leate_Wonceslace@lemmy.dbzer0.com 25 points 4 months ago

No, it's an n-tuple with certain algebraic properties.

[-] KidnappedByKitties@lemm.ee 7 points 4 months ago

This is such an understated but useful description in this context. It's also how I understood algebra for applied matrix computation.

[-] Leate_Wonceslace@lemmy.dbzer0.com 4 points 4 months ago* (last edited 4 months ago)

I was just coming down from THC when I wrote this, so I'm extra jazzed you liked it. ๐Ÿ˜

Edit: also, love the username.

[-] GnomeKat@lemmy.blahaj.zone 5 points 4 months ago

Its the algebraic properties that are important, not all vectors are n-tuples, eg the set of polynomials of degree less than n.

You need a basis to coordinate a vector, you can work with vectors without doing that and just deal with the algebraic properties. The coordinate representation is dependent on the basis chosen and isn't fundamental to the vector. So calling them n-tuples isn't technically correct.

You can turn them into a set of coordinates if you have a basis, but the fact that you can do that is because of the algebraic properties so it's those properties which define what a vector is.

[-] Leate_Wonceslace@lemmy.dbzer0.com 0 points 4 months ago* (last edited 4 months ago)

I think a better example to show how vectors don't necessarily need to be what people conceptualize as n-tuples would have been the real numbers. (Of course, these can be considered 1-tuples, but the same can be said of any arbitrary set element that is not itself a tuple with more entries.) A cooler example would have been R[x] (the ring of real-valued polynomials of a single variable) especially since an isomorphic ring using n-tuples would be a more cumbersome representation of the algebra.

[-] conquer4@lemmy.world 2 points 4 months ago
[-] joyjoy@lemm.ee 11 points 4 months ago* (last edited 4 months ago)

No. ArrayList is thread safe and implements the collections API. Vector doesn't. Though if you're using Java, there's almost no instance where you would want to use a Vector instead of ArrayList.

[-] DaPorkchop_@lemmy.ml 1 points 4 months ago

ArrayList isn't thread-safe, though...

[-] joyjoy@lemm.ee 1 points 4 months ago

Thread safe as in it raises an exception instead of breaking your list.

[-] DaPorkchop_@lemmy.ml 1 points 4 months ago

Only if one thread modifies it while another one is iterating over it, if two threads try to modify the list at once there isn't any kind of synchronization and it really could break your list.

[-] joyjoy@lemm.ee 1 points 4 months ago

For everything else, there's Collections.synchronizedList(new ArrayList<>())

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

Science Memes

10348 readers
2219 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.


Research Committee

Other Mander 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