sealed abstract class FreeApplicative[F[_], A] extends Product with Serializable
Applicative Functor for Free, implementation inspired by https://github.com/safareli/free/pull/31/
- Self Type
- FreeApplicative[F, A]
- Source
- FreeApplicative.scala
- Alphabetic
- By Inheritance
- FreeApplicative
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
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
- final def analyze[M](f: FunctionK[F, [α]M])(implicit arg0: Monoid[M]): M
Interpret this algebra into a Monoid.
- final def ap[B](b: FA[F, (A) => B]): FA[F, B]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def compile[G[_]](f: ~>[F, G]): FA[G, A]
Interpret this algebra into another algebra.
Interpret this algebra into another algebra. Stack-safe.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def flatCompile[G[_]](f: ~>[F, [β$2$]FreeApplicative[G, β$2$]]): FA[G, A]
Interpret this algebra into a FreeApplicative over another algebra.
Interpret this algebra into a FreeApplicative over another algebra. Stack-safe.
- final def fold(implicit F: Applicative[F]): F[A]
Interpret/run the operations using the semantics of
Applicative[F]
.Interpret/run the operations using the semantics of
Applicative[F]
. Stack-safe. - final def foldMap[G[_]](f: ~>[F, G])(implicit G: Applicative[G]): G[A]
Interprets/Runs the sequence of operations using the semantics of
Applicative
G[_].Interprets/Runs the sequence of operations using the semantics of
Applicative
G[_]. Tail recursive. - final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def map[B](f: (A) => B): FA[F, B]
- final def map2[B, C](fb: FA[F, B])(f: (A, B) => C): FA[F, C]
- final def monad: Free[F, A]
Compile this FreeApplicative algebra into a Free algebra.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def productElementName(n: Int): String
- Definition Classes
- Product
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def productIterator: Iterator[Any]
- Definition Classes
- Product
- def productPrefix: String
- Definition Classes
- Product
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- FreeApplicative → AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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()