This requires the underlying element type to be orderable.
An empty `Sequence` is always less or equal to any other `Sequence`. Two non empty `Sequence`s whose first elements are unequal are ordered by the order of those two elements. If those two elements are equal, the tail of both `Sequence`s will be used to find the order.
0.094dev (2025-07-10 15:41:47 GIT hash eafa42ae743de61b62f958948d7abb5fada7756f built by fridi@fzen)
This requires the underlying element type to be orderable.
An empty `Sequence` is always less or equal to any other `Sequence`. Two non
empty `Sequence`s whose first elements are unequal are ordered by the
order of those two elements. If those two elements are equal, the tail
of both `Sequence`s will be used to find the order.