FiniteLattice(S, p)ΒΆ

logic.spad line 1929 [edit on github]

This is the algebration of poset. A big difference between this lattice domain and the poset domain is that, in this domain, the REP holds a single node whereas in poset REP holds the whole poset. Date Created: Aug 2015

/\: (%, %) -> %

from MeetSemilattice

=: (%, %) -> Boolean

from BasicType

\/: (%, %) -> %

from JoinSemilattice

~=: (%, %) -> Boolean

from BasicType

coerce: % -> OutputForm

from CoercibleTo OutputForm

convert: % -> InputForm

from ConvertibleTo InputForm

enumerate: () -> List %

from Finite

finiteLattice: NonNegativeInteger -> %

construct finite lattice element from index

finiteLattice: S -> %

construct finite lattice element from object

hash: % -> SingleInteger

from Hashable

hashUpdate!: (HashState, %) -> HashState

from Hashable

index: PositiveInteger -> %

from Finite

latex: % -> String

from SetCategory

lookup: % -> PositiveInteger

from Finite

random: () -> %

from Finite

size: () -> NonNegativeInteger

from Finite

smaller?: (%, %) -> Boolean

from Comparable

BasicType

CoercibleTo OutputForm

Comparable

ConvertibleTo InputForm

Finite

Hashable

JoinSemilattice

Lattice

MeetSemilattice

SetCategory