trait CoevalLift[F[_]] extends ~>[Coeval, F]
A lawless type class that specifies conversions from Coeval
to similar data types (i.e. pure, synchronous).
This is nothing more than a cats.arrow.FunctionK.
- Annotations
- @implicitNotFound("""Cannot find implicit value for CoevalLift[${F}].""")
- Source
- CoevalLift.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- CoevalLift
- FunctionK
- Serializable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Abstract Value Members
- abstract def apply[A](coeval: Coeval[A]): F[A]
Converts
Coeval[A]intoF[A].Converts
Coeval[A]intoF[A].The operation should preserve laziness if possible.
- Definition Classes
- CoevalLift → FunctionK
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def and[H[_]](h: FunctionK[Coeval, H]): FunctionK[Coeval, [γ$2$]Tuple2K[F, H, γ$2$]]
- Definition Classes
- FunctionK
- def andThen[H[_]](f: FunctionK[F, H]): FunctionK[Coeval, H]
- Definition Classes
- FunctionK
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- def compose[E[_]](f: FunctionK[E, Coeval]): FunctionK[E, F]
- Definition Classes
- FunctionK
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def narrow[F0[x] <: Coeval[x]]: FunctionK[F0, F]
- Definition Classes
- FunctionK
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- def or[H[_]](h: FunctionK[H, F]): FunctionK[[γ$0$]EitherK[Coeval, H, γ$0$], F]
- Definition Classes
- FunctionK
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- 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 wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def widen[G0[x] >: F[x]]: FunctionK[Coeval, G0]
- Definition Classes
- FunctionK
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.