Abstract Value Members
-
abstract
def
getClass(): Class[_]
-
abstract
def
join(lhs: A, rhs: A): A
-
abstract
def
meet(lhs: A, rhs: A): A
-
abstract
def
one: A
-
abstract
def
zero: A
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
-
def
equals(arg0: Any): Boolean
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
isOne(a: A)(implicit ev: Eq[A]): Boolean
-
def
isZero(a: A)(implicit ev: Eq[A]): Boolean
-
def
joinPartialOrder(implicit ev: Eq[A]): PartialOrder[A]
-
-
def
meetPartialOrder(implicit ev: Eq[A]): PartialOrder[A]
-
-
def
toString(): String
Inherited from Serializable
Inherited from Any
A bounded lattice is a lattice that additionally has one element that is the bottom (zero, also written as ⊥), and one element that is the top (one, also written as ⊤).
This means that for any a in A:
join(zero, a) = a = meet(one, a)
Or written using traditional notation:
(0 ∨ a) = a = (1 ∧ a)