IsomorphismArrow

implicit abstract def G: Arrow[G]

abstract def iso: Isomorphism.<~~>[F, G]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def <<<[A, B, C](fbc: F[B, C], fab: F[A, B]): F[A, C]

Alias for compose.

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def >>>[A, B, C](fab: F[A, B], fbc: F[B, C]): F[A, C]

Flipped <<<.

def arr[A, B](f: (A) ⇒ B): F[A, B]

Lift an ordinary function.

val arrowSyntax: ArrowSyntax[F]

final def asInstanceOf[T0]: T0

def categoryLaw: CategoryLaw

val categorySyntax: CategorySyntax[F]

def clone(): AnyRef

def combine[A, B, C](fab: F[A, B], fac: F[A, C]): F[A, (B, C)]

Run fab and fac on the same A.

def compose[A, B, C](f: F[B, C], g: F[A, B]): F[A, C]

Associative =>: binary operator.

def composeLaw: ComposeLaw

val composeSyntax: ComposeSyntax[F]

def contravariantInstance[C]: Contravariant[[α$2$]F[α$2$, C]]

def covariantInstance[C]: Applicative[[β$0$]F[C, β$0$]]

def dimap[A, B, C, D](fab: F[A, B])(f: (C) ⇒ A)(g: (B) ⇒ D): F[C, D]

Functor map on A and B.

def empty: PlusEmpty[[α]F[α, α]]

monoid, but universally quantified.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def first[A, B, C](fa: F[A, B]): F[(A, C), (B, C)]

final def getClass(): Class[_]

def hashCode(): Int

def id[A]: F[A, A]

The left and right identity over compose.

def invariantFunctor: InvariantFunctor[[α]F[α, α]]

final def isInstanceOf[T0]: Boolean

def mapfst[A, B, C](fab: F[A, B])(f: (C) ⇒ A): F[C, B]

Contramap on A.

def mapsnd[A, B, C](fab: F[A, B])(f: (B) ⇒ C): F[A, C]

Functor map on B.

def monoid[A]: Monoid[F[A, A]]

The endomorphism monoid, where zero=id and append=compose.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def plus: Plus[[α]F[α, α]]

semigroup, but universally quantified.

def product[A, B](fab: F[A, B]): F[(A, A), (B, B)]

Run two fabs alongside each other.

val profunctorSyntax: ProfunctorSyntax[F]

def second[A, B, C](fa: F[A, B]): F[(C, A), (C, B)]

def semigroup[A]: Semigroup[F[A, A]]

The endomorphism semigroup, where append=compose.

def split[A, B, C, D](f: F[A, B], g: F[C, D]): F[(A, C), (B, D)]

final def splitA[A, B, C, D](fab: F[A, B], fcd: F[C, D]): F[(A, C), (B, D)]

Alias for split.

val splitSyntax: SplitSyntax[F]

val strongSyntax: StrongSyntax[F]

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