Trait/Object

cats.laws.discipline

ArrowChoiceTests

Related Docs: object ArrowChoiceTests | package discipline

Permalink

trait ArrowChoiceTests[F[_, _]] extends ArrowTests[F] with ChoiceTests[F]

Linear Supertypes
ChoiceTests[F], ArrowTests[F], StrongTests[F], ProfunctorTests[F], CategoryTests[F], ComposeTests[F], Laws, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ArrowChoiceTests
  2. ChoiceTests
  3. ArrowTests
  4. StrongTests
  5. ProfunctorTests
  6. CategoryTests
  7. ComposeTests
  8. Laws
  9. AnyRef
  10. 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: ArrowChoiceLaws[F]

    Permalink
    Definition Classes
    ArrowChoiceTests → ChoiceTests → ArrowTests → StrongTests → ProfunctorTests → CategoryTests → ComposeTests

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 arrow[A, B, C, D, E, G](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[D], arg4: Arbitrary[E], arg5: Arbitrary[G], ArbFAB: Arbitrary[F[A, B]], ArbFBC: Arbitrary[F[B, C]], ArbFAC: Arbitrary[F[A, C]], ArbFCD: Arbitrary[F[C, D]], ArbFDE: Arbitrary[F[D, E]], ArbFEG: Arbitrary[F[E, G]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenD: Cogen[D], CogenE: Cogen[E], EqFAA: Eq[F[A, A]], EqFAB: Eq[F[A, B]], EqFAC: Eq[F[A, C]], EqFAD: Eq[F[A, D]], EqFAG: Eq[F[A, G]], EqFACB: Eq[F[(A, C), B]], EqFACBC: Eq[F[(A, C), (B, C)]], EqFACBD: Eq[F[(A, C), (B, D)]], EqFADCD: Eq[F[(A, D), (C, D)]], EqFADCG: Eq[F[(A, D), (C, G)]], EqFAEDE: Eq[F[(A, E), (D, E)]], EqFABC: Eq[F[A, (B, C)]], EqFEAED: Eq[F[(E, A), (E, D)]], EqFACDBCD: Eq[F[((A, C), D), (B, (C, D))]]): RuleSet

    Permalink
    Definition Classes
    ArrowTests

  5. def arrowChoice[A, B, C, D, E, G](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[D], arg4: Arbitrary[E], arg5: Arbitrary[G], ArbFAB: Arbitrary[F[A, B]], ArbFBC: Arbitrary[F[B, C]], ArbFAC: Arbitrary[F[A, C]], ArbFAD: Arbitrary[F[A, D]], ArbFCD: Arbitrary[F[C, D]], ArbFDE: Arbitrary[F[D, E]], ArbFEG: Arbitrary[F[E, G]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenD: Cogen[D], CogenE: Cogen[E], EqFAA: Eq[F[A, A]], EqFAB: Eq[F[A, B]], EqFAC: Eq[F[A, C]], EqFAD: Eq[F[A, D]], EqFAG: Eq[F[A, G]], EqFACB: Eq[F[(A, C), B]], EqFACBC: Eq[F[(A, C), (B, C)]], EqFACBD: Eq[F[(A, C), (B, D)]], EqFADCD: Eq[F[(A, D), (C, D)]], EqFADCG: Eq[F[(A, D), (C, G)]], EqFAEDE: Eq[F[(A, E), (D, E)]], EqFABC: Eq[F[A, (B, C)]], EqFEAED: Eq[F[(E, A), (E, D)]], EqFACDBCD: Eq[F[((A, C), D), (B, (C, D))]], EqFEitherABD: Eq[F[Either[A, B], D]], EqFEitherCoABC: Eq[F[A, Either[B, C]]], REqFEitherACD: Eq[F[Either[A, D], Either[C, D]]], LEqFEitherABC: Eq[F[Either[A, C], Either[B, C]]], REqFEitherABC: Eq[F[Either[C, A], Either[C, B]]], REqFEitherABCD: Eq[F[Either[A, C], Either[B, D]]], EitherAssociationABC: Eq[F[Either[Either[A, B], C], Either[D, Either[B, C]]]]): RuleSet

    Permalink

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def category[A, B, C, D](implicit ArbFAB: Arbitrary[F[A, B]], ArbFBC: Arbitrary[F[B, C]], ArbFCD: Arbitrary[F[C, D]], EqFAB: Eq[F[A, B]], EqFAD: Eq[F[A, D]]): RuleSet

    Permalink
    Definition Classes
    CategoryTests

  8. def choice[A, B, C, D](implicit ArbFAB: Arbitrary[F[A, B]], ArbFAC: Arbitrary[F[A, C]], ArbFBC: Arbitrary[F[B, C]], ArbFCD: Arbitrary[F[C, D]], EqFAB: Eq[F[A, B]], EqFAD: Eq[F[A, D]], EqFEitherABD: Eq[F[Either[A, B], D]]): RuleSet

    Permalink
    Definition Classes
    ChoiceTests

  9. def clone(): AnyRef

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

  10. def compose[A, B, C, D](implicit ArbFAB: Arbitrary[F[A, B]], ArbFBC: Arbitrary[F[B, C]], ArbFCD: Arbitrary[F[C, D]], EqFAD: Eq[F[A, D]]): RuleSet

    Permalink
    Definition Classes
    ComposeTests

  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. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  17. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  21. def profunctor[A, B, C, D, E, G](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[D], arg4: Arbitrary[E], arg5: Arbitrary[G], ArbFAB: Arbitrary[F[A, B]], ArbFCD: Arbitrary[F[C, D]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenD: Cogen[D], CogenE: Cogen[E], EqFAB: Eq[F[A, B]], EqFAD: Eq[F[A, D]], EqFAG: Eq[F[A, G]]): RuleSet

    Permalink
    Definition Classes
    ProfunctorTests

  22. def strong[A, B, C, D, E, G](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[D], arg4: Arbitrary[E], arg5: Arbitrary[G], ArbFAB: Arbitrary[F[A, B]], ArbFBC: Arbitrary[F[B, C]], ArbFCD: Arbitrary[F[C, D]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenD: Cogen[D], CogenE: Cogen[E], EqFAB: Eq[F[A, B]], EqFAD: Eq[F[A, D]], EqFAG: Eq[F[A, G]], EqFAEDE: Eq[F[(A, E), (D, E)]], EqFEAED: Eq[F[(E, A), (E, D)]]): RuleSet

    Permalink
    Definition Classes
    StrongTests

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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

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

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

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

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

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

Inherited from ChoiceTests[F]

Inherited from ArrowTests[F]

Inherited from StrongTests[F]

Inherited from ProfunctorTests[F]

Inherited from CategoryTests[F]

Inherited from ComposeTests[F]

Inherited from Laws

Inherited from AnyRef

Inherited from Any

Ungrouped