BoundedLattice

algebra.lattice.BoundedLattice
See theBoundedLattice companion object

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)

Attributes

Companion:
object
Source:
BoundedLattice.scala
Graph
Supertypes
Known subtypes
Self type

Members list

Concise view

Value members

Concrete methods

override def dual: BoundedLattice[A]

This is the lattice with meet and join swapped

This is the lattice with meet and join swapped

Attributes

Definition Classes
Source:
BoundedLattice.scala

Inherited methods

def isOne(a: A)(implicit ev: Eq[A]): Boolean
def isZero(a: A)(implicit ev: Eq[A]): Boolean
def join(lhs: A, rhs: A): A

Attributes

Inherited from:
JoinSemilattice
Source:
JoinSemilattice.scala
def joinPartialOrder(implicit ev: Eq[A]): PartialOrder[A]

Attributes

Inherited from:
JoinSemilattice
Source:
JoinSemilattice.scala
def meet(lhs: A, rhs: A): A

Attributes

Inherited from:
MeetSemilattice
Source:
MeetSemilattice.scala
def meetPartialOrder(implicit ev: Eq[A]): PartialOrder[A]

Attributes

Inherited from:
MeetSemilattice
Source:
MeetSemilattice.scala
def one: A
def zero: A