Object

com.twitter.algebird

ApplicativeLaws

Related Doc: package algebird

Permalink

object ApplicativeLaws

Basic Applicative laws, useful for testing any app.

Source
ApplicativeLaws.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ApplicativeLaws
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def applicativeLaws[M[_], T, U, V](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arbMt: Arbitrary[T], arbMts: Arbitrary[Seq[T]], arbMu: Arbitrary[U], arbFn: Arbitrary[(T) ⇒ U], arbJoinFn: Arbitrary[(T, U) ⇒ V]): Prop

    Permalink
  5. def applyLaw[M[_], T, U](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb: Arbitrary[T], arbFn: Arbitrary[(T) ⇒ U]): Prop

    Permalink
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  12. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  14. def joinLaw[M[_], T, U](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb1: Arbitrary[T], arb2: Arbitrary[U]): Prop

    Permalink
  15. def joinWithLaw[M[_], T, U, V](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arbT: Arbitrary[T], arbU: Arbitrary[U], arbJoinFn: Arbitrary[(T, U) ⇒ V]): Prop

    Permalink
  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. def sequenceLaw[M[_], T](eq: HigherEq[M] = new DefaultHigherEq[M])(implicit app: Applicative[M], arb: Arbitrary[Seq[T]]): Prop

    Permalink
  20. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped