Arrow

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def apply[T]: Arrow[T, T]

Creates an identity arrow.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def collect[T, U](seq: Seq[Arrow[T, U]]): Arrow[T, Seq[U]]

Applies multiple arrows in parallel to an input value.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def exception[T](ex: Throwable): Arrow[Any, T]

Returns an arrow that produces a failure regardless of the input value.

def finalize(): Unit

final def fork[T, U](pool: FuturePool)(t: Arrow[T, U]): Arrow[T, U]

Forks the execution of a Task using the provided implicit execution context.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def let[T, U, V](l: Local[T], v: T)(wrapped: Arrow[U, V]): Arrow[U, V]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def recursive[T, U](r: (Arrow[T, U]) ⇒ Arrow[T, U]): Arrow[T, U]

Produces a recursive arrow.

val sum: Arrow[List[Int], Int] =
		Arrow.recursive { self =>
			Arrow[List[Int]].flatMap {
				case Nil => 0
				case head :: tail =>
					self(head).map(_ + head)
			}
		}

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def value[T](v: T): Arrow[Any, T]

Returns an arrow that produces a constant value regardless of the input value.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

implicit final def fromFuture[T](f: ⇒ Future[T]): Task[T]

Implicit conversion from Task to Task.

implicit final def toFuture[T](t: Task[T]): Future[T]

Implicit conversion from Task to Task.