Arrow

abstract def arr[A, B](f: (A) ⇒ B): =>:[A, B]

Lift an ordinary function.

abstract def compose[A, B, C](f: =>:[B, C], g: =>:[A, B]): =>:[A, C]

Associative =>: binary operator.

abstract def first[A, B, C](f: =>:[A, B]): =>:[(A, C), (B, C)]

Pass C through untouched.

abstract def id[A]: =>:[A, A]

The left and right identity over compose.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

Alias for compose.

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

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

Flipped <<<.

val arrowSyntax: ArrowSyntax[=>:]

final def asInstanceOf[T0]: T0

def categoryLaw: CategoryLaw

val categorySyntax: CategorySyntax[=>:]

def clone(): AnyRef

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

Run fab and fac on the same A.

def composeLaw: ComposeLaw

val composeSyntax: ComposeSyntax[=>:]

def contravariantInstance[C]: Contravariant[[α]=>:[α, C]]

def covariantInstance[C]: Applicative[[α]=>:[C, α]]

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

Functor map on A and B.

def empty: PlusEmpty[[α]=>:[α, α]]

monoid, but universally quantified.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def invariantFunctor: InvariantFunctor[[α]=>:[α, α]]

final def isInstanceOf[T0]: Boolean

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

Contramap on A.

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

Functor map on B.

def monoid[A]: Monoid[=>:[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[[α]=>:[α, α]]

semigroup, but universally quantified.

def product[A, B](fab: =>:[A, B]): =>:[(A, A), (B, B)]

Run two fabs alongside each other.

val profunctorSyntax: ProfunctorSyntax[=>:]

def second[A, B, C](f: =>:[A, B]): =>:[(C, A), (C, B)]

Pass C through untouched.

def semigroup[A]: Semigroup[=>:[A, A]]

The endomorphism semigroup, where append=compose.

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

Run fab and fcd alongside each other.

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

Alias for split.

val splitSyntax: SplitSyntax[=>:]

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