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.095dev (2025-08-15 12:02:22 GIT hash 301b5b75e77076d091b38f555473f9f0e31e5b5c 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.