Trait/Object

cats.laws.discipline

BimonadTests

Related Docs: object BimonadTests | package discipline

Permalink

trait BimonadTests[F[_]] extends MonadTests[F] with ComonadTests[F]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BimonadTests
  2. ComonadTests
  3. CoflatMapTests
  4. MonadTests
  5. FlatMapTests
  6. ApplicativeTests
  7. ApplyTests
  8. CartesianTests
  9. FunctorTests
  10. InvariantTests
  11. Laws
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultRuleSet extends RuleSet with HasOneParent

    Permalink
    Definition Classes
    Laws
  2. trait HasOneParent extends AnyRef

    Permalink
    Definition Classes
    Laws
  3. trait RuleSet extends AnyRef

    Permalink
    Definition Classes
    Laws
  4. class SimpleRuleSet extends DefaultRuleSet

    Permalink
    Definition Classes
    Laws

Abstract Value Members

  1. abstract def laws: BimonadLaws[F]

    Permalink

Concrete 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 applicative[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], iso: Isomorphisms[F]): RuleSet

    Permalink
    Definition Classes
    ApplicativeTests
  5. def apply[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], iso: Isomorphisms[F]): RuleSet

    Permalink
    Definition Classes
    ApplyTests
  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def bimonad[A, B, C](implicit arg0: Arbitrary[A], arg1: Eq[A], arg2: Arbitrary[B], arg3: Eq[B], arg4: Arbitrary[C], arg5: Eq[C], ArbFA: Arbitrary[F[A]], ArbFFA: Arbitrary[F[F[A]]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenFA: Cogen[F[A]], CogenFB: Cogen[F[B]], EqFFFA: Eq[F[F[A]]], EqFFA: Eq[F[F[F[A]]]], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], EqFInt: Eq[F[Int]], iso: Isomorphisms[F]): RuleSet

    Permalink
  8. def cartesian[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], iso: Isomorphisms[F], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], EqFABC: Eq[F[(A, B, C)]]): RuleSet

    Permalink
    Definition Classes
    CartesianTests
  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def coflatMap[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenFA: Cogen[F[A]], CogenFB: Cogen[F[B]], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqFFA: Eq[F[F[A]]], EqFB: Eq[F[B]], EqFFFA: Eq[F[F[F[A]]]]): RuleSet

    Permalink
    Definition Classes
    CoflatMapTests
  11. def comonad[A, B, C](implicit arg0: Arbitrary[A], arg1: Eq[A], arg2: Arbitrary[B], arg3: Eq[B], arg4: Arbitrary[C], arg5: Eq[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenFA: Cogen[F[A]], CogenFB: Cogen[F[B]], EqFA: Eq[F[A]], EqFFA: Eq[F[F[A]]], EqFFFA: Eq[F[F[F[A]]]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    ComonadTests
  12. def emptyRuleSet: RuleSet

    Permalink
    Definition Classes
    Laws
  13. final def eq(arg0: AnyRef): Boolean

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. def flatMap[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], iso: Isomorphisms[F]): RuleSet

    Permalink
    Definition Classes
    FlatMapTests
  17. def functor[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    FunctorTests
  18. final def getClass(): Class[_]

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

    Permalink
    Definition Classes
    AnyRef → Any
  20. def invariant[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    InvariantTests
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def monad[A, B, C](implicit arg0: Arbitrary[A], arg1: Eq[A], arg2: Arbitrary[B], arg3: Eq[B], arg4: Arbitrary[C], arg5: Eq[C], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], EqFInt: Eq[F[Int]], iso: Isomorphisms[F]): RuleSet

    Permalink
    Definition Classes
    MonadTests
  23. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  26. def stackUnsafeMonad[A, B, C](implicit arg0: Arbitrary[A], arg1: Eq[A], arg2: Arbitrary[B], arg3: Eq[B], arg4: Arbitrary[C], arg5: Eq[C], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFC: Arbitrary[F[C]], ArbFAtoB: Arbitrary[F[(A) ⇒ B]], ArbFBtoC: Arbitrary[F[(B) ⇒ C]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], EqFABC: Eq[F[(A, B, C)]], EqFInt: Eq[F[Int]], iso: Isomorphisms[F]): RuleSet

    Permalink
    Definition Classes
    MonadTests
  27. final def synchronized[T0](arg0: ⇒ T0): T0

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

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

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

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

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

Inherited from ComonadTests[F]

Inherited from CoflatMapTests[F]

Inherited from MonadTests[F]

Inherited from FlatMapTests[F]

Inherited from ApplicativeTests[F]

Inherited from ApplyTests[F]

Inherited from CartesianTests[F]

Inherited from FunctorTests[F]

Inherited from InvariantTests[F]

Inherited from Laws

Inherited from AnyRef

Inherited from Any

Ungrouped