Abstract Value Members
-
implicit abstract
def
F: Arrow[F]
Concrete Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
final
def
==(arg0: Any): Boolean
-
def
arrowAssociation[A, B, C, D](f: F[A, B]): IsEq[F[((A, C), D), (B, (C, D))]]
-
def
arrowComposition[A, B, C](f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[A, C]]
-
def
arrowExchange[A, B, C, D](f: F[A, B], g: (C) ⇒ D): IsEq[F[(A, C), (B, D)]]
-
def
arrowExtension[A, B, C](g: (A) ⇒ B): IsEq[F[(A, C), (B, C)]]
-
def
arrowFunctor[A, B, C, D](f: F[A, B], g: F[B, C]): IsEq[F[(A, D), (C, D)]]
-
def
arrowIdentity[A]: IsEq[F[A, A]]
-
def
arrowUnit[A, B, C](f: F[A, B]): IsEq[F[(A, C), B]]
-
final
def
asInstanceOf[T0]: T0
-
def
categoryLeftIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
-
def
categoryRightIdentity[A, B](f: F[A, B]): IsEq[F[A, B]]
-
def
clone(): AnyRef
-
def
composeAssociativity[A, B, C, D](fab: F[A, B], fbc: F[B, C], fcd: F[C, D]): IsEq[F[A, D]]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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]]
-
def
profunctorIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
-
def
splitInterchange[A1, A2, A3, B1, B2, B3](f1: F[A1, A2], f2: F[A2, A3], g1: F[B1, B2], g2: F[B2, B3]): IsEq[F[(A1, B1), (A3, B3)]]
-
def
strongFirstDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(A0, C), (B2, C)]]
-
def
strongSecondDistributivity[A0, A1, B1, B2, C](fab: F[A1, B1], f: (A0) ⇒ A1, g: (B1) ⇒ B2): IsEq[F[(C, A0), (C, B2)]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Laws that must be obeyed by any
cats.arrow.Arrow.