Function heap::sort
[−]
[src]
pub fn sort<A, F: Fn(&A, &A) -> bool>(arity: usize, f: F, xs: &mut [A])
Given a slice xs
which is already a heap, sort the elements.