Is there a reason that there is not an in-place equivalent of sortperm!, i.e., “invperm!”?

One current (v1.8.3) approach would be to call invpermute!(v, sig) for permutation sig, but the docs say that for v with many elements, v[sig] is faster than permute!(v,sig) so I would think that the same is true for v[siginv] versus invpermute!(v, sig).

So, u[p] = v is by far the fastest way to perform an inverse permutation, not even counting the time it would take to compute pinv = invperm(p) (about 94ns on my machine).