Hacker News

points by tcfhgj 4 days ago | 0 comments

similarly except the algorithm to Mutex<[T]> and Arc?

How does this work e.g. for an array of integers that several workers threads write to at random, non-overlapping positions?

[–] tcfhgj 3 days ago

1. by implementing your complex algorithm? 2. if they don't overlap, they can't be random, can they?

Rust can literally do anything programmatically. Idk why you think it cannot do something.

[–] gmueckl 3 days ago

They can be unordered, e.g. when reshuffling data into a new buffer based on a permutation that was computed separately. How do you avoid locking the output buffer in rust?

[–] tcfhgj 3 days ago

https://news.ycombinator.com/user?id=afdbcreid

[–] tcfhgj 3 hours ago

sry wrong link: https://news.ycombinator.com/item?id=50365335