Eff

Type Members

implicit class EffOps[R <: Effects, A] extends AnyRef
trait IntoPoly[R <: Effects, U, A] extends AnyRef

Trait for polymorphic recursion into Eff[?, A]
Trait for polymorphic recursion into Eff[?, A]
The idea is to deal with one effect at the time:
- if the effect stack is M |: R and if U contains M we transform each "Union[R, X]" in the Impure case into a Union for U and we try to recurse on other effects present in R
- if the effect stack is M |: NoEffect and if U contains M we just "inject" the M[X] effect into Eff[U, A] using the Member typeclass if M is not present when we decompose we throw an exception. This case should never happen because if there is no other effect in the stack there should be at least something producing a value of type A
trait Mapper[M[_]] extends AnyRef

Operations of Eff[R, A] values
trait Runner[M[_], R, A] extends AnyRef

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
implicit def EffMonad[R]: Monad[[β]Eff[R, β]]

Monad implementation for the Eff[R, ?] type
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def effInto[R <: Effects, U, A](e: Eff[R, A])(implicit f: IntoPoly[R, U, A]): Eff[U, A]

An Eff[R, A] value can be transformed into an Eff[U, A] value provided that all the effects in R are also in U
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def impure[R, X, A](union: Union[R, X], continuation: Arrs[R, X, A]): Eff[R, A]

create a impure value from an union of effects and a continuation
implicit def intoEff[M[_], R <: Effects, U, A](implicit m: Member[M, |:[M, R]], mu: Member[M, U], recurse: IntoPoly[R, U, A]): IntoPoly[|:[M, R], U, A]
implicit def intoNoEff[M[_], U, A](implicit m: Member[M, |:[M, NoEffect]], mu: Member[M, U]): IntoPoly[|:[M, NoEffect], U, A]
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pure[R, A](a: A): Eff[R, A]

create a pure value
def run[A](eff: Eff[NoEffect, A]): A

base runner for an Eff value having no effects at all
base runner for an Eff value having no effects at all
This runner can only return the value in Pure because it doesn't known how to interpret the effects in Impure
def send[T[_], R, V](tv: T[V])(implicit member: Member[T, R]): Eff[R, V]

create an Eff[R, A] value from an effectful value of type T[V] provided that T is one of the effects of R
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def unit[R]: Eff[R, Unit]

create an Eff value for ()
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Docs: trait Eff | package eff

object Eff

Type Members

implicit class EffOps[R <: Effects, A] extends AnyRef

trait IntoPoly[R <: Effects, U, A] extends AnyRef

trait Mapper[M[_]] extends AnyRef

trait Runner[M[_], R, A] extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

implicit def EffMonad[R]: Monad[[β]Eff[R, β]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def effInto[R <: Effects, U, A](e: Eff[R, A])(implicit f: IntoPoly[R, U, A]): Eff[U, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def impure[R, X, A](union: Union[R, X], continuation: Arrs[R, X, A]): Eff[R, A]

implicit def intoEff[M[_], R <: Effects, U, A](implicit m: Member[M, |:[M, R]], mu: Member[M, U], recurse: IntoPoly[R, U, A]): IntoPoly[|:[M, R], U, A]

implicit def intoNoEff[M[_], U, A](implicit m: Member[M, |:[M, NoEffect]], mu: Member[M, U]): IntoPoly[|:[M, NoEffect], U, A]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pure[R, A](a: A): Eff[R, A]

def run[A](eff: Eff[NoEffect, A]): A

def send[T[_], R, V](tv: T[V])(implicit member: Member[T, R]): Eff[R, V]

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

def toString(): String

def unit[R]: Eff[R, Unit]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped