Packages

trait DotLattice[L] extends JoinLattice[L]

Linear Supertypes
JoinLattice[L], PartialOrdering[L], Equiv[L], Serializable, Serializable, Monoid[L], Semigroup[L], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DotLattice
  2. JoinLattice
  3. PartialOrdering
  4. Equiv
  5. Serializable
  6. Serializable
  7. Monoid
  8. Semigroup
  9. AnyRef
  10. 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 MonoidLaw extends scalaz.Monoid.SemigroupLaw
    Definition Classes
    Monoid
  2. trait SemigroupLaw extends AnyRef
    Definition Classes
    Semigroup
  3. trait JoinLatticeLaw extends AnyRef
    Definition Classes
    JoinLattice

Abstract Value Members

  1. abstract def bottom: L

    A lattice has a bottom element

    A lattice has a bottom element

    Definition Classes
    JoinLattice
  2. abstract def cardinality(x: L): Cardinality

    Cardinality of this value

    Cardinality of this value

    Definition Classes
    JoinLattice
  3. abstract def clo(v: Variable, body: Term, env: Env): L
  4. abstract def counting: Boolean

    It should state whether it supports abstract counting or not.

    It should state whether it supports abstract counting or not. (TODO: this is probably not the best place for that)

    Definition Classes
    JoinLattice
  5. abstract def getClos(x: L): Set[(Variable, Term, Env)]
  6. abstract def getObjs(x: L): Set[(Variable, Definition, Env)]
  7. abstract def isPrimitiveValue(x: L): Boolean

    Some elements may contain addresses in there and are therefore not considered as primitive values

    Some elements may contain addresses in there and are therefore not considered as primitive values

    Definition Classes
    JoinLattice
  8. abstract def join(x: L, y: L): L

    Elements of the lattice can be joined together

    Elements of the lattice can be joined together

    Definition Classes
    JoinLattice
  9. abstract def name: String

    A name identifying the lattice

    A name identifying the lattice

    Definition Classes
    JoinLattice
  10. abstract def obj(v: Variable, defs: Definition, env: Env): L
  11. abstract def subsumes(x: L, y: L): Boolean

    Subsumption between two elements can be checked

    Subsumption between two elements can be checked

    Definition Classes
    JoinLattice

Concrete Value Members

  1. def append(x: L, y: ⇒ L): L
    Definition Classes
    JoinLattice → Semigroup
  2. final def applicative: Applicative[[α]L]
    Definition Classes
    Monoid
  3. final def apply: Apply[[α]L]
    Definition Classes
    Semigroup
  4. final def category: Category[[α, β]L]
    Definition Classes
    Monoid
  5. final def compose: Compose[[α, β]L]
    Definition Classes
    Semigroup
  6. def equiv(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering → Equiv
  7. def gt(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  8. def gteq(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  9. final def ifEmpty[B](a: L)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[L]): B
    Definition Classes
    Monoid
  10. def isMZero(a: L)(implicit eq: Equal[L]): Boolean
    Definition Classes
    Monoid
  11. def lt(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  12. def lteq(x: L, y: L): Boolean
    Definition Classes
    JoinLattice → PartialOrdering
  13. def monoidLaw: MonoidLaw
    Definition Classes
    Monoid
  14. val monoidSyntax: MonoidSyntax[L]
    Definition Classes
    Monoid
  15. def multiply(value: L, n: Int): L
    Definition Classes
    Monoid
  16. def multiply1(value: L, n: Int): L
    Definition Classes
    Semigroup
  17. final def onEmpty[A, B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  18. final def onNotEmpty[B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  19. def reverse: PartialOrdering[L]
    Definition Classes
    PartialOrdering
  20. def semigroupLaw: SemigroupLaw
    Definition Classes
    Semigroup
  21. val semigroupSyntax: SemigroupSyntax[L]
    Definition Classes
    Semigroup
  22. def totalLessThan(a: L, b: L): Boolean

    ADDED Force an artificial total order to sort final values and have a deterministic output.

    ADDED Force an artificial total order to sort final values and have a deterministic output. (The corresponding <= is not always transitive, but it is good enough.)

    Definition Classes
    JoinLattice
  23. def tryCompare(x: L, y: L): Option[Int]
    Definition Classes
    JoinLattice → PartialOrdering
  24. def zero: L
    Definition Classes
    JoinLattice → Monoid