Packages

  • package root
    Definition Classes
    root
  • trait LatticeElement[L] extends Order[L] with Monoid[L] with Show[L]

    We define here some domains that can will be useful to build a lattice for most languages.

    We define here some domains that can will be useful to build a lattice for most languages.

    Definition Classes
    root

trait LatticeElement[L] extends Order[L] with Monoid[L] with Show[L]

We define here some domains that can will be useful to build a lattice for most languages.

Linear Supertypes
Show[L], Monoid[L], Semigroup[L], Order[L], Equal[L], AnyRef, Any
Known Subclasses
BoolLattice, CharLattice, BaseInstance, BaseInstance, IntLattice, RealLattice, StringLattice, SymbolLattice, BaseInstance
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. LatticeElement
  2. Show
  3. Monoid
  4. Semigroup
  5. Order
  6. Equal
  7. AnyRef
  8. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait EqualLaw extends AnyRef
    Definition Classes
    Equal
  2. trait LatticeElementLaw extends MonoidLaw with OrderLaw
  3. trait MonoidLaw extends scalaz.Monoid.SemigroupLaw
    Definition Classes
    Monoid
  4. trait OrderLaw extends scalaz.Order.EqualLaw
    Definition Classes
    Order
  5. trait SemigroupLaw extends AnyRef
    Definition Classes
    Semigroup

Abstract Value Members

  1. abstract def bottom: L

    The bottom element

  2. abstract def cardinality(x: L): Cardinality
  3. abstract def eql[B](x: L, y: L)(implicit arg0: BoolLattice[B]): B

    Equality check, returning an abstract result

  4. abstract def join(x: L, y: ⇒ L): L

    The join operation

  5. abstract def name: String

    The name of the lattice

  6. abstract def order(x: L, y: L): Ordering
    Definition Classes
    Order
  7. abstract def subsumes(x: L, y: ⇒ L): Boolean

    The subsumption relation that defines the ordering of elements

  8. abstract def top: L

    The top element.

Concrete Value Members

  1. final def append(x: L, y: ⇒ L): L
    Definition Classes
    LatticeElement → Semigroup
  2. final def applicative: Applicative[[α]L]
    Definition Classes
    Monoid
  3. final def apply: Apply[[α]L]
    Definition Classes
    Semigroup
  4. def apply(x: L, y: L): Ordering
    Definition Classes
    Order
  5. final def category: Category[[α, β]L]
    Definition Classes
    Monoid
  6. final def compose: Compose[[α, β]L]
    Definition Classes
    Semigroup
  7. def contramap[B](f: (B) ⇒ L): Order[B]
    Definition Classes
    Order → Equal
  8. def equal(x: L, y: L): Boolean
    Definition Classes
    Order → Equal
  9. def equalIsNatural: Boolean
    Definition Classes
    Equal
  10. def equalLaw: EqualLaw
    Definition Classes
    Equal
  11. val equalSyntax: EqualSyntax[L]
    Definition Classes
    Equal
  12. def greaterThan(x: L, y: L): Boolean
    Definition Classes
    Order
  13. def greaterThanOrEqual(x: L, y: L): Boolean
    Definition Classes
    Order
  14. final def ifEmpty[B](a: L)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[L]): B
    Definition Classes
    Monoid
  15. def isMZero(a: L)(implicit eq: Equal[L]): Boolean
    Definition Classes
    Monoid
  16. def latticeElementLaw: LatticeElementLaw
  17. def lessThan(x: L, y: L): Boolean
    Definition Classes
    Order
  18. def lessThanOrEqual(x: L, y: L): Boolean
    Definition Classes
    Order
  19. def max(x: L, y: L): L
    Definition Classes
    Order
  20. def min(x: L, y: L): L
    Definition Classes
    Order
  21. def monoidLaw: MonoidLaw
    Definition Classes
    Monoid
  22. val monoidSyntax: MonoidSyntax[L]
    Definition Classes
    Monoid
  23. def multiply(value: L, n: Int): L
    Definition Classes
    Monoid
  24. def multiply1(value: L, n: Int): L
    Definition Classes
    Semigroup
  25. final def onEmpty[A, B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  26. final def onNotEmpty[B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  27. def orderLaw: OrderLaw
    Definition Classes
    Order
  28. val orderSyntax: OrderSyntax[L]
    Definition Classes
    Order
  29. def reverseOrder: Order[L]
    Definition Classes
    Order
  30. def semigroupLaw: SemigroupLaw
    Definition Classes
    Semigroup
  31. val semigroupSyntax: SemigroupSyntax[L]
    Definition Classes
    Semigroup
  32. def show(f: L): Cord
    Definition Classes
    Show
  33. val showSyntax: ShowSyntax[L]
    Definition Classes
    Show
  34. def shows(f: L): String
    Definition Classes
    Show
  35. def sort(x: L, y: L): (L, L)
    Definition Classes
    Order
  36. def toScalaOrdering: Ordering[L]
    Definition Classes
    Order
  37. final def zero: L
    Definition Classes
    LatticeElement → Monoid