Class

quasar.fp.free

SpecializedInterpreter

Related Doc: package free

Permalink

class SpecializedInterpreter[F[_], M[_]] extends Interpreter[F, M]

Extends Interpreter to provide a version with better type inference for commonly used MonadTrans

F

The type of the Functor that represents the algebra to be interpreted

M

The Monad into which to translate the Free Algebra

Linear Supertypes
Interpreter[F, M], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SpecializedInterpreter
  2. Interpreter
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SpecializedInterpreter(interpretTerm: ~>[F, M])(implicit arg0: Monad[M])

    Permalink

    interpretTerm

    A natural transformation from the Algebra into the desired Monad from which many other natural transformations can be derived

Type Members

  1. type Program[A] = Free[F, A]

    Permalink
    Definition Classes
    Interpreter

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. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  11. def interpret: ~>[Program, M]

    Permalink
    Definition Classes
    Interpreter
  12. def interpretT[T[_[_], _]](implicit arg0: Hoist[T]): ~>[[β$0$]T[[A]Free[F, A], β$0$], [β$1$]T[M, β$1$]]

    Permalink
    Definition Classes
    Interpreter
  13. def interpretT2[T1[_[_], _], T2[_[_], _]](implicit arg0: Hoist[T1], arg1: Hoist[T2]): ~>[[β$4$]T1[[β$2$]T2[[A]Free[F, A], β$2$], β$4$], [β$5$]T1[[β$3$]T2[M, β$3$], β$5$]]

    Permalink
    Definition Classes
    Interpreter
  14. def interpretT3[T1[_[_], _], T2[_[_], _], T3[_[_], _]](implicit arg0: Hoist[T1], arg1: Hoist[T2], arg2: Hoist[T3]): ~>[[β$12$]T1[[β$13$]T2[[β$9$]T3[[A]Free[F, A], β$9$], β$13$], β$12$], [β$14$]T1[[β$15$]T2[[β$11$]T3[M, β$11$], β$15$], β$14$]]

    Permalink
    Definition Classes
    Interpreter
  15. val interpretTerm: ~>[F, M]

    Permalink

    A natural transformation from the Algebra into the desired Monad from which many other natural transformations can be derived

    A natural transformation from the Algebra into the desired Monad from which many other natural transformations can be derived

    Definition Classes
    Interpreter
  16. final def isInstanceOf[T0]: Boolean

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

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

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

    Permalink
    Definition Classes
    AnyRef
  20. def runLog[A](p: Process[Program, A])(implicit catchable: Catchable[M]): M[slamdata.Predef.Vector[A]]

    Permalink
    Definition Classes
    Interpreter
  21. def runLogE[E, A](p: Process[[γ$46$]EitherT[[A]Free[F, A], E, γ$46$], A])(implicit catchable: Catchable[M]): EitherT[M, E, slamdata.Predef.Vector[A]]

    Permalink
  22. def runLogT[T[_[_], _], A](p: Process[[β$21$]T[[A]Free[F, A], β$21$], A])(implicit arg0: Hoist[T], catchable: Catchable[[β$22$]T[M, β$22$]]): T[M, slamdata.Predef.Vector[A]]

    Permalink
    Definition Classes
    Interpreter
  23. def runLogT2[T1[_[_], _], T2[_[_], _], A](p: Process[[β$25$]T1[[β$24$]T2[[A]Free[F, A], β$24$], β$25$], A])(implicit arg0: Hoist[T1], arg1: Hoist[T2], catchable: Catchable[[β$27$]T1[[β$26$]T2[M, β$26$], β$27$]]): T1[[β$28$]T2[M, β$28$], slamdata.Predef.Vector[A]]

    Permalink
    Definition Classes
    Interpreter
  24. def runLogT3[T1[_[_], _], T2[_[_], _], T3[_[_], _], A](p: Process[[β$33$]T1[[β$34$]T2[[β$32$]T3[[A]Free[F, A], β$32$], β$34$], β$33$], A])(implicit arg0: Hoist[T1], arg1: Hoist[T2], arg2: Hoist[T3], catchable: Catchable[[β$37$]T1[[β$38$]T2[[β$36$]T3[M, β$36$], β$38$], β$37$]]): T1[[β$40$]T2[[β$39$]T3[M, β$39$], β$40$], slamdata.Predef.Vector[A]]

    Permalink
    Definition Classes
    Interpreter
  25. def runLogWE[E, L, A](p: Process[[γ$48$]EitherT[[γ$47$]WriterT[[A]Free[F, A], L, γ$47$], E, γ$48$], A])(implicit arg0: Monoid[L], catchable: Catchable[M]): EitherT[[γ$49$]WriterT[M, L, γ$49$], E, slamdata.Predef.Vector[A]]

    Permalink
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  27. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  28. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Interpreter[F, M]

Inherited from AnyRef

Inherited from Any

Ungrouped