trait
DistributiveLaws[F[_]] extends FunctorLaws[F]
Abstract Value Members
-
implicit abstract
def
F: Distributive[F]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
composition[A, B, C, M[_], N[_]](ma: M[A], f: (A) ⇒ F[B], g: (B) ⇒ N[C])(implicit N: Distributive[N], M: Functor[M]): IsEq[Nested[F, N, M[C]]]
-
def
cosequenceIdentity[A](fa: F[A]): IsEq[F[A]]
-
def
cosequenceTwiceIsId[A, M[_]](fma: F[M[A]])(implicit M: Distributive[M]): IsEq[F[M[A]]]
-
def
covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]
-
def
covariantIdentity[A](fa: F[A]): IsEq[F[A]]
-
def
distributeIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]
-
def
invariantIdentity[A](fa: F[A]): IsEq[F[A]]
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
