16232, “bradcray”, “Optimize array swaps for non-aligned slices”, “2020-08-13T02:26:53Z”
As an interesting challenge, what would it take to optimize array swaps over slices that are (potentially / likely) on distinct locales. For example, consider:
var A = newBlockArr({1..n, 1..n});
A[i, ..] <=> A[j, ..];
Our current implementation loops over the two arrays in a zippered manner, swapping an element at a time, but surely we can do better.