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
bijection[F[_], G[_], A, B](t: (A) ⇒ F[B], f: (B) ⇒ G[A]): BijectionT[F, G, A, B]
-
def
bijectionId[F[_], G[_], A](implicit PF: Applicative[F], PG: Applicative[G]): BijectionT[F, G, A, A]
-
implicit
def
bijectionTCategory[F[_], G[_]](implicit F0: Monad[F], G0: Monad[G]): Category[[α, β]BijectionT[F, G, α, β]]
-
implicit
def
bijectionTSplit[F[_], G[_]](implicit F0: Bind[F], G0: Bind[G]): Split[[α, β]BijectionT[F, G, α, β]]
-
def
clone(): AnyRef
-
def
curryB[A, B, C]: Bijection[(A, B) ⇒ C, (A) ⇒ (B) ⇒ C]
-
def
eitherB[A]: Bijection[\/[A, A], (Boolean, A)]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftBijection[F[_], G[_], A, B](t: (A) ⇒ B, f: (B) ⇒ A)(implicit PF: Applicative[F], PG: Applicative[G]): BijectionT[F, G, A, B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
tuple3B[A, B, C]: Bijection[(A, B, C), (A, (B, C))]
-
def
tuple4B[A, B, C, D]: Bijection[(A, B, C, D), (A, (B, (C, D)))]
-
def
tuple5B[A, B, C, D, E]: Bijection[(A, B, C, D, E), (A, (B, (C, (D, E))))]
-
def
tuple6B[A, B, C, D, E, H]: Bijection[(A, B, C, D, E, H), (A, (B, (C, (D, (E, H)))))]
-
def
tuple7B[A, B, C, D, E, H, I]: Bijection[(A, B, C, D, E, H, I), (A, (B, (C, (D, (E, (H, I))))))]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zipB[X[_], A, B](implicit Z: Zip[X], U: Unzip[X]): Bijection[(X[A], X[B]), X[(A, B)]]
-
-
def
zipListB[A, B]: Bijection[(List[A], List[B]), List[(A, B)]]
-
def
zipReaderB[T, A, B]: Bijection[((T) ⇒ A, (T) ⇒ B), (T) ⇒ (A, B)]
Inherited from AnyRef
Inherited from Any
