trait CoevalLift[F[_]] extends ~>[Coeval, F]
Abstract Value Members
- abstract def apply[A](coeval: Coeval[A]): F[A]
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- final def ==(arg0: Any): Boolean
- def and[H[_]](h: FunctionK[Coeval, H]): FunctionK[Coeval, [γ$4$]Tuple2K[F, H, γ$4$]]
- def andThen[H[_]](f: FunctionK[F, H]): FunctionK[Coeval, H]
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def compose[E[_]](f: FunctionK[E, Coeval]): FunctionK[E, F]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def or[H[_]](h: FunctionK[H, F]): FunctionK[[γ$1$]EitherK[Coeval, H, γ$1$], F]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
Deprecated Value Members
- def finalize(): Unit
Value Members
- def and[H[_]](h: FunctionK[Coeval, H]): FunctionK[Coeval, [γ$4$]Tuple2K[F, H, γ$4$]]
- def andThen[H[_]](f: FunctionK[F, H]): FunctionK[Coeval, H]
- def compose[E[_]](f: FunctionK[E, Coeval]): FunctionK[E, F]
- def or[H[_]](h: FunctionK[H, F]): FunctionK[[γ$1$]EitherK[Coeval, H, γ$1$], F]
Inherited from Any
Value Members
- final def asInstanceOf[T0]: T0
- final def isInstanceOf[T0]: Boolean
Ungrouped
- abstract def apply[A](coeval: Coeval[A]): F[A]
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- final def ==(arg0: Any): Boolean
- def and[H[_]](h: FunctionK[Coeval, H]): FunctionK[Coeval, [γ$4$]Tuple2K[F, H, γ$4$]]
- def andThen[H[_]](f: FunctionK[F, H]): FunctionK[Coeval, H]
- final def asInstanceOf[T0]: T0
- def clone(): AnyRef
- def compose[E[_]](f: FunctionK[E, Coeval]): FunctionK[E, F]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def or[H[_]](h: FunctionK[H, F]): FunctionK[[γ$1$]EitherK[Coeval, H, γ$1$], F]
- final def synchronized[T0](arg0: => T0): T0
- def toString(): String
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- final def wait(): Unit
- def finalize(): Unit
This is the API documentation for the Monix library.
Package Overview
monix.execution exposes lower level primitives for dealing with asynchronous execution:
Atomictypes, as alternative tojava.util.concurrent.atomicmonix.catnap exposes pure abstractions built on top of the Cats-Effect type classes:
monix.eval is for dealing with evaluation of results, thus exposing Task and Coeval.
monix.reactive exposes the
Observablepattern:Observableimplementationsmonix.tail exposes Iterant for purely functional pull based streaming:
BatchandBatchCursor, the alternatives to Scala'sIterableandIteratorrespectively that we are using within Iterant's encodingYou can control evaluation with type you choose - be it Task, Coeval, cats.effect.IO or your own as long as you provide correct cats-effect or cats typeclass instance.