OrderedCancellationAbelianMonoidΒΆ

catdef.spad line 984

Ordered sets which are also abelian cancellation monoids, such that the addition preserves the ordering.

0: %
from AbelianMonoid
*: (NonNegativeInteger, %) -> %
from AbelianMonoid
*: (PositiveInteger, %) -> %
from AbelianSemiGroup
+: (%, %) -> %
from AbelianSemiGroup
<: (%, %) -> Boolean
from PartialOrder
<=: (%, %) -> Boolean
from PartialOrder
=: (%, %) -> Boolean
from BasicType
>: (%, %) -> Boolean
from PartialOrder
>=: (%, %) -> Boolean
from PartialOrder
~=: (%, %) -> Boolean
from BasicType
coerce: % -> OutputForm
from CoercibleTo OutputForm
hash: % -> SingleInteger
from SetCategory
hashUpdate!: (HashState, %) -> HashState
from SetCategory
latex: % -> String
from SetCategory
max: (%, %) -> %
from OrderedSet
min: (%, %) -> %
from OrderedSet
opposite?: (%, %) -> Boolean
from AbelianMonoid
sample: %
from AbelianMonoid
smaller?: (%, %) -> Boolean
from Comparable
subtractIfCan: (%, %) -> Union(%, failed)
from CancellationAbelianMonoid
zero?: % -> Boolean
from AbelianMonoid

AbelianMonoid

AbelianSemiGroup

BasicType

CancellationAbelianMonoid

CoercibleTo OutputForm

Comparable

OrderedAbelianMonoid

OrderedAbelianSemiGroup

OrderedSet

PartialOrder

SetCategory