tiny.simd.order

1/// Orders two spans of integer lanes lexicographically, as `std.mem.order`2/// orders slices. The first differing lane decides, and a span that is a3/// prefix of the other orders first. Byte spans that share less than a4/// vector compare as big-endian words, which order as their bytes do. Longer5/// spans compare vectors out of line, so ordering a short key reserves no6/// registers for the vector loop.7pub fn order(comptime D: type, left: []const D.Lane, right: []const D.Lane) std.math.Order {8    requireInteger(D.Lane, "order");9    const shared = @min(left.len, right.len);10    if (shared >= D.lane_count) return vectorOrder(D, left, right);11    if (D.Lane == u8 and shared >= word_bytes) return wordOrder(left, right);12    for (left[0..shared], right[0..shared]) |first, second| {13        if (first != second) return std.math.order(first, second);14    }15    return std.math.order(left.len, right.len);16}

1pub const order = algo.order;