Packages

  • package root
    Definition Classes
    root
  • trait JoinLattice[L] extends Monoid[L] with PartialOrdering[L]

    A (join semi-)lattice L should support the following operations

    A (join semi-)lattice L should support the following operations

    Definition Classes
    root

trait JoinLattice[L] extends Monoid[L] with PartialOrdering[L]

A (join semi-)lattice L should support the following operations

Linear Supertypes
PartialOrdering[L], Equiv[L], Serializable, Serializable, Monoid[L], Semigroup[L], AnyRef, Any
Known Subclasses
DotLattice, IsASchemeLattice, IsCSchemeLattice, IsSchemeLattice, IsTaintLattice, LamLattice
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. JoinLattice
  2. PartialOrdering
  3. Equiv
  4. Serializable
  5. Serializable
  6. Monoid
  7. Semigroup
  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

Type Members

  1. trait JoinLatticeLaw extends AnyRef
  2. trait MonoidLaw extends scalaz.Monoid.SemigroupLaw
    Definition Classes
    Monoid
  3. trait SemigroupApply extends Apply[[α]F]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  4. trait SemigroupCompose extends Compose[[α, β]F]
    Attributes
    protected[this]
    Definition Classes
    Semigroup
  5. trait SemigroupLaw extends AnyRef
    Definition Classes
    Semigroup

Abstract Value Members

  1. abstract def bottom: L

    A lattice has a bottom element

  2. abstract def cardinality(x: L): Cardinality

    Cardinality of this value

  3. 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)

  4. abstract def isPrimitiveValue(x: L): Boolean

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

  5. abstract def join(x: L, y: L): L

    Elements of the lattice can be joined together

  6. abstract def name: String

    A name identifying the lattice

  7. abstract def subsumes(x: L, y: L): Boolean

    Subsumption between two elements can be checked

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to any2stringadd[JoinLattice[L]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (JoinLattice[L], B)
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to ArrowAssoc[JoinLattice[L]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def append(x: L, y: ⇒ L): L
    Definition Classes
    JoinLattice → Semigroup
  7. final def applicative: Applicative[[α]L]
    Definition Classes
    Monoid
  8. final def apply: Apply[[α]L]
    Definition Classes
    Semigroup
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. final def category: Category[[α, β]L]
    Definition Classes
    Monoid
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate() @throws( ... )
  12. final def compose: Compose[[α, β]L]
    Definition Classes
    Semigroup
  13. def ensuring(cond: (JoinLattice[L]) ⇒ Boolean, msg: ⇒ Any): JoinLattice[L]
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to Ensuring[JoinLattice[L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: (JoinLattice[L]) ⇒ Boolean): JoinLattice[L]
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to Ensuring[JoinLattice[L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: Boolean, msg: ⇒ Any): JoinLattice[L]
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to Ensuring[JoinLattice[L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean): JoinLattice[L]
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to Ensuring[JoinLattice[L]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  19. def equiv(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering → Equiv
  20. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to StringFormat[JoinLattice[L]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  22. def gt(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  23. def gteq(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  24. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  25. final def ifEmpty[B](a: L)(t: ⇒ B)(f: ⇒ B)(implicit eq: Equal[L]): B
    Definition Classes
    Monoid
  26. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  27. def isMZero(a: L)(implicit eq: Equal[L]): Boolean
    Definition Classes
    Monoid
  28. def lt(x: L, y: L): Boolean
    Definition Classes
    PartialOrdering
  29. def lteq(x: L, y: L): Boolean
    Definition Classes
    JoinLattice → PartialOrdering
  30. def monoidLaw: MonoidLaw
    Definition Classes
    Monoid
  31. val monoidSyntax: MonoidSyntax[L]
    Definition Classes
    Monoid
  32. def multiply(value: L, n: Int): L
    Definition Classes
    Monoid
  33. def multiply1(value: L, n: Int): L
    Definition Classes
    Semigroup
  34. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  35. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  36. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  37. final def onEmpty[A, B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  38. final def onNotEmpty[B](a: L)(v: ⇒ B)(implicit eq: Equal[L], mb: Monoid[B]): B
    Definition Classes
    Monoid
  39. def reverse: PartialOrdering[L]
    Definition Classes
    PartialOrdering
  40. def semigroupLaw: SemigroupLaw
    Definition Classes
    Semigroup
  41. val semigroupSyntax: SemigroupSyntax[L]
    Definition Classes
    Semigroup
  42. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  43. def toString(): String
    Definition Classes
    AnyRef → Any
  44. 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.)

  45. def tryCompare(x: L, y: L): Option[Int]
    Definition Classes
    JoinLattice → PartialOrdering
  46. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. def zero: L
    Definition Classes
    JoinLattice → Monoid
  50. def →[B](y: B): (JoinLattice[L], B)
    Implicit
    This member is added by an implicit conversion from JoinLattice[L] to ArrowAssoc[JoinLattice[L]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from PartialOrdering[L]

Inherited from Equiv[L]

Inherited from Serializable

Inherited from Serializable

Inherited from Monoid[L]

Inherited from Semigroup[L]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from JoinLattice[L] to any2stringadd[JoinLattice[L]]

Inherited by implicit conversion StringFormat from JoinLattice[L] to StringFormat[JoinLattice[L]]

Inherited by implicit conversion Ensuring from JoinLattice[L] to Ensuring[JoinLattice[L]]

Inherited by implicit conversion ArrowAssoc from JoinLattice[L] to ArrowAssoc[JoinLattice[L]]

Ungrouped