logic

MonadLogic

trait MonadLogic[F[_]] extends MonadPlus[F]

Linear Supertypes
MonadPlus[F], ApplicativePlus[F], PlusEmpty[F], Plus[F], Monad[F], Bind[F], Applicative[F], Apply[F], Functor[F], InvariantFunctor[F], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadLogic
  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

Abstract Value Members

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

    Definition Classes
    Bind

  2. abstract def empty[A]: F[A]

    Definition Classes
    PlusEmpty

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

    Definition Classes
    Plus

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

    Definition Classes
    Applicative

  5. abstract def split[A](m: F[A]): F[Option[(A, F[A])]]

Concrete 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 >>-[A, B](m: F[A])(f: (A) ⇒ F[B]): F[B]

  7. def ap[A, B](fa: ⇒ F[A])(f: ⇒ F[(A) ⇒ B]): F[B]

    Definition Classes
    Bind → Apply

  8. def ap2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: F[(A, B) ⇒ C]): F[C]

    Definition Classes
    Apply

  9. def ap3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: F[(A, B, C) ⇒ D]): F[D]

    Definition Classes
    Apply

  10. def ap4[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: F[(A, B, C, D) ⇒ E]): F[E]

    Definition Classes
    Apply

  11. def ap5[A, B, C, D, E, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: F[(A, B, C, D, E) ⇒ R]): F[R]

    Definition Classes
    Apply

  12. def ap6[A, B, C, D, E, FF, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF])(f: F[(A, B, C, D, E, FF) ⇒ R]): F[R]

    Definition Classes
    Apply

  13. def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G])(f: F[(A, B, C, D, E, FF, G) ⇒ R]): F[R]

    Definition Classes
    Apply

  14. def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H])(f: F[(A, B, C, D, E, FF, G, H) ⇒ R]): F[R]

    Definition Classes
    Apply

  15. def apF[A, B](f: ⇒ F[(A) ⇒ B]): (F[A]) ⇒ F[B]

    Definition Classes
    Apply

  16. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative

  17. val applicativePlusSyntax: ApplicativePlusSyntax[F]

    Definition Classes
    ApplicativePlus

  18. val applicativeSyntax: ApplicativeSyntax[F]

    Definition Classes
    Applicative

  19. def apply[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Definition Classes
    Functor

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  23. def apply2[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C): F[C]

    Definition Classes
    Applicative → Apply

  24. def apply3[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: (A, B, C) ⇒ D): F[D]

    Definition Classes
    Apply

  25. def apply4[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: (A, B, C, D) ⇒ E): F[E]

    Definition Classes
    Apply

  26. def apply5[A, B, C, D, E, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: (A, B, C, D, E) ⇒ R): F[R]

    Definition Classes
    Apply

  27. def apply6[A, B, C, D, E, FF, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF])(f: (A, B, C, D, E, FF) ⇒ R): F[R]

    Definition Classes
    Apply

  28. def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G])(f: (A, B, C, D, E, FF, G) ⇒ R): F[R]

    Definition Classes
    Apply

  29. def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): F[R]

    Definition Classes
    Apply

  30. def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], ff: ⇒ F[FF], fg: ⇒ F[G], fh: ⇒ F[H], fi: ⇒ F[I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): F[R]

    Definition Classes
    Apply

  31. def applyApplicative: Applicative[[α]\/[F[α], α]]

    Definition Classes
    Apply

  32. def applyLaw: ApplyLaw

    Definition Classes
    Apply

  33. val applySyntax: ApplySyntax[F]

    Definition Classes
    Apply

  34. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  35. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β]]]

    Definition Classes
    Functor

  36. def bindLaw: BindLaw

    Definition Classes
    Bind

  37. val bindSyntax: BindSyntax[F]

    Definition Classes
    Bind

  38. def clone(): AnyRef

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

  39. def compose[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α]F[G[α]]]

    Definition Classes
    ApplicativePlus

  40. def compose[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α]F[G[α]]]

    Definition Classes
    PlusEmpty

  41. def compose[G[_]](implicit G0: Plus[G]): Plus[[α]F[G[α]]]

    Definition Classes
    Plus

  42. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[G[α]]]

    Definition Classes
    Applicative

  43. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[G[α]]]

    Definition Classes
    Apply

  44. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[G[α]]]

    Definition Classes
    Functor

  45. def counzip[A, B](a: \/[F[A], F[B]]): F[\/[A, B]]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef

  47. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  48. def filter[A](fa: F[A])(f: (A) ⇒ Boolean): F[A]

    Definition Classes
    MonadPlus

  49. def filterM[A](l: List[A])(f: (A) ⇒ F[Boolean]): F[List[A]]

    Definition Classes
    Applicative

  50. def finalize(): Unit

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

  51. def flip: Applicative[F]

    Definition Classes
    Applicative

  52. def forever[A, B](fa: F[A]): F[B]

    Definition Classes
    Bind

  53. def fpair[A](fa: F[A]): F[(A, A)]

    Definition Classes
    Functor

  54. def fproduct[A, B](fa: F[A])(f: (A) ⇒ B): F[(A, B)]

    Definition Classes
    Functor

  55. def functorLaw: FunctorLaw

    Definition Classes
    Functor

  56. val functorSyntax: FunctorSyntax[F]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef → Any

  58. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  59. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[G[α]]]

    Definition Classes
    Functor

  60. def ifM[B](value: F[Boolean], ifTrue: ⇒ F[B], ifFalse: ⇒ F[B]): F[B]

    Definition Classes
    Bind

  61. def ifte[A, B](t: F[A], el: F[B])(th: (A) ⇒ F[B]): F[B]

  62. def interleave[A](m1: F[A], m2: F[A]): F[A]

  63. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor

  64. val invariantFunctorSyntax: InvariantFunctorSyntax[F]

    Definition Classes
    InvariantFunctor

  65. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  66. def iterateUntil[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Definition Classes
    Monad

  67. def iterateWhile[A](f: F[A])(p: (A) ⇒ Boolean): F[A]

    Definition Classes
    Monad

  68. def join[A](ffa: F[F[A]]): F[A]

    Definition Classes
    Bind

  69. def lift[A, B](f: (A) ⇒ B): (F[A]) ⇒ F[B]

    Definition Classes
    Functor

  70. 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): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J]) ⇒ F[R]

    Definition Classes
    Apply

  71. 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): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J], F[K]) ⇒ F[R]

    Definition Classes
    Apply

  72. 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): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I], F[J], F[K], F[L]) ⇒ F[R]

    Definition Classes
    Apply

  73. def lift2[A, B, C](f: (A, B) ⇒ C): (F[A], F[B]) ⇒ F[C]

    Definition Classes
    Apply

  74. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[A], F[B], F[C]) ⇒ F[D]

    Definition Classes
    Apply

  75. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[A], F[B], F[C], F[D]) ⇒ F[E]

    Definition Classes
    Apply

  76. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (F[A], F[B], F[C], F[D], F[E]) ⇒ F[R]

    Definition Classes
    Apply

  77. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF]) ⇒ F[R]

    Definition Classes
    Apply

  78. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G]) ⇒ F[R]

    Definition Classes
    Apply

  79. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H]) ⇒ F[R]

    Definition Classes
    Apply

  80. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (F[A], F[B], F[C], F[D], F[E], F[FF], F[G], F[H], F[I]) ⇒ F[R]

    Definition Classes
    Apply

  81. def many[A](a: F[A]): F[List[A]]

    Definition Classes
    ApplicativePlus

  82. def map[A, B](fa: F[A])(f: (A) ⇒ B): F[B]

    Definition Classes
    Monad → Applicative → Functor

  83. def mapply[A, B](a: A)(f: F[(A) ⇒ B]): F[B]

    Definition Classes
    Functor

  84. def monadLaw: MonadLaw

    Definition Classes
    Monad

  85. def monadPlusLaw: MonadPlusLaw

    Definition Classes
    MonadPlus

  86. val monadPlusSyntax: MonadPlusSyntax[F]

    Definition Classes
    MonadPlus

  87. val monadSyntax: MonadSyntax[F]

    Definition Classes
    Monad

  88. def monoid[A]: Monoid[F[A]]

    Definition Classes
    PlusEmpty

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

    Definition Classes
    AnyRef

  90. final def notify(): Unit

    Definition Classes
    AnyRef

  91. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  92. def once[A](m: F[A]): F[A]

  93. def plusEmptyLaw: EmptyLaw

    Definition Classes
    PlusEmpty

  94. val plusEmptySyntax: PlusEmptySyntax[F]

    Definition Classes
    PlusEmpty

  95. def plusLaw: PlusLaw

    Definition Classes
    Plus

  96. val plusSyntax: PlusSyntax[F]

    Definition Classes
    Plus

  97. def product[G[_]](implicit G0: ApplicativePlus[G]): ApplicativePlus[[α](F[α], G[α])]

    Definition Classes
    ApplicativePlus

  98. def product[G[_]](implicit G0: PlusEmpty[G]): PlusEmpty[[α](F[α], G[α])]

    Definition Classes
    PlusEmpty

  99. def product[G[_]](implicit G0: Plus[G]): Plus[[α](F[α], G[α])]

    Definition Classes
    Plus

  100. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[α], G[α])]

    Definition Classes
    Applicative

  101. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[α], G[α])]

    Definition Classes
    Apply

  102. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[α], G[α])]

    Definition Classes
    Functor

  103. final def pure[A](a: ⇒ A): F[A]

    Definition Classes
    Applicative

  104. def replicateM[A](n: Int, fa: F[A]): F[List[A]]

    Definition Classes
    Applicative

  105. def replicateM_[A](n: Int, fa: F[A]): F[Unit]

    Definition Classes
    Applicative

  106. def semigroup[A]: Semigroup[F[A]]

    Definition Classes
    Plus

  107. def separate[G[_, _], A, B](value: F[G[A, B]])(implicit G: Bifoldable[G]): (F[A], F[B])

    Definition Classes
    MonadPlus

  108. def sequence[A, G[_]](as: G[F[A]])(implicit arg0: Traverse[G]): F[G[A]]

    Definition Classes
    Applicative

  109. def sequence1[A, G[_]](as: G[F[A]])(implicit arg0: Traverse1[G]): F[G[A]]

    Definition Classes
    Apply

  110. def some[A](a: F[A]): F[List[A]]

    Definition Classes
    ApplicativePlus

  111. def strengthL[A, B](a: A, f: F[B]): F[(A, B)]

    Definition Classes
    Functor

  112. def strengthR[A, B](f: F[A], b: B): F[(A, B)]

    Definition Classes
    Functor

  113. def strongMonadPlusLaw: StrongMonadPlusLaw

    Definition Classes
    MonadPlus

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

    Definition Classes
    AnyRef

  115. def toString(): String

    Definition Classes
    AnyRef → Any

  116. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse[G]): F[G[B]]

    Definition Classes
    Applicative

  117. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[B])(implicit G: Traverse1[G]): F[G[B]]

    Definition Classes
    Apply

  118. def tuple2[A, B](fa: ⇒ F[A], fb: ⇒ F[B]): F[(A, B)]

    Definition Classes
    Apply

  119. def tuple3[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C]): F[(A, B, C)]

    Definition Classes
    Apply

  120. def tuple4[A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D]): F[(A, B, C, D)]

    Definition Classes
    Apply

  121. def tuple5[A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E]): F[(A, B, C, D, E)]

    Definition Classes
    Apply

  122. def unite[T[_], A](value: F[T[A]])(implicit T: Foldable[T]): F[A]

    Definition Classes
    MonadPlus

  123. final def uniteU[T](value: F[T])(implicit T: Unapply[Foldable, T]): F[A]

    Definition Classes
    MonadPlus

  124. def unlessM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Definition Classes
    Applicative

  125. def untilM[G[_], A](f: F[A], cond: ⇒ F[Boolean])(implicit G: MonadPlus[G]): F[G[A]]

    Definition Classes
    Monad

  126. def untilM_[A](f: F[A], cond: ⇒ F[Boolean]): F[Unit]

    Definition Classes
    Monad

  127. def void[A](fa: F[A]): F[Unit]

    Definition Classes
    Functor

  128. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  131. def whenM[A](cond: Boolean)(f: ⇒ F[A]): F[Unit]

    Definition Classes
    Applicative

  132. def whileM[G[_], A](p: F[Boolean], body: ⇒ F[A])(implicit G: MonadPlus[G]): F[G[A]]

    Definition Classes
    Monad

  133. def whileM_[A](p: F[Boolean], body: ⇒ F[A]): F[Unit]

    Definition Classes
    Monad

  134. def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

    Definition Classes
    Functor → InvariantFunctor

  135. def xmapb[A, B](ma: F[A])(b: scalaz.BijectionT.Bijection[A, B]): F[B]

    Definition Classes
    InvariantFunctor

  136. def xmapi[A, B](ma: F[A])(iso: scalaz.Isomorphism.<=>[A, B]): F[B]

    Definition Classes
    InvariantFunctor

Deprecated Value Members

  1. def zip: Zip[F]

    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1.0) Apply#zip produces unlawful instances

Inherited from MonadPlus[F]

Inherited from ApplicativePlus[F]

Inherited from PlusEmpty[F]

Inherited from Plus[F]

Inherited from Monad[F]

Inherited from Bind[F]

Inherited from Applicative[F]

Inherited from Apply[F]

Inherited from Functor[F]

Inherited from InvariantFunctor[F]

Inherited from AnyRef

Inherited from Any

Ungrouped