Packages

abstract class BaseInstance[A] extends LatticeElement[L[A]]

Linear Supertypes
LatticeElement[L[A]], Show[L[A]], Monoid[L[A]], Semigroup[L[A]], Order[L[A]], Equal[L[A]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BaseInstance
  2. LatticeElement
  3. Show
  4. Monoid
  5. Semigroup
  6. Order
  7. Equal
  8. AnyRef
  9. 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

Instance Constructors

  1. new BaseInstance(typeName: String)(implicit ordering: Order[A], show: Show[A])

Type Members

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

Value Members

  1. final def append(x: L[A], y: ⇒ L[A]): L[A]
    Definition Classes
    LatticeElement → Semigroup
  2. final def applicative: Applicative[[α]L[A]]
    Definition Classes
    Monoid
  3. final def apply: Apply[[α]L[A]]
    Definition Classes
    Semigroup
  4. def apply(x: L[A], y: L[A]): Ordering
    Definition Classes
    Order
  5. val bottom: L[A]

    The bottom element

    The bottom element

    Definition Classes
    BaseInstance → LatticeElement
  6. def cardinality(x: L[A]): Cardinality
    Definition Classes
    BaseInstance → LatticeElement
  7. final def category: Category[[α, β]L[A]]
    Definition Classes
    Monoid
  8. final def compose: Compose[[α, β]L[A]]
    Definition Classes
    Semigroup
  9. def contramap[B](f: (B) ⇒ L[A]): Order[B]
    Definition Classes
    Order → Equal
  10. def eql[B](x: L[A], y: L[A])(implicit arg0: BoolLattice[B]): B

    Equality check, returning an abstract result

    Equality check, returning an abstract result

    Definition Classes
    BaseInstance → LatticeElement
  11. def equal(x: L[A], y: L[A]): Boolean
    Definition Classes
    Order → Equal
  12. def equalIsNatural: Boolean
    Definition Classes
    Equal
  13. def equalLaw: EqualLaw
    Definition Classes
    Equal
  14. val equalSyntax: EqualSyntax[L[A]]
    Definition Classes
    Equal
  15. def greaterThan(x: L[A], y: L[A]): Boolean
    Definition Classes
    Order
  16. def greaterThanOrEqual(x: L[A], y: L[A]): Boolean
    Definition Classes
    Order
  17. final def ifEmpty[B](a: L[A])(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[L[A]]): B
    Definition Classes
    Monoid
  18. def isMZero(a: L[A])(implicit eq: Equal[L[A]]): Boolean
    Definition Classes
    Monoid
  19. def join(x: L[A], y: ⇒ L[A]): L[A]

    The join operation

    The join operation

    Definition Classes
    BaseInstance → LatticeElement
  20. def latticeElementLaw: LatticeElementLaw
    Definition Classes
    LatticeElement
  21. def lessThan(x: L[A], y: L[A]): Boolean
    Definition Classes
    Order
  22. def lessThanOrEqual(x: L[A], y: L[A]): Boolean
    Definition Classes
    Order
  23. def max(x: L[A], y: L[A]): L[A]
    Definition Classes
    Order
  24. def min(x: L[A], y: L[A]): L[A]
    Definition Classes
    Order
  25. def monoidLaw: MonoidLaw
    Definition Classes
    Monoid
  26. val monoidSyntax: MonoidSyntax[L[A]]
    Definition Classes
    Monoid
  27. def multiply(value: L[A], n: Int): L[A]
    Definition Classes
    Monoid
  28. def multiply1(value: L[A], n: Int): L[A]
    Definition Classes
    Semigroup
  29. def name: String

    The name of the lattice

    The name of the lattice

    Definition Classes
    BaseInstance → LatticeElement
  30. final def onEmpty[A, B](a: L[A])(v: ⇒ B)(implicit eq: Equal[L[A]], mb: Monoid[B]): B
    Definition Classes
    Monoid
  31. final def onNotEmpty[B](a: L[A])(v: ⇒ B)(implicit eq: Equal[L[A]], mb: Monoid[B]): B
    Definition Classes
    Monoid
  32. def order(x: L[A], y: L[A]): Ordering
    Definition Classes
    BaseInstance → Order
  33. def orderLaw: OrderLaw
    Definition Classes
    Order
  34. val orderSyntax: OrderSyntax[L[A]]
    Definition Classes
    Order
  35. def reverseOrder: Order[L[A]]
    Definition Classes
    Order
  36. def semigroupLaw: SemigroupLaw
    Definition Classes
    Semigroup
  37. val semigroupSyntax: SemigroupSyntax[L[A]]
    Definition Classes
    Semigroup
  38. def show(f: L[A]): Cord
    Definition Classes
    Show
  39. val showSyntax: ShowSyntax[L[A]]
    Definition Classes
    Show
  40. def shows(x: L[A]): String
    Definition Classes
    BaseInstance → Show
  41. def sort(x: L[A], y: L[A]): (L[A], L[A])
    Definition Classes
    Order
  42. def subsumes(x: L[A], y: ⇒ L[A]): Boolean

    The subsumption relation that defines the ordering of elements

    The subsumption relation that defines the ordering of elements

    Definition Classes
    BaseInstance → LatticeElement
  43. def toScalaOrdering: Ordering[L[A]]
    Definition Classes
    Order
  44. val top: L[A]

    The top element.

    The top element.

    Definition Classes
    BaseInstance → LatticeElement
  45. final def zero: L[A]
    Definition Classes
    LatticeElement → Monoid