`func >(lhs:rhs:)(lhs: (), rhs: ()) -> Bool`

`func >(lhs:rhs:)(lhs: (A, B), rhs: (A, B)) -> Bool`

Returns a Boolean value indicating whether the first tuple is ordered after the second in a lexicographical ordering.

Given two tuples `(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C), rhs: (A, B, C)) -> Bool`

Returns a Boolean value indicating whether the first tuple is ordered after the second in a lexicographical ordering.

Given two tuples `(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D), rhs: (A, B, C, D)) -> Bool`

Given two tuples `(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D, E), rhs: (A, B, C, D, E)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D, E, F), rhs: (A, B, C, D, E, F)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (), rhs: ()) -> Bool`

An arity zero tuple is never strictly after another arity zero tuple in a lexicographical ordering.

`func >(lhs:rhs:)(lhs: (A, B), rhs: (A, B)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C), rhs: (A, B, C)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D), rhs: (A, B, C, D)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D, E), rhs: (A, B, C, D, E)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

`func >(lhs:rhs:)(lhs: (A, B, C, D, E, F), rhs: (A, B, C, D, E, F)) -> Bool`

`(a1, a2, ..., aN)`

and `(b1, b2, ..., bN)`

, the first
tuple is after the second tuple if and only if
`a1 > b1`

or (`a1 == b1`

and
`(a2, ..., aN) > (b2, ..., bN)`

).

Returns a Boolean value indicating whether the first tuple is ordered after the second in a lexicographical ordering.

An arity zero tuple is never strictly after another arity zero tuple in a lexicographical ordering.