trait
TraverseLaw extends FunctorLaw
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
composite[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ C)(implicit FC: Equal[F[C]]): Boolean
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): java.lang.Class[_]
-
def
hashCode(): Int
-
def
identity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean
-
def
identityTraverse[A, B](fa: F[A], f: (A) ⇒ B)(implicit FB: Equal[F[B]]): Boolean
-
def
invariantComposite[A, B, C](fa: F[A], f1: (A) ⇒ B, g1: (B) ⇒ A, f2: (B) ⇒ C, g2: (C) ⇒ B)(implicit FC: Equal[F[C]]): Boolean
-
def
invariantIdentity[A](fa: F[A])(implicit FA: Equal[F[A]]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
naturality[N[_], M[_], A](nat: ~>[M, N])(fma: F[M[A]])(implicit N: Applicative[N], M: Applicative[M], NFA: Equal[N[F[A]]]): Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
parallelFusion[N[_], M[_], A, B](fa: F[A], amb: (A) ⇒ M[B], anb: (A) ⇒ N[B])(implicit N: Applicative[N], M: Applicative[M], MN: Equal[(M[F[B]], N[F[B]])]): Boolean
-
def
purity[G[_], A](fa: F[A])(implicit G: Applicative[G], GFA: Equal[G[F[A]]]): Boolean
-
def
sequentialFusion[N[_], M[_], A, B, C](fa: F[A], amb: (A) ⇒ M[B], bnc: (B) ⇒ N[C])(implicit N: Applicative[N], M: Applicative[M], MN: Equal[M[N[F[C]]]]): Boolean
-
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
Inherited from AnyRef
Inherited from Any