Trait/Object

cats.laws.discipline

MonadCombineTests

Related Docs: object MonadCombineTests | package discipline

Permalink

trait MonadCombineTests[F[_]] extends MonadFilterTests[F] with AlternativeTests[F]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadCombineTests
  2. AlternativeTests
  3. MonoidKTests
  4. SemigroupKTests
  5. MonadFilterTests
  6. MonadTests
  7. FlatMapTests
  8. ApplicativeTests
  9. ApplyTests
  10. FunctorTests
  11. InvariantTests
  12. Laws
  13. AnyRef
  14. 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: MonadCombineLaws[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 alternative[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], ArbFAB: Arbitrary[F[(A) ⇒ B]], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    AlternativeTests
  5. def applicative[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    ApplicativeTests
  6. def apply[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def emptyRuleSet: RuleSet

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

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

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

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def flatMap[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    FlatMapTests
  14. def functor[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

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

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

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

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

    Permalink
    Definition Classes
    Any
  19. def monad[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    MonadTests
  20. def monadCombine[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]], arbFAB: Arbitrary[F[(A) ⇒ B]]): RuleSet

    Permalink
  21. def monadFilter[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbF: ArbitraryK[F], EqFA: Eq[F[A]], EqFB: Eq[F[B]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    MonadFilterTests
  22. def monoidK[A](implicit arg0: Arbitrary[A], ArbF: ArbitraryK[F], EqFA: Eq[F[A]]): RuleSet

    Permalink
    Definition Classes
    MonoidKTests
  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 semigroupK[A](implicit arg0: Arbitrary[A], ArbF: ArbitraryK[F], EqFA: Eq[F[A]]): RuleSet

    Permalink
    Definition Classes
    SemigroupKTests
  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 AlternativeTests[F]

Inherited from MonoidKTests[F]

Inherited from SemigroupKTests[F]

Inherited from MonadFilterTests[F]

Inherited from MonadTests[F]

Inherited from FlatMapTests[F]

Inherited from ApplicativeTests[F]

Inherited from ApplyTests[F]

Inherited from FunctorTests[F]

Inherited from InvariantTests[F]

Inherited from Laws

Inherited from AnyRef

Inherited from Any

Ungrouped