com.thoughtworks.sde.source.AutoImports

UnitSourceInstance

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

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
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends scalaz.Applicative.ApplyLaw

    Definition Classes
    Applicative

  2. trait ApplyLaw extends scalaz.Apply.FunctorLaw

    Definition Classes
    Apply

  3. trait BindLaw extends scalaz.Bind.ApplyLaw

    Definition Classes
    Bind

  4. trait EmptyLaw extends scalaz.PlusEmpty.PlusLaw

    Definition Classes
    PlusEmpty

  5. trait FunctorLaw extends scalaz.Functor.InvariantFunctorLaw

    Definition Classes
    Functor

  6. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor

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

    Definition Classes
    Monad

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

    Definition Classes
    MonadPlus

  9. trait PlusLaw extends AnyRef

    Definition Classes
    Plus

  10. trait StrongMonadPlusLaw extends MonadPlusLaw

    Definition Classes
    MonadPlus

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

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

    Definition Classes
    Bind → Apply

  7. 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]

    Definition Classes
    Apply

  8. 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]

    Definition Classes
    Apply

  9. 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]

    Definition Classes
    Apply

  10. 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]

    Definition Classes
    Apply

  11. 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]

    Definition Classes
    Apply

  12. 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]

    Definition Classes
    Apply

  13. 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]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  15. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative

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

    Definition Classes
    ApplicativePlus

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

    Definition Classes
    Applicative

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

    Definition Classes
    Functor

  19. 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]

    Definition Classes
    Apply

  20. 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]

    Definition Classes
    Apply

  21. 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]

    Definition Classes
    Apply

  22. 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]

    Definition Classes
    Applicative → Apply

  23. 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]

    Definition Classes
    Apply

  24. 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]

    Definition Classes
    Apply

  25. 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]

    Definition Classes
    Apply

  26. 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]

    Definition Classes
    Apply

  27. 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]

    Definition Classes
    Apply

  28. 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]

    Definition Classes
    Apply

  29. 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]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  31. def applyLaw: ApplyLaw

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  33. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

    Definition Classes
    Functor

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

    Definition Classes
    UnitSourceInstance → Bind

  36. def bindLaw: BindLaw

    Definition Classes
    Bind

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

    Definition Classes
    Bind

  38. def clone(): AnyRef

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

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

    Definition Classes
    ApplicativePlus → Applicative

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

    Definition Classes
    PlusEmpty → Plus

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

    Definition Classes
    Apply

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

    Definition Classes
    Functor

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

    Definition Classes
    Functor

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

    Definition Classes
    UnitSourceInstance → PlusEmpty

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

    Definition Classes
    AnyRef

  46. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    MonadPlus

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

    Definition Classes
    Applicative

  49. def finalize(): Unit

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

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

    Definition Classes
    Applicative

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

    Definition Classes
    Bind

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

    Definition Classes
    Functor

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

    Definition Classes
    Functor

  54. def functorLaw: FunctorLaw

    Definition Classes
    Functor

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

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef → Any

  57. def hashCode(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    Functor

  59. 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]

    Definition Classes
    Bind

  60. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor

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

    Definition Classes
    InvariantFunctor

  62. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    Monad

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

    Definition Classes
    Monad

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

    Definition Classes
    Bind

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

    Definition Classes
    Functor

  67. 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]

    Definition Classes
    Apply

  68. 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]

    Definition Classes
    Apply

  69. 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]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  71. 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]

    Definition Classes
    Apply

  72. 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]

    Definition Classes
    Apply

  73. 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]

    Definition Classes
    Apply

  74. 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]

    Definition Classes
    Apply

  75. 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]

    Definition Classes
    Apply

  76. 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]

    Definition Classes
    Apply

  77. 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]

    Definition Classes
    Apply

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

    Definition Classes
    ApplicativePlus

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

    Definition Classes
    Monad → Applicative → Functor

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

    Definition Classes
    Functor

  81. def monadLaw: MonadLaw

    Definition Classes
    Monad

  82. def monadPlusLaw: MonadPlusLaw

    Definition Classes
    MonadPlus

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

    Definition Classes
    MonadPlus

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

    Definition Classes
    Monad

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

    Definition Classes
    PlusEmpty

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

    Definition Classes
    Bind

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

    Definition Classes
    AnyRef

  88. final def notify(): Unit

    Definition Classes
    AnyRef

  89. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    UnitSourceInstance → Plus

  91. def plusEmptyLaw: EmptyLaw

    Definition Classes
    PlusEmpty

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

    Definition Classes
    PlusEmpty

  93. def plusLaw: PlusLaw

    Definition Classes
    Plus

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

    Definition Classes
    Plus

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

    Definition Classes
    UnitSourceInstance → Applicative

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

    Definition Classes
    MonadPlus

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

    Definition Classes
    ApplicativePlus

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

    Definition Classes
    PlusEmpty

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

    Definition Classes
    Plus

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

    Definition Classes
    Monad

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

    Definition Classes
    Bind

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

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

    Definition Classes
    Functor

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

    Definition Classes
    Applicative

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

    Definition Classes
    Applicative

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

    Definition Classes
    Applicative

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

    Definition Classes
    Plus

  109. 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])

    Definition Classes
    MonadPlus

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

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

    Definition Classes
    ApplicativePlus

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

    Definition Classes
    Functor

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

    Definition Classes
    Functor

  115. def strongMonadPlusLaw: StrongMonadPlusLaw

    Definition Classes
    MonadPlus

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

    Definition Classes
    AnyRef

  117. def toString(): String

    Definition Classes
    AnyRef → Any

  118. 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]

    Definition Classes
    Applicative

  119. 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]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  121. 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]

    Definition Classes
    Apply

  122. 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]

    Definition Classes
    Apply

  123. 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]

    Definition Classes
    Apply

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

    Definition Classes
    MonadPlus

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

    Definition Classes
    MonadPlus

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

    Definition Classes
    Applicative

  127. 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]

    Definition Classes
    Monad

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

    Definition Classes
    Monad

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

    Definition Classes
    Functor

  130. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    Applicative

  134. 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]

    Definition Classes
    Monad

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

    Definition Classes
    Monad

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

    Definition Classes
    Functor

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

    Definition Classes
    Functor → InvariantFunctor

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

    Definition Classes
    InvariantFunctor

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

    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