Object

com.thoughtworks.sde.source.AutoImports

UnitSourceInstance

Related Doc: package AutoImports

Permalink

implicit object UnitSourceInstance extends MonadPlus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Source
source.scala
Linear Supertypes
MonadPlus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], ApplicativePlus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], PlusEmpty[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Plus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Monad[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Bind[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Applicative[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Apply[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], Functor[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], InvariantFunctor[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnitSourceInstance
  2. MonadPlus
  3. ApplicativePlus
  4. PlusEmpty
  5. Plus
  6. Monad
  7. Bind
  8. Applicative
  9. Apply
  10. Functor
  11. InvariantFunctor
  12. AnyRef
  13. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Permalink
    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Permalink
    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Permalink
    Definition Classes
    Bind

  4. trait EmptyLaw extends scalaz.PlusEmpty.PlusLaw

    Permalink
    Definition Classes
    PlusEmpty

  5. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Permalink
    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Permalink
    Definition Classes
    InvariantFunctor

  7. trait MonadLaw extends scalaz.Monad.ApplicativeLaw with scalaz.Monad.BindLaw

    Permalink
    Definition Classes
    Monad

  8. trait MonadPlusLaw extends scalaz.MonadPlus.EmptyLaw with scalaz.MonadPlus.MonadLaw

    Permalink
    Definition Classes
    MonadPlus

  9. trait PlusLaw extends AnyRef

    Permalink
    Definition Classes
    Plus

  10. trait StrongMonadPlusLaw extends MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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 ap[A, B](fa: ⇒ Free[[β$5$](A, β$5$), Unit])(f: ⇒ Free[[β$5$]((A) ⇒ B, β$5$), Unit]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Bind → Apply

  5. def ap2[A, B, C](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit])(f: Free[[β$5$]((A, B) ⇒ C, β$5$), Unit]): Free[[β$5$](C, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  6. def ap3[A, B, C, D](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit])(f: Free[[β$5$]((A, B, C) ⇒ D, β$5$), Unit]): Free[[β$5$](D, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  7. def ap4[A, B, C, D, E](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit])(f: Free[[β$5$]((A, B, C, D) ⇒ E, β$5$), Unit]): Free[[β$5$](E, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  8. def ap5[A, B, C, D, E, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit])(f: Free[[β$5$]((A, B, C, D, E) ⇒ R, β$5$), Unit]): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  9. def ap6[A, B, C, D, E, FF, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit])(f: Free[[β$5$]((A, B, C, D, E, FF) ⇒ R, β$5$), Unit]): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  10. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit])(f: Free[[β$5$]((A, B, C, D, E, FF, G) ⇒ R, β$5$), Unit]): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  11. def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit])(f: Free[[β$5$]((A, B, C, D, E, FF, G, H) ⇒ R, β$5$), Unit]): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  12. def apF[A, B](f: ⇒ Free[[β$5$]((A) ⇒ B, β$5$), Unit]): (Free[[β$5$](A, β$5$), Unit]) ⇒ Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative

  14. val applicativePlusSyntax: ApplicativePlusSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    ApplicativePlus

  15. val applicativeSyntax: ApplicativeSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Applicative

  16. def apply[A, B](fa: Free[[β$5$](A, β$5$), Unit])(f: (A) ⇒ B): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  17. def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit], fi: ⇒ Free[[β$5$](I, β$5$), Unit], fj: ⇒ Free[[β$5$](J, β$5$), Unit])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  18. def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit], fi: ⇒ Free[[β$5$](I, β$5$), Unit], fj: ⇒ Free[[β$5$](J, β$5$), Unit], fk: ⇒ Free[[β$5$](K, β$5$), Unit])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  19. def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit], fi: ⇒ Free[[β$5$](I, β$5$), Unit], fj: ⇒ Free[[β$5$](J, β$5$), Unit], fk: ⇒ Free[[β$5$](K, β$5$), Unit], fl: ⇒ Free[[β$5$](L, β$5$), Unit])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  20. def apply2[A, B, C](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit])(f: (A, B) ⇒ C): Free[[β$5$](C, β$5$), Unit]

    Permalink
    Definition Classes
    Applicative → Apply

  21. def apply3[A, B, C, D](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit])(f: (A, B, C) ⇒ D): Free[[β$5$](D, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  22. def apply4[A, B, C, D, E](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit])(f: (A, B, C, D) ⇒ E): Free[[β$5$](E, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  23. def apply5[A, B, C, D, E, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit])(f: (A, B, C, D, E) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  24. def apply6[A, B, C, D, E, FF, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit])(f: (A, B, C, D, E, FF) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  25. def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit])(f: (A, B, C, D, E, FF, G) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  26. def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit])(f: (A, B, C, D, E, FF, G, H) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  27. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit], ff: ⇒ Free[[β$5$](FF, β$5$), Unit], fg: ⇒ Free[[β$5$](G, β$5$), Unit], fh: ⇒ Free[[β$5$](H, β$5$), Unit], fi: ⇒ Free[[β$5$](I, β$5$), Unit])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  28. def applyApplicative: Applicative[[α]\/[Free[[β$5$](α, β$5$), Unit], α]]

    Permalink
    Definition Classes
    Apply

  29. def applyLaw: ApplyLaw

    Permalink
    Definition Classes
    Apply

  30. val applySyntax: ApplySyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Apply

  31. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  32. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]Free[[β$5$](G[α, β], β$5$), Unit]]

    Permalink
    Definition Classes
    Functor

  33. def bind[A, B](fa: F[A])(f: (A) ⇒ F[B]): F[B]

    Permalink
    Definition Classes
    UnitSourceInstance → Bind

  34. def bindLaw: BindLaw

    Permalink
    Definition Classes
    Bind

  35. val bindSyntax: BindSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Bind

  36. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  37. def compose[G[_]](implicit G0: Applicative[G]): ApplicativePlus[[α]Free[[β$5$](G[α], β$5$), Unit]]

    Permalink
    Definition Classes
    ApplicativePlus → Applicative

  38. def compose[G[_]]: PlusEmpty[[α]Free[[β$5$](G[α], β$5$), Unit]]

    Permalink
    Definition Classes
    PlusEmpty → Plus

  39. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]Free[[β$5$](G[α], β$5$), Unit]]

    Permalink
    Definition Classes
    Apply

  40. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]Free[[β$5$](G[α], β$5$), Unit]]

    Permalink
    Definition Classes
    Functor

  41. def counzip[A, B](a: \/[Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit]]): Free[[β$5$](\/[A, B], β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  42. def empty[A]: F[A]

    Permalink
    Definition Classes
    UnitSourceInstance → PlusEmpty

  43. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  44. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  45. def filter[A](fa: Free[[β$5$](A, β$5$), Unit])(f: (A) ⇒ Boolean): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    MonadPlus

  46. def filterM[A](l: List[A])(f: (A) ⇒ Free[[β$5$](Boolean, β$5$), Unit]): Free[[β$5$](List[A], β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  47. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  48. def flip: Applicative[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Applicative

  49. def forever[A, B](fa: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Bind

  50. def fpair[A](fa: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$]((A, A), β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  51. def fproduct[A, B](fa: Free[[β$5$](A, β$5$), Unit])(f: (A) ⇒ B): Free[[β$5$]((A, B), β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  52. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor

  53. val functorSyntax: FunctorSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Functor

  54. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  55. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  56. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]Free[[β$5$](G[α], β$5$), Unit]]

    Permalink
    Definition Classes
    Functor

  57. def ifM[B](value: Free[[β$5$](Boolean, β$5$), Unit], ifTrue: ⇒ Free[[β$5$](B, β$5$), Unit], ifFalse: ⇒ Free[[β$5$](B, β$5$), Unit]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Bind

  58. def invariantFunctorLaw: InvariantFunctorLaw

    Permalink
    Definition Classes
    InvariantFunctor

  59. val invariantFunctorSyntax: InvariantFunctorSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    InvariantFunctor

  60. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  61. def iterateUntil[A](f: Free[[β$5$](A, β$5$), Unit])(p: (A) ⇒ Boolean): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  62. def iterateWhile[A](f: Free[[β$5$](A, β$5$), Unit])(p: (A) ⇒ Boolean): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  63. def join[A](ffa: Free[[β$5$](Free[[β$5$](A, β$5$), Unit], β$5$), Unit]): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    Bind

  64. def lift[A, B](f: (A) ⇒ B): (Free[[β$5$](A, β$5$), Unit]) ⇒ Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  65. def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit], Free[[β$5$](H, β$5$), Unit], Free[[β$5$](I, β$5$), Unit], Free[[β$5$](J, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  66. def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit], Free[[β$5$](H, β$5$), Unit], Free[[β$5$](I, β$5$), Unit], Free[[β$5$](J, β$5$), Unit], Free[[β$5$](K, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  67. def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit], Free[[β$5$](H, β$5$), Unit], Free[[β$5$](I, β$5$), Unit], Free[[β$5$](J, β$5$), Unit], Free[[β$5$](K, β$5$), Unit], Free[[β$5$](L, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  68. def lift2[A, B, C](f: (A, B) ⇒ C): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit]) ⇒ Free[[β$5$](C, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  69. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit]) ⇒ Free[[β$5$](D, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  70. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit]) ⇒ Free[[β$5$](E, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  71. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  72. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  73. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  74. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit], Free[[β$5$](H, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  75. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit], Free[[β$5$](C, β$5$), Unit], Free[[β$5$](D, β$5$), Unit], Free[[β$5$](E, β$5$), Unit], Free[[β$5$](FF, β$5$), Unit], Free[[β$5$](G, β$5$), Unit], Free[[β$5$](H, β$5$), Unit], Free[[β$5$](I, β$5$), Unit]) ⇒ Free[[β$5$](R, β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  76. def many[A](a: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](List[A], β$5$), Unit]

    Permalink
    Definition Classes
    ApplicativePlus

  77. def map[A, B](fa: Free[[β$5$](A, β$5$), Unit])(f: (A) ⇒ B): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Monad → Applicative → Functor

  78. def mapply[A, B](a: A)(f: Free[[β$5$]((A) ⇒ B, β$5$), Unit]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  79. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad

  80. def monadPlusLaw: MonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

  81. val monadPlusSyntax: MonadPlusSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    MonadPlus

  82. val monadSyntax: MonadSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Monad

  83. def monoid[A]: Monoid[Free[[β$5$](A, β$5$), Unit]]

    Permalink
    Definition Classes
    PlusEmpty

  84. def mproduct[A, B](fa: Free[[β$5$](A, β$5$), Unit])(f: (A) ⇒ Free[[β$5$](B, β$5$), Unit]): Free[[β$5$]((A, B), β$5$), Unit]

    Permalink
    Definition Classes
    Bind

  85. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  86. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  87. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  88. def plus[A](a: F[A], b: ⇒ F[A]): F[A]

    Permalink
    Definition Classes
    UnitSourceInstance → Plus

  89. def plusEmptyLaw: EmptyLaw

    Permalink
    Definition Classes
    PlusEmpty

  90. val plusEmptySyntax: PlusEmptySyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    PlusEmpty

  91. def plusLaw: PlusLaw

    Permalink
    Definition Classes
    Plus

  92. val plusSyntax: PlusSyntax[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

    Permalink
    Definition Classes
    Plus

  93. def point[A](a: ⇒ A): F[A]

    Permalink
    Definition Classes
    UnitSourceInstance → Applicative

  94. def product[G[_]](implicit G0: MonadPlus[G]): MonadPlus[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    MonadPlus

  95. def product[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    ApplicativePlus

  96. def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    PlusEmpty

  97. def product[G[_]](implicit G0: Plus[G]): Plus[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Plus

  98. def product[G[_]](implicit G0: Monad[G]): Monad[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Monad

  99. def product[G[_]](implicit G0: Bind[G]): Bind[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Bind

  100. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Applicative

  101. def product[G[_]](implicit G0: Apply[G]): Apply[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Apply

  102. def product[G[_]](implicit G0: Functor[G]): Functor[[α](Free[[β$5$](α, β$5$), Unit], G[α])]

    Permalink
    Definition Classes
    Functor

  103. final def pure[A](a: ⇒ A): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  104. def replicateM[A](n: Int, fa: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](List[A], β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  105. def replicateM_[A](n: Int, fa: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  106. def semigroup[A]: Semigroup[Free[[β$5$](A, β$5$), Unit]]

    Permalink
    Definition Classes
    Plus

  107. def separate[G[_, _], A, B](value: Free[[β$5$](G[A, B], β$5$), Unit])(implicit G: Bifoldable[G]): (Free[[β$5$](A, β$5$), Unit], Free[[β$5$](B, β$5$), Unit])

    Permalink
    Definition Classes
    MonadPlus

  108. def sequence[A, G[_]](as: G[Free[[β$5$](A, β$5$), Unit]])(implicit arg0: Traverse[G]): Free[[β$5$](G[A], β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  109. def sequence1[A, G[_]](as: G[Free[[β$5$](A, β$5$), Unit]])(implicit arg0: Traverse1[G]): Free[[β$5$](G[A], β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  110. def some[A](a: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](List[A], β$5$), Unit]

    Permalink
    Definition Classes
    ApplicativePlus

  111. def strengthL[A, B](a: A, f: Free[[β$5$](B, β$5$), Unit]): Free[[β$5$]((A, B), β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  112. def strengthR[A, B](f: Free[[β$5$](A, β$5$), Unit], b: B): Free[[β$5$]((A, B), β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  113. def strongMonadPlusLaw: StrongMonadPlusLaw

    Permalink
    Definition Classes
    MonadPlus

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

    Permalink
    Definition Classes
    AnyRef

  115. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  116. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ Free[[β$5$](B, β$5$), Unit])(implicit G: Traverse[G]): Free[[β$5$](G[B], β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  117. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ Free[[β$5$](B, β$5$), Unit])(implicit G: Traverse1[G]): Free[[β$5$](G[B], β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  118. def tuple2[A, B](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit]): Free[[β$5$]((A, B), β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  119. def tuple3[A, B, C](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit]): Free[[β$5$]((A, B, C), β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  120. def tuple4[A, B, C, D](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit]): Free[[β$5$]((A, B, C, D), β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  121. def tuple5[A, B, C, D, E](fa: ⇒ Free[[β$5$](A, β$5$), Unit], fb: ⇒ Free[[β$5$](B, β$5$), Unit], fc: ⇒ Free[[β$5$](C, β$5$), Unit], fd: ⇒ Free[[β$5$](D, β$5$), Unit], fe: ⇒ Free[[β$5$](E, β$5$), Unit]): Free[[β$5$]((A, B, C, D, E), β$5$), Unit]

    Permalink
    Definition Classes
    Apply

  122. def unite[T[_], A](value: Free[[β$5$](T[A], β$5$), Unit])(implicit T: Foldable[T]): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    MonadPlus

  123. final def uniteU[T](value: Free[[β$5$](T, β$5$), Unit])(implicit T: Unapply[Foldable, T]): Free[[β$5$](A, β$5$), Unit]

    Permalink
    Definition Classes
    MonadPlus

  124. def unlessM[A](cond: Boolean)(f: ⇒ Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  125. def untilM[G[_], A](f: Free[[β$5$](A, β$5$), Unit], cond: ⇒ Free[[β$5$](Boolean, β$5$), Unit])(implicit G: MonadPlus[G]): Free[[β$5$](G[A], β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  126. def untilM_[A](f: Free[[β$5$](A, β$5$), Unit], cond: ⇒ Free[[β$5$](Boolean, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  127. def void[A](fa: Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  128. final def wait(): Unit

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

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

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

  130. final def wait(arg0: Long): Unit

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

  131. def whenM[A](cond: Boolean)(f: ⇒ Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Applicative

  132. def whileM[G[_], A](p: Free[[β$5$](Boolean, β$5$), Unit], body: ⇒ Free[[β$5$](A, β$5$), Unit])(implicit G: MonadPlus[G]): Free[[β$5$](G[A], β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  133. def whileM_[A](p: Free[[β$5$](Boolean, β$5$), Unit], body: ⇒ Free[[β$5$](A, β$5$), Unit]): Free[[β$5$](Unit, β$5$), Unit]

    Permalink
    Definition Classes
    Monad

  134. def widen[A, B](fa: Free[[β$5$](A, β$5$), Unit])(implicit ev: <~<[A, B]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Functor

  135. def xmap[A, B](fa: Free[[β$5$](A, β$5$), Unit], f: (A) ⇒ B, g: (B) ⇒ A): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    Functor → InvariantFunctor

  136. def xmapb[A, B](ma: Free[[β$5$](A, β$5$), Unit])(b: Bijection[A, B]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    InvariantFunctor

  137. def xmapi[A, B](ma: Free[[β$5$](A, β$5$), Unit])(iso: scalaz.Isomorphism.<=>[A, B]): Free[[β$5$](B, β$5$), Unit]

    Permalink
    Definition Classes
    InvariantFunctor

Inherited from MonadPlus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from ApplicativePlus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from PlusEmpty[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Plus[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Monad[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Bind[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Applicative[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Apply[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from Functor[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from InvariantFunctor[[α$2$]Free[[β$5$](α$2$, β$5$), Unit]]

Inherited from AnyRef

Inherited from Any

Ungrouped