Function permute_self_adjoint 

pub fn permute_self_adjoint<'out, N: Shape, I: Index, T: ComplexField, C: Conjugate<Canonical = T>>(
    new_val: &'out mut [T],
    new_col_ptr: &'out mut [I],
    new_row_idx: &'out mut [I],
    A: SparseColMatRef<'_, I, C, N, N>,
    perm: PermRef<'_, I, N>,
    in_side: Side,
    out_side: Side,
    stack: &mut MemStack,
) -> SparseColMatMut<'out, I, T, N, N>

computes the self-adjoint permutation $P A P^\top$ of the matrix $A$

the result is stored in new_col_ptrs, new_row_indices

note

allows unsorted matrices, producing a sorted output. duplicate entries are kept, however