A Domain is a PartialOrdering where elements are endowed with an upper bound operator. However, not all
pairs of elements have an upper bound. Generally, elements in a domain are partitioned in fibers, and an
upper bound only exists for elements on the same fiber. This is not modeled bu the current definition of Domain.
If an implicit object of type Domain[A] is in scope, then binary operators
<, <=, >, >=, equiv and upperBound are available.
Linear Supertypes
PartialOrdering[A], Equiv[A], Serializable, Serializable, AnyRef, Any
A
Domain
is aPartialOrdering
where elements are endowed with an upper bound operator. However, not all pairs of elements have an upper bound. Generally, elements in a domain are partitioned in fibers, and an upper bound only exists for elements on the same fiber. This is not modeled bu the current definition ofDomain
.If an implicit object of type
Domain[A]
is in scope, then binary operators<
,<=
,>
,>=
,equiv
andupperBound
are available.