Function transpose_dedup 

pub fn transpose_dedup<'out, Rows: Shape, Cols: 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, Rows, Cols>,
    stack: &mut MemStack,
) -> SparseColMatMut<'out, I, T, Cols, Rows>

computes the transpose of the matrix $A$ and returns a view over it.

the result is stored in new_col_ptrs, new_row_indices and new_values.

note

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