infixoperator<= {associativitynoneprecedence130}
Declarations
A lexicographical order
over tuples of Comparable elements.
Given two tuples (a1, a2, ..., aN) and (b1, b2, ..., bN), the
first tuple is <= the second tuple iff a1 < b1 or
(a1 == b1 and (a2, ..., aN) <= (b2, ..., bN)).
Declaration
func<=<A:Comparable,B:Comparable,C:Comparable,D:Comparable,E:Comparable,F:Comparable>(lhs: (A,B,C,D,E,F),rhs: (A,B,C,D,E,F)) ->Bool
A lexicographical order
over tuples of Comparable elements.
Given two tuples (a1, a2, ..., aN) and (b1, b2, ..., bN), the
first tuple is <= the second tuple iff a1 < b1 or
(a1 == b1 and (a2, ..., aN) <= (b2, ..., bN)).
Declaration
func<=<A:Comparable,B:Comparable,C:Comparable,D:Comparable,E:Comparable>(lhs: (A,B,C,D,E),rhs: (A,B,C,D,E)) ->Bool
A lexicographical order
over tuples of Comparable elements.
Given two tuples (a1, a2, ..., aN) and (b1, b2, ..., bN), the
first tuple is <= the second tuple iff a1 < b1 or
(a1 == b1 and (a2, ..., aN) <= (b2, ..., bN)).
Declaration
func<=<A:Comparable,B:Comparable,C:Comparable,D:Comparable>(lhs: (A,B,C,D),rhs: (A,B,C,D)) ->Bool
A lexicographical order
over tuples of Comparable elements.
Given two tuples (a1, a2, ..., aN) and (b1, b2, ..., bN), the
first tuple is <= the second tuple iff a1 < b1 or
(a1 == b1 and (a2, ..., aN) <= (b2, ..., bN)).
Declaration
func<=<A:Comparable,B:Comparable,C:Comparable>(lhs: (A,B,C),rhs: (A,B,C)) ->Bool
A lexicographical order
over tuples of Comparable elements.
Given two tuples (a1, a2, ..., aN) and (b1, b2, ..., bN), the
first tuple is <= the second tuple iff a1 < b1 or
(a1 == b1 and (a2, ..., aN) <= (b2, ..., bN)).
Declaration
func<=<A:Comparable,B:Comparable>(lhs: (A,B),rhs: (A,B)) ->Bool
Declaration
func<=<T:Comparable>(lhs:T,rhs:T) ->Bool
Declaration
func<=<T:Comparable>(lhs:T?,rhs:T?) ->Bool
Declaration
func<=(lhs:Double,rhs:Double) ->Bool