trait BIOAsync3[F[-_, +_, +_]] extends BIOConcurrent3[F] with BIO3[F]
- Alphabetic
- By Inheritance
- BIOAsync3
- BIO3
- BIOPanic3
- BIOPanicSyntax
- BIOBracket3
- BIOError3
- BIOMonad3
- BIOApplicativeError3
- BIOBifunctor3
- BIOGuarantee3
- BIOApplicative3
- BIOFunctor3
- BIOConcurrent3
- BIOParallel3
- BIORootBifunctor
- BIORoot
- PredefinedHelper
- DivergenceHelper
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Type Members
- final type Canceler = F[Any, Nothing, Unit]
- type Divergence = Nondivergent
- Definition Classes
- DivergenceHelper
- type IsPredefined = NotPredefined
- Definition Classes
- PredefinedHelper
- final type Just[+A] = F[Any, Nothing, A]
- Definition Classes
- BIO3
- final type Or[+E, +A] = F[Any, E, A]
- Definition Classes
- BIO3
Abstract Value Members
- abstract def async[E, A](register: ((Either[E, A]) => Unit) => Unit): F[Any, E, A]
- abstract def asyncCancelable[E, A](register: ((Either[E, A]) => Unit) => Canceler): F[Any, E, A]
- abstract def asyncF[R, E, A](register: ((Either[E, A]) => Unit) => F[R, E, Unit]): F[R, E, A]
- abstract def bracketCase[R, E, A, B](acquire: F[R, E, A])(release: (A, BIOExit[E, B]) => F[R, Nothing, Unit])(use: (A) => F[R, E, B]): F[R, E, B]
- Definition Classes
- BIOBracket3
- abstract def catchAll[R, E, A, E2](r: F[R, E, A])(f: (E) => F[R, E2, A]): F[R, E2, A]
- Definition Classes
- BIOError3
- abstract def catchSome[R, E, A, E1 >: E](r: F[R, E, A])(f: PartialFunction[E, F[R, E1, A]]): F[R, E1, A]
- Definition Classes
- BIOError3
- abstract def fail[E](v: => E): F[Any, E, Nothing]
- Definition Classes
- BIOApplicativeError3
- abstract def flatMap[R, E, A, B](r: F[R, E, A])(f: (A) => F[R, E, B]): F[R, E, B]
- Definition Classes
- BIOMonad3
- abstract def fromFuture[A](mkFuture: (ExecutionContext) => Future[A]): F[Any, Throwable, A]
- abstract def fromFutureJava[A](javaFuture: => CompletionStage[A]): F[Any, Throwable, A]
- abstract def parTraverse[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, List[B]]
- Definition Classes
- BIOParallel3
- abstract def parTraverseN[R, E, A, B](maxConcurrent: Int)(l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, List[B]]
- Definition Classes
- BIOParallel3
- abstract def pure[A](a: A): F[Any, Nothing, A]
- Definition Classes
- BIOApplicative3
- abstract def race[R, E, A](r1: F[R, E, A], r2: F[R, E, A]): F[R, E, A]
Race two actions, the winner is the first action to TERMINATE, whether by success or failure
Race two actions, the winner is the first action to TERMINATE, whether by success or failure
- Definition Classes
- BIOConcurrent3
- abstract def racePair[R, E, A, B](fa: F[R, E, A], fb: F[R, E, B]): F[R, E, Either[(A, BIOFiber3[F, E, B]), (BIOFiber3[F, E, A], B)]]
Race two actions, the winner is the first action to TERMINATE, whether by success or failure
Race two actions, the winner is the first action to TERMINATE, whether by success or failure
- Definition Classes
- BIOConcurrent3
- abstract def sandbox[R, E, A](r: F[R, E, A]): F[R, Failure[E], A]
- Definition Classes
- BIOPanic3
- abstract def sync[A](effect: => A): F[Any, Nothing, A]
- Definition Classes
- BIO3
- abstract def syncThrowable[A](effect: => A): F[Any, Throwable, A]
- Definition Classes
- BIO3
- abstract def terminate(v: => Throwable): F[Any, Nothing, Nothing]
- Definition Classes
- BIOPanic3
- abstract def uninterruptible[R, E, A](r: F[R, E, A]): F[R, E, A]
- Definition Classes
- BIOConcurrent3
- abstract def yieldNow: F[Any, Nothing, Unit]
- Definition Classes
- BIOConcurrent3
- abstract def zipWithPar[R, E, A, B, C](fa: F[R, E, A], fb: F[R, E, B])(f: (A, B) => C): F[R, E, C]
Returns an effect that executes both effects, in parallel, combining their results with the specified
f
function.Returns an effect that executes both effects, in parallel, combining their results with the specified
f
function. If either side fails, then the other side will be interrupted.- Definition Classes
- BIOParallel3
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def *>[R, E, A, B](f: F[R, E, A], next: => F[R, E, B]): F[R, E, B]
execute two operations in order, return result of second operation
execute two operations in order, return result of second operation
- Definition Classes
- BIOMonad3 → BIOApplicative3
- def <*[R, E, A, B](f: F[R, E, A], next: => F[R, E, B]): F[R, E, A]
execute two operations in order, same as
*>
, but return result of first operationexecute two operations in order, same as
*>
, but return result of first operation- Definition Classes
- BIOMonad3 → BIOApplicative3
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def InnerF: BIOPanic3[F]
- Definition Classes
- BIOAsync3 → BIOApplicativeError3 → BIOBifunctor3 → BIOConcurrent3 → BIOParallel3
- final def apply[A](effect: => A): F[Any, Throwable, A]
- Definition Classes
- BIO3
- Annotations
- @inline()
- def as[R, E, A, B](r: F[R, E, A])(v: => B): F[R, E, B]
- Definition Classes
- BIOFunctor3
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def attempt[R, E, A](r: F[R, E, A]): F[R, Nothing, Either[E, A]]
- Definition Classes
- BIOError3
- def bimap[R, E, A, E2, B](r: F[R, E, A])(f: (E) => E2, g: (A) => B): F[R, E2, B]
- Definition Classes
- BIOError3 → BIOBifunctor3
- def bracket[R, E, A, B](acquire: F[R, E, A])(release: (A) => F[R, Nothing, Unit])(use: (A) => F[R, E, B]): F[R, E, B]
- Definition Classes
- BIOBracket3
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flatten[R, E, A](r: F[R, E, F[R, E, A]]): F[R, E, A]
- Definition Classes
- BIOMonad3
- def flip[R, E, A](r: F[R, E, A]): F[R, A, E]
- Definition Classes
- BIOError3
- final def forever[R, E, A](r: F[R, E, A]): F[R, E, Nothing]
- Definition Classes
- BIOApplicative3
- Annotations
- @inline()
- def fromEither[E, A](effect: => Either[E, A]): F[Any, E, A]
- Definition Classes
- BIO3 → BIOApplicativeError3
- final def fromFuture[A](mkFuture: => Future[A]): F[Any, Throwable, A]
- Annotations
- @inline()
- def fromOption[E, A](errorOnNone: => E)(effect: => Option[A]): F[Any, E, A]
- Definition Classes
- BIO3 → BIOApplicativeError3
- def fromTry[A](effect: => Try[A]): F[Any, Throwable, A]
- Definition Classes
- BIO3 → BIOApplicativeError3
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def guarantee[R, E, A](f: F[R, E, A], cleanup: F[R, Nothing, Unit]): F[R, E, A]
- Definition Classes
- BIOBracket3 → BIOGuarantee3
- def guaranteeCase[R, E, A](f: F[R, E, A], cleanup: (BIOExit[E, A]) => F[R, Nothing, Unit]): F[R, E, A]
- Definition Classes
- BIOBracket3
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def ifThenElse[R, E, E1, A](cond: F[R, E, Boolean])(ifTrue: F[R, E1, A], ifFalse: F[R, E1, A])(implicit ev: <:<[E, E1]): F[R, E1, A]
- Definition Classes
- BIOMonad3
- Annotations
- @inline()
- final def ifThenElse[R, E, A](cond: Boolean)(ifTrue: F[R, E, A], ifFalse: F[R, E, A]): F[R, E, A]
- Definition Classes
- BIOApplicative3
- Annotations
- @inline()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def leftFlatMap[R, E, A, E2](r: F[R, E, A])(f: (E) => F[R, Nothing, E2]): F[R, E2, A]
- Definition Classes
- BIOError3
- def leftMap[R, E, A, E2](r: F[R, E, A])(f: (E) => E2): F[R, E2, A]
- Definition Classes
- BIOBifunctor3
- def leftMap2[R, E, A, E2, E3](firstOp: F[R, E, A], secondOp: => F[R, E2, A])(f: (E, E2) => E3): F[R, E3, A]
map errors from two operations into a new error if both fail
map errors from two operations into a new error if both fail
- Definition Classes
- BIOError3 → BIOApplicativeError3
- def map[R, E, A, B](r: F[R, E, A])(f: (A) => B): F[R, E, B]
- Definition Classes
- BIOMonad3 → BIOFunctor3
- def map2[R, E, A, B, C](r1: F[R, E, A], r2: => F[R, E, B])(f: (A, B) => C): F[R, E, C]
execute two operations in order, map their results
execute two operations in order, map their results
- Definition Classes
- BIOMonad3 → BIOApplicative3
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def never: F[Any, Nothing, Nothing]
- Definition Classes
- BIOAsync3 → BIOConcurrent3
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def orElse[R, E, A, E2](r: F[R, E, A], f: => F[R, E2, A]): F[R, E2, A]
execute second operation only if the first one fails
execute second operation only if the first one fails
- Definition Classes
- BIOError3 → BIOApplicativeError3
- final def orTerminate[R, A](r: F[R, Throwable, A]): F[R, Nothing, A]
- Definition Classes
- BIOPanic3
- Annotations
- @inline()
- def parTraverseN_[R, E, A, B](maxConcurrent: Int)(l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, Unit]
- Definition Classes
- BIOParallel3
- def parTraverse_[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, Unit]
- Definition Classes
- BIOParallel3
- def redeem[R, E, A, E2, B](r: F[R, E, A])(err: (E) => F[R, E2, B], succ: (A) => F[R, E2, B]): F[R, E2, B]
- Definition Classes
- BIOError3
- def redeemPure[R, E, A, B](r: F[R, E, A])(err: (E) => B, succ: (A) => B): F[R, Nothing, B]
- Definition Classes
- BIOError3
- def sequence[R, E, A, B](l: Iterable[F[R, E, A]]): F[R, E, List[A]]
- Definition Classes
- BIOApplicative3
- def sequence_[R, E](l: Iterable[F[R, E, Unit]]): F[R, E, Unit]
- Definition Classes
- BIOApplicative3
- def suspend[R, A](effect: => F[R, Throwable, A]): F[R, Throwable, A]
- Definition Classes
- BIO3
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tailRecM[R, E, A, B](a: A)(f: (A) => F[R, E, Either[A, B]]): F[R, E, B]
- Definition Classes
- BIOMonad3
- def tap[R, E, A](r: F[R, E, A])(f: (A) => F[R, E, Unit]): F[R, E, A]
- Definition Classes
- BIOMonad3
- def tapBoth[R, E, A, E1 >: E](r: F[R, E, A])(err: (E) => F[R, E1, Unit], succ: (A) => F[R, E1, Unit]): F[R, E1, A]
- Definition Classes
- BIOError3
- def tapError[R, E, A, E1 >: E](r: F[R, E, A])(f: (E) => F[R, E1, Unit]): F[R, E1, A]
- Definition Classes
- BIOError3
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def traverse[R, E, A, B](o: Option[A])(f: (A) => F[R, E, B]): F[R, E, Option[B]]
- Definition Classes
- BIOApplicative3
- Annotations
- @inline()
- def traverse[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, List[B]]
- Definition Classes
- BIOApplicative3
- def traverse_[R, E, A](l: Iterable[A])(f: (A) => F[R, E, Unit]): F[R, E, Unit]
- Definition Classes
- BIOApplicative3
- def unit: F[Any, Nothing, Unit]
- Definition Classes
- BIOApplicative3
- final def unless[R, E, E1](cond: F[R, E, Boolean])(ifFalse: F[R, E1, Unit])(implicit ev: <:<[E, E1]): F[R, E1, Unit]
- Definition Classes
- BIOMonad3
- Annotations
- @inline()
- final def unless[R, E](cond: Boolean)(ifFalse: F[R, E, Unit]): F[R, E, Unit]
- Definition Classes
- BIOApplicative3
- Annotations
- @inline()
- def void[R, E, A](r: F[R, E, A]): F[R, E, Unit]
- Definition Classes
- BIOFunctor3
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def when[R, E, E1](cond: F[R, E, Boolean])(ifTrue: F[R, E1, Unit])(implicit ev: <:<[E, E1]): F[R, E1, Unit]
- Definition Classes
- BIOMonad3
- Annotations
- @inline()
- final def when[R, E](cond: Boolean)(ifTrue: F[R, E, Unit]): F[R, E, Unit]
- Definition Classes
- BIOApplicative3
- Annotations
- @inline()
- final def widen[R, E, A, A1](r: F[R, E, A])(implicit ev: <:<[A, A1]): F[R, E, A1]
- Definition Classes
- BIOFunctor3
- Annotations
- @inline()
- final def widenBoth[R, E, A, E1, A1](r: F[R, E, A])(implicit ev: <:<[E, E1], ev2: <:<[A, A1]): F[R, E1, A1]
- Definition Classes
- BIOBifunctor3
- Annotations
- @inline()
- final def widenError[R, E, A, E1](r: F[R, E, A])(implicit ev: <:<[E, E1]): F[R, E1, A]
- Definition Classes
- BIOBifunctor3
- Annotations
- @inline()
- final def withFilter[R, E, A](r: F[R, E, A])(predicate: (A) => Boolean)(implicit filter: BIOWithFilter[E], pos: SourceFilePositionMaterializer): F[R, E, A]
for-comprehensions sugar:
for-comprehensions sugar:
for { (1, 2) <- F.pure((2, 1)) } yield ()
Use widenError to for pattern matching with non-Throwable errors:
val f = for { (1, 2) <- F.pure((2, 1)).widenError[Option[Unit]] } yield () // f: F[Option[Unit], Unit] = F.fail(Some(())
- Definition Classes
- BIOError3
- Annotations
- @inline()
- def zipPar[R, E, A, B](fa: F[R, E, A], fb: F[R, E, B]): F[R, E, (A, B)]
Returns an effect that executes both effects, in parallel, combining their results into a tuple.
Returns an effect that executes both effects, in parallel, combining their results into a tuple. If either side fails, then the other side will be interrupted.
- Definition Classes
- BIOParallel3
- def zipParLeft[R, E, A, B](fa: F[R, E, A], fb: F[R, E, B]): F[R, E, A]
Returns an effect that executes both effects, in parallel, the left effect result is returned.
Returns an effect that executes both effects, in parallel, the left effect result is returned. If either side fails, then the other side will be interrupted.
- Definition Classes
- BIOParallel3
- def zipParRight[R, E, A, B](fa: F[R, E, A], fb: F[R, E, B]): F[R, E, B]
Returns an effect that executes both effects, in parallel, the right effect result is returned.
Returns an effect that executes both effects, in parallel, the right effect result is returned. If either side fails, then the other side will be interrupted.
- Definition Classes
- BIOParallel3