std/sort
In-place sorting for common types.
milo
from "std/sort" import { sortI64, sortStrings, reverseI64 }Example
milo
var nums: Vec<i64> = [3, 1, 4, 1, 5]
sortI64(&mut nums)
// nums is now [1, 1, 3, 4, 5]
reverseI64(&mut nums)
// nums is now [5, 4, 3, 1, 1]API reference
reverseI64
milo
pub fn reverseI64(v: &mut Vec<i64>): voidReverse a Vec<i64> in place.
sortI32
milo
pub fn sortI32(v: &mut Vec<i32>): voidSort Vec<i32> in ascending order.
sortI64
milo
pub fn sortI64(v: &mut Vec<i64>): voidSort Vec<i64> in ascending order.
sortStrings
milo
pub fn sortStrings(v: &mut Vec<string>): voidSort Vec<string> in lexicographic order.
sortStringsByFreq
milo
pub fn sortStringsByFreq(keys: &mut Vec<string>, vals: &mut Vec<i64>): voidSort Vec<string> + parallel Vec<i64> by values descending, then keys ascending (for top-N).