@KernelPanic@programming.dev to Programmer Humor@programming.devEnglish • 2 months agoLearning to program in rustprogramming.devmessage-square57fedilinkarrow-up1315arrow-down15
arrow-up1310arrow-down1playLearning to program in rustprogramming.dev@KernelPanic@programming.dev to Programmer Humor@programming.devEnglish • 2 months agomessage-square57fedilink
minus-square@PlexSheep@infosec.publinkfedilink0•2 months agoYou mean mutex? Arc allows synchronous read only access by multiple threads, so it’s not a performance bottleneck. Locking a mutex would be one.
minus-square@tatterdemalion@programming.devlinkfedilink5•1 month agoArc is not free, and the extra atomic operations + heap allocations can become a bottleneck.
minus-square@PlexSheep@infosec.publinkfedilink1•1 month agoOh, I did not know that. Well, it makes sense that it has a heap allocation, as it becomes more or less global. Though not sure why the atomic operations are needed when the value inside is immutable.
minus-square@Miaou@jlai.lulinkfedilink1•1 month agoHow can you otherwise keep track of an object’s lifetime if copies are made concurrently?
minus-square@mholiv@lemmy.worldlinkfedilink2•edit-22 months agoI mean it could be Mutex, or Rwlock or anything atomic. It’s just when I have to put stuff into an Arc<> to pass around I know trouble is coming.
You mean mutex? Arc allows synchronous read only access by multiple threads, so it’s not a performance bottleneck. Locking a mutex would be one.
Arc
is not free, and the extra atomic operations + heap allocations can become a bottleneck.Oh, I did not know that. Well, it makes sense that it has a heap allocation, as it becomes more or less global. Though not sure why the atomic operations are needed when the value inside is immutable.
How can you otherwise keep track of an object’s lifetime if copies are made concurrently?
I mean it could be Mutex, or Rwlock or anything atomic. It’s just when I have to put stuff into an Arc<> to pass around I know trouble is coming.