KernelPanic@programming.dev to Programmer Humor@programming.devEnglish · 3 days agoLearning to program in rustprogramming.devvideomessage-square49linkfedilinkarrow-up1313arrow-down13
arrow-up1310arrow-down1videoLearning to program in rustprogramming.devKernelPanic@programming.dev to Programmer Humor@programming.devEnglish · 3 days agomessage-square49linkfedilink
minus-squarePlexSheep@infosec.publinkfedilinkarrow-up1·2 days 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-squaremholiv@lemmy.worldlinkfedilinkarrow-up3·edit-22 days 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.
minus-squaretatterdemalion@programming.devlinkfedilinkarrow-up5·1 day agoArc is not free, and the extra atomic operations + heap allocations can become a bottleneck.
minus-squarePlexSheep@infosec.publinkfedilinkarrow-up1·24 hours 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-squareMiaou@jlai.lulinkfedilinkarrow-up1·18 hours agoHow can you otherwise keep track of an object’s lifetime if copies are made concurrently?
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.
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.
Arcis 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?