Retryable

abstract def apply[A](a: ⇒ A): T[A]

abstract def collectFirst[A](previous: A, stream: Stream[A, T])(condition: (A) ⇒ Boolean): T[Option[A]]

abstract def complete[A](promise: Promise[A], a: T[A]): Unit

abstract def createSerial(): Serial[T]

abstract def executionContext: ExecutionContext

abstract def failure[A](exception: Throwable): T[A]

abstract def flatMap[A, B](fa: T[A])(f: (A) ⇒ T[B]): T[B]

abstract def foldLeft[A, U](initial: U, after: Option[A], stream: Stream[A, T], drop: Int, take: Option[Int])(operation: (U, A) ⇒ U): T[U]

abstract def foreach[A, B](a: A)(f: (A) ⇒ B): Unit

abstract def fromFuture[A](a: Future[A]): T[A]

abstract def fromIO[E, A](a: IO[E, A])(implicit arg0: ExceptionHandler[E]): T[A]

abstract def fromPromise[A](a: Promise[A]): T[A]

abstract def isComplete[A](a: T[A]): Boolean

abstract def map[A, B](a: A)(f: (A) ⇒ B): T[B]

abstract def none[A]: T[Option[A]]

abstract def success[A](value: A): T[A]

abstract def unit: T[Unit]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def isIncomplete[A](a: T[A]): Boolean

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def point[B](f: ⇒ T[B]): T[B]

For Async Tags apply will always run asynchronously but to cover cases where the operation might already be executed point is used.

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

def toString(): String

def toTag[X[_]](implicit converter: Converter[T, X]): Async[X]

final def wait(): Unit

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

final def wait(arg0: Long): Unit