Abstract Value Members
-
implicit abstract
def
F: Bitraverse[F]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
bifoldLeftConsistentWithBifoldMap[A, B, C](fab: F[A, B], f: (A) ⇒ C, g: (B) ⇒ C)(implicit C: Monoid[C]): IsEq[C]
-
def
bifoldRightConsistentWithBifoldMap[A, B, C](fab: F[A, B], f: (A) ⇒ C, g: (B) ⇒ C)(implicit C: Monoid[C]): IsEq[C]
-
def
bifunctorComposition[A, B, C, X, Y, Z](fa: F[A, X], f: (A) ⇒ B, f2: (B) ⇒ C, g: (X) ⇒ Y, g2: (Y) ⇒ Z): IsEq[F[C, Z]]
-
def
bifunctorIdentity[A, B](fa: F[A, B]): IsEq[F[A, B]]
-
def
bifunctorLeftMapComposition[A, B, C, D](fa: F[A, B], f: (A) ⇒ C, g: (C) ⇒ D): IsEq[F[D, B]]
-
def
bifunctorLeftMapIdentity[A, B](fa: F[A, B]): IsEq[F[A, B]]
-
def
bitraverseCompose[G[_], A, B, C, D, E, H](fab: F[A, B], f: (A) ⇒ G[C], g: (B) ⇒ G[D], h: (C) ⇒ G[E], i: (D) ⇒ G[H])(implicit G: Applicative[G]): IsEq[G[G[F[E, H]]]]
-
def
bitraverseIdentity[A, B](fab: F[A, B]): IsEq[F[A, B]]
-
def
clone(): AnyRef
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
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
