Given Eq[A], return a PartialOrder[A] using the combine
operator to determine the partial ordering.
Given Eq[A], return a PartialOrder[A] using the combine
operator to determine the partial ordering. This method assumes
combine
functions as join
(that is, as an upper bound).
This method returns:
0.0 if x = y -1.0 if y = combine(x, y) 1.0 if x = combine(x, y) NaN otherwise
Given Eq[A], return a PartialOrder[A] using the combine
operator to determine the partial ordering.
Given Eq[A], return a PartialOrder[A] using the combine
operator to determine the partial ordering. This method assumes
combine
functions as meet
(that is, as a lower bound).
This method returns:
0.0 if x = y -1.0 if x = combine(x, y) 1.0 if y = combine(x, y) NaN otherwise
Associative operation taking which combines two values.
Associative operation taking which combines two values.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, combine them and return the total.
Given a sequence of as
, combine them and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).
Return a
appended to itself n
times.
Return the identity element for this monoid.
Return the identity element for this monoid.
Find the inverse of a
.
Find the inverse of a
.
combine(a, inverse(a))
= combine(inverse(a), a)
= empty
.
Tests if a
is the identity.
Tests if a
is the identity.
Remove the element b
from a
.
Remove the element b
from a
.
Equivalent to combine(a, inverse(a))
Return a
combined with itself more than once.
Return a
combined with itself more than once.