Trait/Object

cats.laws.discipline

CommutativeMonadTests

Related Docs: object CommutativeMonadTests | package discipline

Permalink

trait CommutativeMonadTests[F[_]] extends MonadTests[F] with CommutativeFlatMapTests[F]

Linear Supertypes
CommutativeFlatMapTests[F], MonadTests[F], FlatMapTests[F], ApplicativeTests[F], ApplyTests[F], CartesianTests[F], FunctorTests[F], InvariantTests[F], Laws, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CommutativeMonadTests
  2. CommutativeFlatMapTests
  3. MonadTests
  4. FlatMapTests
  5. ApplicativeTests
  6. ApplyTests
  7. CartesianTests
  8. FunctorTests
  9. InvariantTests
  10. Laws
  11. AnyRef
  12. 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: CommutativeMonadLaws[F]

    Permalink
    Definition Classes
    CommutativeMonadTests → CommutativeFlatMapTests → MonadTests → FlatMapTests → ApplicativeTests → ApplyTests → CartesianTests → FunctorTests → InvariantTests

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 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

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. def commutativeFlatMap[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
    CommutativeFlatMapTests

  10. def commutativeMonad[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

  11. def emptyRuleSet: RuleSet

    Permalink
    Definition Classes
    Laws

  12. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  14. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  15. 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

  16. 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

  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  19. 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

  20. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  21. 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

  22. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  25. 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

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

    Permalink
    Definition Classes
    AnyRef

  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  28. final def wait(): Unit

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

  29. final def wait(arg0: Long, arg1: Int): Unit

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

  30. final def wait(arg0: Long): Unit

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

Inherited from CommutativeFlatMapTests[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