trait ArrowChoiceLaws[F[_, _]] extends ArrowLaws[F] with ChoiceLaws[F]
Laws that must be obeyed by any cats.arrow.ArrowChoice.
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- ArrowChoiceLaws
- ChoiceLaws
- ArrowLaws
- StrongLaws
- ProfunctorLaws
- CategoryLaws
- ComposeLaws
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
implicit abstract
def
F: ArrowChoice[F]
- Definition Classes
- ArrowChoiceLaws → ChoiceLaws → ArrowLaws → StrongLaws → ProfunctorLaws → CategoryLaws → ComposeLaws
- implicit abstract def Function: ArrowChoice[Function1]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
arrowAssociation[A, B, C, D](f: F[A, B]): IsEq[F[((A, C), D), (B, (C, D))]]
- Definition Classes
- ArrowLaws
-
def
arrowComposition[A, B, C](f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[A, C]]
- Definition Classes
- ArrowLaws
-
def
arrowExchange[A, B, C, D](f: F[A, B], g: (C) ⇒ D): IsEq[F[(A, C), (B, D)]]
- Definition Classes
- ArrowLaws
-
def
arrowExtension[A, B, C](g: (A) ⇒ B): IsEq[F[(A, C), (B, C)]]
- Definition Classes
- ArrowLaws
-
def
arrowFunctor[A, B, C, D](f: F[A, B], g: F[B, C]): IsEq[F[(A, D), (C, D)]]
- Definition Classes
- ArrowLaws
-
def
arrowIdentity[A]: IsEq[F[A, A]]
- Definition Classes
- ArrowLaws
-
def
arrowUnit[A, B, C](f: F[A, B]): IsEq[F[(A, C), B]]
- Definition Classes
- ArrowLaws
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
categoryLeftIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- CategoryLaws
-
def
categoryRightIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- CategoryLaws
-
def
choiceCompositionDistributivity[A, B, C, D](fac: F[A, C], fbc: F[B, C], fcd: F[C, D]): IsEq[F[Either[A, B], D]]
- Definition Classes
- ChoiceLaws
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
composeAssociativity[A, B, C, D](fab: F[A, B], fbc: F[B, C], fcd: F[C, D]): IsEq[F[A, D]]
- Definition Classes
- ComposeLaws
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def leftAndThenLiftedLeftApplyCommutes[A, B, C](f: F[A, B]): IsEq[F[A, Either[B, C]]]
- def leftAndThenRightIdentityCommutes[A, B, C, D](f: F[A, B], g: (C) ⇒ D): IsEq[F[Either[A, C], Either[B, D]]]
- def leftComposeCommute[A, B, C, D](f: F[A, B], g: F[B, C]): IsEq[F[Either[A, D], Either[C, D]]]
- def leftLiftCommute[A, B, C](f: (A) ⇒ B): IsEq[F[Either[A, C], Either[B, C]]]
- def leftRightConsistent[A, B, C](f: (A) ⇒ B): IsEq[F[Either[C, A], Either[C, B]]]
- def leftTwiceCommutesWithSumAssociation[A, B, C, D](f: F[A, D]): IsEq[F[Either[Either[A, B], C], Either[D, Either[B, C]]]]
-
def
mergeConsistentWithAndThen[A, B, C](f: F[A, B], g: F[A, C]): IsEq[F[A, (B, C)]]
- Definition Classes
- ArrowLaws
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
profunctorComposition[A2, A1, A0, B0, B1, B2](fab: F[A0, B0], f2: (A2) ⇒ A1, f1: (A1) ⇒ A0, g1: (B0) ⇒ B1, g2: (B1) ⇒ B2): IsEq[F[A2, B2]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorLmapComposition[A2, A1, A0, B](fab: F[A0, B], f: (A2) ⇒ A1, g: (A1) ⇒ A0): IsEq[F[A2, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorLmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorRmapComposition[A, B2, B1, B0](fab: F[A, B0], f: (B0) ⇒ B1, g: (B1) ⇒ B2): IsEq[F[A, B2]]
- Definition Classes
- ProfunctorLaws
-
def
profunctorRmapIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
- Definition Classes
- ProfunctorLaws
-
def
splitConsistentWithAndThen[A, B, C, D](f: F[A, B], g: F[C, D]): IsEq[F[(A, C), (B, D)]]
- Definition Classes
- ArrowLaws
-
def
strongFirstDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(A0, C), (B2, C)]]
- Definition Classes
- StrongLaws
-
def
strongSecondDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(C, A0), (C, B2)]]
- Definition Classes
- StrongLaws
- def sumAssoc[A, B, C](e: Either[Either[A, B], C]): Either[A, Either[B, C]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )