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