Packages

trait BIOAsync3[F[-_, +_, +_]] extends BIOConcurrent3[F] with BIO3[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BIOAsync3
  2. BIO3
  3. BIOPanic3
  4. BIOPanicSyntax
  5. BIOBracket3
  6. BIOError3
  7. BIOMonad3
  8. BIOApplicativeError3
  9. BIOBifunctor3
  10. BIOGuarantee3
  11. BIOApplicative3
  12. BIOFunctor3
  13. BIOConcurrent3
  14. BIOParallel3
  15. BIORootBifunctor
  16. BIORoot
  17. PredefinedHelper
  18. DivergenceHelper
  19. AnyRef
  20. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. final type Canceler = F[Any, Nothing, Unit]
  2. type Divergence = Nondivergent
    Definition Classes
    DivergenceHelper
  3. type IsPredefined = NotPredefined
    Definition Classes
    PredefinedHelper
  4. final type Just[+A] = F[Any, Nothing, A]
    Definition Classes
    BIO3
  5. final type Or[+E, +A] = F[Any, E, A]
    Definition Classes
    BIO3

Abstract Value Members

  1. abstract def async[E, A](register: ((Either[E, A]) => Unit) => Unit): F[Any, E, A]
  2. abstract def asyncCancelable[E, A](register: ((Either[E, A]) => Unit) => Canceler): F[Any, E, A]
  3. abstract def asyncF[R, E, A](register: ((Either[E, A]) => Unit) => F[R, E, Unit]): F[R, E, A]
  4. 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
  5. 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
  6. 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
  7. abstract def fail[E](v: => E): F[Any, E, Nothing]
    Definition Classes
    BIOApplicativeError3
  8. 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
  9. abstract def fromFuture[A](mkFuture: (ExecutionContext) => Future[A]): F[Any, Throwable, A]
  10. abstract def fromFutureJava[A](javaFuture: => CompletionStage[A]): F[Any, Throwable, A]
  11. abstract def parTraverse[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, List[B]]
    Definition Classes
    BIOParallel3
  12. 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
  13. abstract def pure[A](a: A): F[Any, Nothing, A]
    Definition Classes
    BIOApplicative3
  14. 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
  15. 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
  16. abstract def sandbox[R, E, A](r: F[R, E, A]): F[R, Failure[E], A]
    Definition Classes
    BIOPanic3
  17. abstract def sync[A](effect: => A): F[Any, Nothing, A]
    Definition Classes
    BIO3
  18. abstract def syncThrowable[A](effect: => A): F[Any, Throwable, A]
    Definition Classes
    BIO3
  19. abstract def terminate(v: => Throwable): F[Any, Nothing, Nothing]
    Definition Classes
    BIOPanic3
  20. abstract def uninterruptible[R, E, A](r: F[R, E, A]): F[R, E, A]
    Definition Classes
    BIOConcurrent3
  21. abstract def yieldNow: F[Any, Nothing, Unit]
    Definition Classes
    BIOConcurrent3
  22. 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

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. 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
    BIOMonad3BIOApplicative3
  4. 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 operation

    execute two operations in order, same as *>, but return result of first operation

    Definition Classes
    BIOMonad3BIOApplicative3
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. def InnerF: BIOPanic3[F]
  7. final def apply[A](effect: => A): F[Any, Throwable, A]
    Definition Classes
    BIO3
    Annotations
    @inline()
  8. def as[R, E, A, B](r: F[R, E, A])(v: => B): F[R, E, B]
    Definition Classes
    BIOFunctor3
  9. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  10. def attempt[R, E, A](r: F[R, E, A]): F[R, Nothing, Either[E, A]]
    Definition Classes
    BIOError3
  11. def bimap[R, E, A, E2, B](r: F[R, E, A])(f: (E) => E2, g: (A) => B): F[R, E2, B]
    Definition Classes
    BIOError3BIOBifunctor3
  12. 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
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  17. def flatten[R, E, A](r: F[R, E, F[R, E, A]]): F[R, E, A]
    Definition Classes
    BIOMonad3
  18. def flip[R, E, A](r: F[R, E, A]): F[R, A, E]
    Definition Classes
    BIOError3
  19. final def forever[R, E, A](r: F[R, E, A]): F[R, E, Nothing]
    Definition Classes
    BIOApplicative3
    Annotations
    @inline()
  20. def fromEither[E, A](effect: => Either[E, A]): F[Any, E, A]
    Definition Classes
    BIO3BIOApplicativeError3
  21. final def fromFuture[A](mkFuture: => Future[A]): F[Any, Throwable, A]
    Annotations
    @inline()
  22. def fromOption[E, A](errorOnNone: => E)(effect: => Option[A]): F[Any, E, A]
    Definition Classes
    BIO3BIOApplicativeError3
  23. def fromTry[A](effect: => Try[A]): F[Any, Throwable, A]
    Definition Classes
    BIO3BIOApplicativeError3
  24. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. def guarantee[R, E, A](f: F[R, E, A], cleanup: F[R, Nothing, Unit]): F[R, E, A]
    Definition Classes
    BIOBracket3BIOGuarantee3
  26. 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
  27. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  28. 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()
  29. 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()
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. def leftFlatMap[R, E, A, E2](r: F[R, E, A])(f: (E) => F[R, Nothing, E2]): F[R, E2, A]
    Definition Classes
    BIOError3
  32. def leftMap[R, E, A, E2](r: F[R, E, A])(f: (E) => E2): F[R, E2, A]
    Definition Classes
    BIOBifunctor3
  33. 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
    BIOError3BIOApplicativeError3
  34. def map[R, E, A, B](r: F[R, E, A])(f: (A) => B): F[R, E, B]
    Definition Classes
    BIOMonad3BIOFunctor3
  35. 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
    BIOMonad3BIOApplicative3
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def never: F[Any, Nothing, Nothing]
    Definition Classes
    BIOAsync3BIOConcurrent3
  38. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  40. 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
    BIOError3BIOApplicativeError3
  41. final def orTerminate[R, A](r: F[R, Throwable, A]): F[R, Nothing, A]
    Definition Classes
    BIOPanic3
    Annotations
    @inline()
  42. def parTraverseN_[R, E, A, B](maxConcurrent: Int)(l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, Unit]
    Definition Classes
    BIOParallel3
  43. def parTraverse_[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, Unit]
    Definition Classes
    BIOParallel3
  44. 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
  45. def redeemPure[R, E, A, B](r: F[R, E, A])(err: (E) => B, succ: (A) => B): F[R, Nothing, B]
    Definition Classes
    BIOError3
  46. def sequence[R, E, A, B](l: Iterable[F[R, E, A]]): F[R, E, List[A]]
    Definition Classes
    BIOApplicative3
  47. def sequence_[R, E](l: Iterable[F[R, E, Unit]]): F[R, E, Unit]
    Definition Classes
    BIOApplicative3
  48. def suspend[R, A](effect: => F[R, Throwable, A]): F[R, Throwable, A]
    Definition Classes
    BIO3
  49. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  50. def tailRecM[R, E, A, B](a: A)(f: (A) => F[R, E, Either[A, B]]): F[R, E, B]
    Definition Classes
    BIOMonad3
  51. def tap[R, E, A](r: F[R, E, A])(f: (A) => F[R, E, Unit]): F[R, E, A]
    Definition Classes
    BIOMonad3
  52. 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
  53. 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
  54. def toString(): String
    Definition Classes
    AnyRef → Any
  55. 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()
  56. def traverse[R, E, A, B](l: Iterable[A])(f: (A) => F[R, E, B]): F[R, E, List[B]]
    Definition Classes
    BIOApplicative3
  57. def traverse_[R, E, A](l: Iterable[A])(f: (A) => F[R, E, Unit]): F[R, E, Unit]
    Definition Classes
    BIOApplicative3
  58. def unit: F[Any, Nothing, Unit]
    Definition Classes
    BIOApplicative3
  59. 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()
  60. final def unless[R, E](cond: Boolean)(ifFalse: F[R, E, Unit]): F[R, E, Unit]
    Definition Classes
    BIOApplicative3
    Annotations
    @inline()
  61. def void[R, E, A](r: F[R, E, A]): F[R, E, Unit]
    Definition Classes
    BIOFunctor3
  62. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  63. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  64. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  65. 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()
  66. final def when[R, E](cond: Boolean)(ifTrue: F[R, E, Unit]): F[R, E, Unit]
    Definition Classes
    BIOApplicative3
    Annotations
    @inline()
  67. 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()
  68. 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()
  69. 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()
  70. 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()
  71. 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
  72. 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
  73. 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

Inherited from BIO3[F]

Inherited from BIOPanic3[F]

Inherited from BIOPanicSyntax

Inherited from BIOBracket3[F]

Inherited from BIOError3[F]

Inherited from BIOMonad3[F]

Inherited from BIOApplicativeError3[F]

Inherited from BIOBifunctor3[F]

Inherited from BIOGuarantee3[F]

Inherited from BIOApplicative3[F]

Inherited from BIOFunctor3[F]

Inherited from BIOConcurrent3[F]

Inherited from BIOParallel3[F]

Inherited from BIORootBifunctor[F]

Inherited from BIORoot

Inherited from PredefinedHelper

Inherited from DivergenceHelper

Inherited from AnyRef

Inherited from Any

Ungrouped