tiny.preserves.valueCompare

1/// Returns the order of `a` against `b`, the same answer as `a.compare(b)`. Code that sorts values2/// passes this as the comparison, for the package's one total order. Values of different kinds3/// order by kind: booleans, doubles, integers, strings, byte strings, symbols, records, sequences,4/// sets, dictionaries, embedded values, then the four pattern forms. Doubles order by a total order5/// over their bits, so every double, `NaN` included, has one place. Sets and dictionaries compare6/// their elements in ascending order under `compare`, whatever their storage order. The call7/// allocates nothing. Its cost on two sets grows with the square of their size.8pub fn valueCompare(a: AnyValue, b: AnyValue) std.math.Order {9    return a.compare(b);10}

1pub const valueCompare = any.valueCompare;