Object

org.atnos.eff

all

Related Doc: package eff

Permalink

object all extends ReaderEffect with WriterEffect with StateEffect with EvalEffect with OptionEffect with ListEffect with DisjunctionEffect with ValidateEffect with ChooseEffect with FutureEffect with EffInterpretation with EffCreation with EffImplicits with Effects

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. all
  2. Effects
  3. EffImplicits
  4. EffCreation
  5. EffInterpretation
  6. FutureEffect
  7. FutureInterpretation
  8. FutureCreation
  9. ChooseEffect
  10. ChooseInterpretation
  11. ChooseCreation
  12. ValidateEffect
  13. ValidateInterpretation
  14. ValidateCreation
  15. DisjunctionEffect
  16. DisjunctionInterpretation
  17. DisjunctionCreation
  18. ListEffect
  19. ListInterpretation
  20. ListCreation
  21. OptionEffect
  22. OptionInterpretation
  23. OptionCreation
  24. EvalEffect
  25. EvalInterpretation
  26. EvalCreation
  27. EvalTypes
  28. StateEffect
  29. StateInterpretation
  30. StateCreation
  31. WriterEffect
  32. WriterInterpretation
  33. WriterCreation
  34. ReaderEffect
  35. ReaderInterpretation
  36. ReaderCreation
  37. AnyRef
  38. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type Eval[A] = Name[A]

    Permalink
    Definition Classes
    EvalTypes
  2. type |:[H[_], T <: Effects] = EffectsCons[H, T]

    Permalink
    Definition Classes
    Effects

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def EffApplicative[R]: Applicative[[β]Eff[R, β]]

    Permalink
    Definition Classes
    EffImplicits
  5. implicit def EffMonad[R]: Monad[[β]Eff[R, β]]

    Permalink

    Monad implementation for the Eff[R, ?] type

    Monad implementation for the Eff[R, ?] type

    Definition Classes
    EffImplicits
  6. implicit def ListFold[A]: Fold[A, List[A]]

    Permalink
    Definition Classes
    WriterInterpretation
  7. def MonoidFold[A](implicit arg0: Monoid[A]): Fold[A, A]

    Permalink
    Definition Classes
    WriterInterpretation
  8. def ap[R, A, B](a: ⇒ Eff[R, A])(f: ⇒ Eff[R, (A) ⇒ B]): Eff[R, B]

    Permalink

    apply a function to an Eff value using the applicative instance

    apply a function to an Eff value using the applicative instance

    Definition Classes
    EffCreation
  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  10. def ask[R, T](implicit member: Member[[β]Kleisli[[+X]X, T, β], R]): Eff[R, T]

    Permalink

    get the environment

    get the environment

    Definition Classes
    ReaderCreation
  11. def async[R, A](a: ⇒ A)(implicit m: Member[Future, R], ec: ExecutionContext): Eff[R, A]

    Permalink
    Definition Classes
    FutureCreation
  12. def attemptEval[R <: Effects, U <: Effects, A](r: Eff[R, A])(implicit m: Aux[Eval, R, U]): Eff[U, \/[Throwable, A]]

    Permalink
    Definition Classes
    EvalInterpretation
  13. def awaitFuture[R <: Effects, U <: Effects, A](r: Eff[R, A])(atMost: FiniteDuration)(implicit m: Aux[Future, R, U], ec: ExecutionContext): Eff[U, \/[Throwable, A]]

    Permalink
    Definition Classes
    FutureInterpretation
  14. def catchLeft[R <: Effects, E, A](r: Eff[R, A])(handle: (E) ⇒ Eff[R, A])(implicit member: Member[[β]\/[E, β], R]): Eff[R, A]

    Permalink

    catch and handle a possible left value

    catch and handle a possible left value

    Definition Classes
    DisjunctionInterpretation
  15. def chooseFrom[R, A](as: List[A])(implicit m: <=[Choose, R]): Eff[R, A]

    Permalink
    Definition Classes
    ChooseCreation
  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  17. def collapse[R, M[_], A](r: Eff[R, M[A]])(implicit m: Member[M, R]): Eff[R, A]

    Permalink

    use the internal effect as one of the stack effects

    use the internal effect as one of the stack effects

    Definition Classes
    EffCreation
  18. def correct[R, E, A](a: A)(implicit m: Member[[β]Validate[E, β], R]): Eff[R, A]

    Permalink

    create a correct value

    create a correct value

    Definition Classes
    ValidateCreation
  19. def delay[R, A](a: ⇒ A)(implicit m: Member[Eval, R]): Eff[R, A]

    Permalink
    Definition Classes
    EvalCreation
  20. def detach[M[_], A](eff: Eff[Effects.|:[M, NoEffect], A])(implicit arg0: Monad[M]): M[A]

    Permalink

    peel-off the only present effect

    peel-off the only present effect

    Definition Classes
    EffInterpretation
  21. def effInto[R <: Effects, U, A](e: Eff[R, A])(implicit f: IntoPoly[R, U, A]): Eff[U, A]

    Permalink

    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

    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

    Definition Classes
    EffInterpretation
  22. def empty[R, A](implicit m: <=[List, R]): Eff[R, A]

    Permalink

    create a list effect with no values

    create a list effect with no values

    Definition Classes
    ListCreation
  23. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  24. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  25. def evalState[R <: Effects, U <: Effects, S, A](initial: S)(w: Eff[R, A])(implicit m: Aux[[β]IndexedStateT[[+X]X, S, S, β], R, U]): Eff[U, A]

    Permalink

    run a state effect, with an initial value, return only the value

    run a state effect, with an initial value, return only the value

    Definition Classes
    StateInterpretation
  26. def evalStateZero[R <: Effects, U <: Effects, S, A](w: Eff[R, A])(implicit arg0: Monoid[S], m: Aux[[β]IndexedStateT[[+X]X, S, S, β], R, U]): Eff[U, A]

    Permalink

    run a state effect, with a Monoidal state

    run a state effect, with a Monoidal state

    Definition Classes
    StateInterpretation
  27. def execState[R <: Effects, U <: Effects, S, A](initial: S)(w: Eff[R, A])(implicit m: Aux[[β]IndexedStateT[[+X]X, S, S, β], R, U]): Eff[U, S]

    Permalink

    run a state effect, with an initial value, return only the state

    run a state effect, with an initial value, return only the state

    Definition Classes
    StateInterpretation
  28. def execStateZero[R <: Effects, U <: Effects, S, A](w: Eff[R, A])(implicit arg0: Monoid[S], m: Aux[[β]IndexedStateT[[+X]X, S, S, β], R, U]): Eff[U, S]

    Permalink

    run a state effect, with a monoidal state, return only the state

    run a state effect, with a monoidal state, return only the state

    Definition Classes
    StateInterpretation
  29. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  30. def fromDisjunction[R, E, A](disjunction: \/[E, A])(implicit member: Member[[β]\/[E, β], R]): Eff[R, A]

    Permalink

    create a Disjunction effect from a single \/ value

    create a Disjunction effect from a single \/ value

    Definition Classes
    DisjunctionCreation
  31. def fromList[R, A](as: List[A])(implicit m: <=[List, R]): Eff[R, A]

    Permalink

    create a list effect from a list of values

    create a list effect from a list of values

    Definition Classes
    ListCreation
  32. def fromOption[R, A](o: Option[A])(implicit member: Member[Option, R]): Eff[R, A]

    Permalink

    create an Option effect from a single Option value

    create an Option effect from a single Option value

    Definition Classes
    OptionCreation
  33. def get[R, S](implicit member: Member[[β]IndexedStateT[[+X]X, S, S, β], R]): Eff[R, S]

    Permalink

    get the current state value

    get the current state value

    Definition Classes
    StateCreation
  34. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  35. def gets[R, S, T](f: (S) ⇒ T)(implicit member: Member[[β]IndexedStateT[[+X]X, S, S, β], R]): Eff[R, T]

    Permalink

    get the current state value and map it with a function f

    get the current state value and map it with a function f

    Definition Classes
    StateCreation
  36. def hashCode(): Int

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

    Permalink

    create a impure value from an union of effects and a continuation

    create a impure value from an union of effects and a continuation

    Definition Classes
    EffCreation
  38. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  39. def left[R, E, A](e: E)(implicit member: Member[[β]\/[E, β], R]): Eff[R, A]

    Permalink

    create a failed value

    create a failed value

    Definition Classes
    DisjunctionCreation
  40. def lensState[TS, SS, U, T, S, A](state: Eff[TS, A], getter: (S) ⇒ T, setter: (S, T) ⇒ S)(implicit ts: Aux[[β]IndexedStateT[[+X]X, T, T, β], TS, U], ss: Aux[[β]IndexedStateT[[+X]X, S, S, β], SS, U]): Eff[SS, A]

    Permalink

    Lift a computation over a "small" state (for a subsystem) into a computation over a "bigger" state (for the full application state)

    Lift a computation over a "small" state (for a subsystem) into a computation over a "bigger" state (for the full application state)

    Definition Classes
    StateInterpretation
  41. def local[R, T, U](f: (T) ⇒ U)(implicit member: Member[[β]Kleisli[[+X]X, T, β], R]): Eff[R, U]

    Permalink

    modify the environment

    modify the environment

    Definition Classes
    ReaderCreation
  42. def localReader[SR, BR, U, S, B, A](r: Eff[SR, A], getter: (B) ⇒ S)(implicit sr: Aux[[β]Kleisli[[+X]X, S, β], SR, U], br: Aux[[β]Kleisli[[+X]X, B, β], BR, U]): Eff[BR, A]

    Permalink

    Lift a computation over a "small" reader (for a subsystem) into a computation over a "bigger" reader (for the full application)

    Lift a computation over a "small" reader (for a subsystem) into a computation over a "bigger" reader (for the full application)

    Definition Classes
    ReaderInterpretation
  43. def modify[R, S](f: (S) ⇒ S)(implicit member: Member[[β]IndexedStateT[[+X]X, S, S, β], R]): Eff[R, Unit]

    Permalink

    modify the current state value

    modify the current state value

    Definition Classes
    StateCreation
  44. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  45. def none[R, A](implicit member: Member[Option, R]): Eff[R, A]

    Permalink

    no value returned

    no value returned

    Definition Classes
    OptionCreation
  46. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  47. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  48. def now[R, A](a: A)(implicit m: Member[Eval, R]): Eff[R, A]

    Permalink
    Definition Classes
    EvalCreation
  49. def optionDisjunction[R, E, A](option: Option[A], e: E)(implicit member: Member[[β]\/[E, β], R]): Eff[R, A]

    Permalink

    create a Disjunction effect from a single Option value

    create a Disjunction effect from a single Option value

    Definition Classes
    DisjunctionCreation
  50. def plus[R, A](a1: Eff[R, A], a2: Eff[R, A])(implicit m: <=[Choose, R]): Eff[R, A]

    Permalink
    Definition Classes
    ChooseCreation
  51. def pure[R, A](a: A): Eff[R, A]

    Permalink

    create a pure value

    create a pure value

    Definition Classes
    EffCreation
  52. def put[R, S](s: S)(implicit member: Member[[β]IndexedStateT[[+X]X, S, S, β], R]): Eff[R, Unit]

    Permalink

    store a new state value

    store a new state value

    Definition Classes
    StateCreation
  53. def right[R, E, A](a: A)(implicit member: Member[[β]\/[E, β], R]): Eff[R, A]

    Permalink

    create a correct value

    create a correct value

    Definition Classes
    DisjunctionCreation
  54. def run[A](eff: Eff[NoEffect, A]): A

    Permalink

    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

    Definition Classes
    EffInterpretation
  55. def runChoose[R <: Effects, U <: Effects, A, F[_]](r: Eff[R, A])(implicit arg0: MonadPlus[F], m: Aux[Choose, R, U]): Eff[U, F[A]]

    Permalink
    Definition Classes
    ChooseInterpretation
  56. def runDisjunction[R <: Effects, U <: Effects, E, A](r: Eff[R, A])(implicit m: Aux[[β]\/[E, β], R, U]): Eff[U, \/[E, A]]

    Permalink

    run the disjunction effect, yielding E \/A

    run the disjunction effect, yielding E \/A

    Definition Classes
    DisjunctionInterpretation
  57. def runEither[R <: Effects, U <: Effects, E, A](r: Eff[R, A])(implicit m: Aux[[β]\/[E, β], R, U]): Eff[U, Either[E, A]]

    Permalink

    run the disjunction effect, yielding Either[E, A]

    run the disjunction effect, yielding Either[E, A]

    Definition Classes
    DisjunctionInterpretation
  58. def runEval[R <: Effects, U <: Effects, A](r: Eff[R, A])(implicit m: Aux[Eval, R, U]): Eff[U, A]

    Permalink
    Definition Classes
    EvalInterpretation
  59. def runList[R <: Effects, U <: Effects, A](effects: Eff[R, A])(implicit m: Aux[List, R, U]): Eff[U, List[A]]

    Permalink

    run an effect stack starting with a list effect

    run an effect stack starting with a list effect

    Definition Classes
    ListInterpretation
  60. def runMap[R <: Effects, U <: Effects, E, L, A](r: Eff[R, A])(map: (E) ⇒ L)(implicit arg0: Semigroup[L], m: Aux[[β]Validate[E, β], R, U]): Eff[U, \/[L, A]]

    Permalink

    run the validate effect, yielding a list of failures \/ A

    run the validate effect, yielding a list of failures \/ A

    Definition Classes
    ValidateInterpretation
  61. def runNel[R <: Effects, U <: Effects, E, A](r: Eff[R, A])(implicit m: Aux[[β]Validate[E, β], R, U]): Eff[U, \/[NonEmptyList[E], A]]

    Permalink

    run the validate effect, yielding a non-empty list of failures \/ A

    run the validate effect, yielding a non-empty list of failures \/ A

    Definition Classes
    ValidateInterpretation
  62. def runOption[R <: Effects, U <: Effects, A](r: Eff[R, A])(implicit m: Aux[Option, R, U]): Eff[U, Option[A]]

    Permalink

    Interpret the Option effect

    Interpret the Option effect

    Stop all computations if None is present once

    Definition Classes
    OptionInterpretation
  63. def runReader[R <: Effects, U <: Effects, A, B](env: A)(r: Eff[R, B])(implicit m: Aux[[β]Kleisli[[+X]X, A, β], R, U]): Eff[U, B]

    Permalink

    interpret the Reader effect by providing an environment when required

    interpret the Reader effect by providing an environment when required

    Definition Classes
    ReaderInterpretation
  64. def runState[R <: Effects, U <: Effects, S1, A](initial: S1)(w: Eff[R, A])(implicit m: Aux[[β]IndexedStateT[[+X]X, S1, S1, β], R, U]): Eff[U, (A, S1)]

    Permalink

    run a state effect, with an initial value

    run a state effect, with an initial value

    Definition Classes
    StateInterpretation
  65. def runStateZero[R <: Effects, U <: Effects, S, A](w: Eff[R, A])(implicit arg0: Monoid[S], m: Aux[[β]IndexedStateT[[+X]X, S, S, β], R, U]): Eff[U, (A, S)]

    Permalink

    run a state effect, with an initial value

    run a state effect, with an initial value

    Definition Classes
    StateInterpretation
  66. def runValidateNel[R <: Effects, U <: Effects, E, A](r: Eff[R, A])(implicit m: Aux[[β]Validate[E, β], R, U]): Eff[U, ValidationNel[E, A]]

    Permalink

    run the validate effect, yielding a ValidatedNel

    run the validate effect, yielding a ValidatedNel

    Definition Classes
    ValidateInterpretation
  67. def runWriter[R <: Effects, U <: Effects, O, A, B](w: Eff[R, A])(implicit m: Aux[[β]WriterT[[+X]X, O, β], R, U]): Eff[U, (A, List[O])]

    Permalink

    run a writer effect and return the list of written values

    run a writer effect and return the list of written values

    This uses a ListBuffer internally to append values

    Definition Classes
    WriterInterpretation
  68. def runWriterFold[R <: Effects, U <: Effects, O, A, B](w: Eff[R, A])(fold: Fold[O, B])(implicit m: Aux[[β]WriterT[[+X]X, O, β], R, U]): Eff[U, (A, B)]

    Permalink

    More general fold of runWriter where we can use a fold to accumulate values in a mutable buffer

    More general fold of runWriter where we can use a fold to accumulate values in a mutable buffer

    Definition Classes
    WriterInterpretation
  69. def send[T[_], R, V](tv: T[V])(implicit member: Member[T, R]): Eff[R, V]

    Permalink

    create an Eff[R, A] value from an effectful value of type T[V] provided that T is one of the effects of R

    create an Eff[R, A] value from an effectful value of type T[V] provided that T is one of the effects of R

    Definition Classes
    EffCreation
  70. def sequenceA[R, F[_], A](fs: F[Eff[R, A]])(implicit arg0: Traverse[F]): Eff[R, F[A]]

    Permalink

    use the applicative instance of Eff to sequenc a list of values

    use the applicative instance of Eff to sequenc a list of values

    Definition Classes
    EffCreation
  71. def singleton[R, A](a: A)(implicit m: <=[List, R]): Eff[R, A]

    Permalink

    create a list effect from a single value

    create a list effect from a single value

    Definition Classes
    ListCreation
  72. def some[R, A](a: A)(implicit member: Member[Option, R]): Eff[R, A]

    Permalink

    a value is returned

    a value is returned

    Definition Classes
    OptionCreation
  73. def sync[R, A](a: A)(implicit m: Member[Future, R]): Eff[R, A]

    Permalink
    Definition Classes
    FutureCreation
  74. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  75. def tell[R, O](o: O)(implicit member: Member[[β]WriterT[[+X]X, O, β], R]): Eff[R, Unit]

    Permalink

    write a given value

    write a given value

    Definition Classes
    WriterCreation
  76. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  77. def traverseA[R, F[_], A, B](fs: F[A])(f: (A) ⇒ Eff[R, B])(implicit arg0: Traverse[F]): Eff[R, F[B]]

    Permalink

    use the applicative instance of Eff to traverse a list of values

    use the applicative instance of Eff to traverse a list of values

    Definition Classes
    EffCreation
  78. def unit[R]: Eff[R, Unit]

    Permalink

    create an Eff value for ()

    create an Eff value for ()

    Definition Classes
    EffCreation
  79. def validateCheck[R, E](condition: Boolean, e: E)(implicit m: Member[[β]Validate[E, β], R]): Eff[R, Unit]

    Permalink

    check a correct condition

    check a correct condition

    Definition Classes
    ValidateCreation
  80. def validateDisjunction[R, E, A](disjunction: \/[E, A])(implicit m: Member[[β]Validate[E, β], R]): Eff[R, Unit]

    Permalink

    create an Validate effect from a single \/ value

    create an Validate effect from a single \/ value

    Definition Classes
    ValidateCreation
  81. def validateOption[R, E, A](option: Option[A], e: E)(implicit m: Member[[β]Validate[E, β], R]): Eff[R, Unit]

    Permalink

    create an Validate effect from a single Option value

    create an Validate effect from a single Option value

    Definition Classes
    ValidateCreation
  82. def validateValue[R, E, A](condition: Boolean, a: A, e: E)(implicit m: Member[[β]Validate[E, β], R]): Eff[R, A]

    Permalink

    check a correct value

    check a correct value

    Definition Classes
    ValidateCreation
  83. def values[R, A](as: A*)(implicit m: <=[List, R]): Eff[R, A]

    Permalink

    create a list effect from a list of values

    create a list effect from a list of values

    Definition Classes
    ListCreation
  84. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  87. def wrong[R, E](e: E)(implicit m: Member[[β]Validate[E, β], R]): Eff[R, Unit]

    Permalink

    create a failed value

    create a failed value

    Definition Classes
    ValidateCreation
  88. def zero[R, A](implicit m: <=[Choose, R]): Eff[R, A]

    Permalink
    Definition Classes
    ChooseCreation
  89. val |:: EffectsCons.type

    Permalink
    Definition Classes
    Effects

Inherited from Effects

Inherited from EffImplicits

Inherited from EffCreation

Inherited from EffInterpretation

Inherited from FutureEffect

Inherited from FutureInterpretation

Inherited from FutureCreation

Inherited from ChooseEffect

Inherited from ChooseInterpretation

Inherited from ChooseCreation

Inherited from ValidateEffect

Inherited from ValidateInterpretation

Inherited from ValidateCreation

Inherited from DisjunctionEffect

Inherited from DisjunctionInterpretation

Inherited from DisjunctionCreation

Inherited from ListEffect

Inherited from ListInterpretation

Inherited from ListCreation

Inherited from OptionEffect

Inherited from OptionInterpretation

Inherited from OptionCreation

Inherited from EvalEffect

Inherited from EvalInterpretation

Inherited from EvalCreation

Inherited from EvalTypes

Inherited from StateEffect

Inherited from StateInterpretation

Inherited from StateCreation

Inherited from WriterEffect

Inherited from WriterInterpretation

Inherited from WriterCreation

Inherited from ReaderEffect

Inherited from ReaderInterpretation

Inherited from ReaderCreation

Inherited from AnyRef

Inherited from Any

Ungrouped