Function argsort_permutation

rust/stringzilla.rs:2186–2191

Sorts a sequence of items by comparing their byte-slice representations. The caller must supply an output buffer `order` whose length is at least equal to the length of `data`. On success, the function writes the sorted permutation indices into `order`. # Example ```rust use stringzilla::stringzilla as sz; let fruits = ["banana", "apple", "cherry"]; let mut order = [0; 3]; sz::argsort_permutat

(data: &[T], order: &mut [SortedIdx])

/// assert_eq!(&order, &[1, 0, 2]); // "apple", "banana", "cherry"
/// ```
pub fn argsort_permutation<T: AsRef<[u8]>>(data: &[T], order: &mut [SortedIdx]) -> Result<(), Status> {
    if data.len() > order.len() {
        return Err(Status::BadAlloc);
    }
    argsort_permutation_by(|i| data[i].as_ref(), order[..data.len()].as_mut())
}

/// Sorts a sequence of items by comparing their corresponding byte-slice representations.
/// The size of the permutation is inferred from the length of the `order` slice.