scalaz

MonadTell

trait MonadTell[F[_, _], W] extends Monad[[α]F[W, α]]

The class of monads supporting write operations

Source
MonadTell.scala
Linear Supertypes
Monad[[α]F[W, α]], Bind[[α]F[W, α]], Applicative[[α]F[W, α]], Apply[[α]F[W, α]], Functor[[α]F[W, α]], InvariantFunctor[[α]F[W, α]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadTell
  2. Monad
  3. Bind
  4. Applicative
  5. Apply
  6. Functor
  7. InvariantFunctor
  8. AnyRef
  9. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends ApplyLaw

    Definition Classes
    Applicative
  2. trait ApplyLaw extends FunctorLaw

    Definition Classes
    Apply
  3. trait BindLaw extends ApplyLaw

    Definition Classes
    Bind
  4. trait FunctorLaw extends InvariantFunctorLaw

    Definition Classes
    Functor
  5. trait InvariantFunctorLaw extends AnyRef

    Definition Classes
    InvariantFunctor
  6. trait MonadLaw extends ApplicativeLaw with BindLaw

    Definition Classes
    Monad

Abstract Value Members

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

    Equivalent to join(map(fa)(f)).

    Equivalent to join(map(fa)(f)).

    Definition Classes
    Bind
  2. abstract def point[A](a: ⇒ A): F[W, A]

    Definition Classes
    Applicative
  3. abstract def writer[A](w: W, v: A): F[W, A]

Concrete Value Members

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

    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  4. def ap[A, B](fa: ⇒ F[W, A])(f: ⇒ F[W, (A) ⇒ B]): F[W, B]

    Definition Classes
    BindApply
  5. def ap2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: F[W, (A, B) ⇒ C]): F[W, C]

    Definition Classes
    Apply
  6. def ap3[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C])(f: F[W, (A, B, C) ⇒ D]): F[W, D]

    Definition Classes
    Apply
  7. def ap4[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D])(f: F[W, (A, B, C, D) ⇒ E]): F[W, E]

    Definition Classes
    Apply
  8. def ap5[A, B, C, D, E, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E])(f: F[W, (A, B, C, D, E) ⇒ R]): F[W, R]

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

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

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

    Definition Classes
    Apply
  12. def apF[A, B](f: ⇒ F[W, (A) ⇒ B]): (F[W, A]) ⇒ F[W, B]

    Flipped variant of ap.

    Flipped variant of ap.

    Definition Classes
    Apply
  13. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative
  14. val applicativeSyntax: ApplicativeSyntax[[α]F[W, α]]

    Definition Classes
    Applicative
  15. def apply[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, B]

    Alias for map.

    Alias for map.

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

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

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

    Definition Classes
    Apply
  19. def apply2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: (A, B) ⇒ C): F[W, C]

    Definition Classes
    ApplicativeApply
  20. def apply3[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C])(f: (A, B, C) ⇒ D): F[W, D]

    Definition Classes
    Apply
  21. def apply4[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D])(f: (A, B, C, D) ⇒ E): F[W, E]

    Definition Classes
    Apply
  22. def apply5[A, B, C, D, E, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E])(f: (A, B, C, D, E) ⇒ R): F[W, R]

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

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

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

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

    Definition Classes
    Apply
  27. def applyApplicative: Applicative[[α]\/[F[W, α], α]]

    Add a unit to any Apply to form an Applicative.

    Add a unit to any Apply to form an Applicative.

    Definition Classes
    Apply
  28. def applyLaw: ApplyLaw

    Definition Classes
    Apply
  29. val applySyntax: ApplySyntax[[α]F[W, α]]

    Definition Classes
    Apply
  30. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  31. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[W, G[α, β]]]

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    The composition of Functor F and Bifunctor G, [x, y]F[G[x, y]], is a Bifunctor

    Definition Classes
    Functor
  32. def bindLaw: BindLaw

    Definition Classes
    Bind
  33. val bindSyntax: BindSyntax[[α]F[W, α]]

    Definition Classes
    Bind
  34. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  35. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[W, G[α]]]

    The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

    The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

    Definition Classes
    Applicative
  36. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[W, G[α]]]

    The composition of Applys F and G, [x]F[G[x]], is a Apply

    The composition of Applys F and G, [x]F[G[x]], is a Apply

    Definition Classes
    Apply
  37. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[W, G[α]]]

    The composition of Functors F and G, [x]F[G[x]], is a Functor

    The composition of Functors F and G, [x]F[G[x]], is a Functor

    Definition Classes
    Functor
  38. def counzip[A, B](a: \/[F[W, A], F[W, B]]): F[W, \/[A, B]]

    Definition Classes
    Functor
  39. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  41. def filterM[A](l: List[A])(f: (A) ⇒ F[W, Boolean]): F[W, List[A]]

    Filter l according to an applicative predicate.

    Filter l according to an applicative predicate.

    Definition Classes
    Applicative
  42. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  43. def flip: Applicative[[α]F[W, α]]

    An Applicative for F in which effects happen in the opposite order.

    An Applicative for F in which effects happen in the opposite order.

    Definition Classes
    Applicative
  44. def forever[A, B](fa: F[W, A]): F[W, B]

    Repeats a monadic action infinitely

    Repeats a monadic action infinitely

    Definition Classes
    Bind
  45. def fpair[A](fa: F[W, A]): F[W, (A, A)]

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor
  46. def fproduct[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, (A, B)]

    Pair all As in fa with the result of function application.

    Pair all As in fa with the result of function application.

    Definition Classes
    Functor
  47. def functorLaw: FunctorLaw

    Definition Classes
    Functor
  48. val functorSyntax: FunctorSyntax[[α]F[W, α]]

    Definition Classes
    Functor
  49. final def getClass(): Class[_]

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

    Definition Classes
    AnyRef → Any
  51. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[W, G[α]]]

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

    Definition Classes
    Functor
  52. def ifM[B](value: F[W, Boolean], ifTrue: ⇒ F[W, B], ifFalse: ⇒ F[W, B]): F[W, B]

    if lifted into a binding.

    if lifted into a binding. Unlike lift3((t,c,a)=>if(t)c else a), this will only include context from the chosen of ifTrue and ifFalse, not the other.

    Definition Classes
    Bind
  53. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor
  54. val invariantFunctorSyntax: InvariantFunctorSyntax[[α]F[W, α]]

    Definition Classes
    InvariantFunctor
  55. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  56. def iterateUntil[A](f: F[W, A])(p: (A) ⇒ Boolean): F[W, A]

    Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

    Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

    Definition Classes
    Monad
  57. def iterateWhile[A](f: F[W, A])(p: (A) ⇒ Boolean): F[W, A]

    Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

    Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

    Definition Classes
    Monad
  58. def join[A](ffa: F[W, F[W, A]]): F[W, A]

    Sequence the inner F of FFA after the outer F, forming a single F[A].

    Sequence the inner F of FFA after the outer F, forming a single F[A].

    Definition Classes
    Bind
  59. def lift[A, B](f: (A) ⇒ B): (F[W, A]) ⇒ F[W, B]

    Lift f into F.

    Lift f into F.

    Definition Classes
    Functor
  60. 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[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J]) ⇒ F[W, R]

    Definition Classes
    Apply
  61. 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[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J], F[W, K]) ⇒ F[W, R]

    Definition Classes
    Apply
  62. 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[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J], F[W, K], F[W, L]) ⇒ F[W, R]

    Definition Classes
    Apply
  63. def lift2[A, B, C](f: (A, B) ⇒ C): (F[W, A], F[W, B]) ⇒ F[W, C]

    Definition Classes
    Apply
  64. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[W, A], F[W, B], F[W, C]) ⇒ F[W, D]

    Definition Classes
    Apply
  65. def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[W, A], F[W, B], F[W, C], F[W, D]) ⇒ F[W, E]

    Definition Classes
    Apply
  66. def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E]) ⇒ F[W, R]

    Definition Classes
    Apply
  67. def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF]) ⇒ F[W, R]

    Definition Classes
    Apply
  68. def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G]) ⇒ F[W, R]

    Definition Classes
    Apply
  69. def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H]) ⇒ F[W, R]

    Definition Classes
    Apply
  70. def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I]) ⇒ F[W, R]

    Definition Classes
    Apply
  71. def map[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, B]

    Lift f into F and apply to F[A].

    Lift f into F and apply to F[A].

    Definition Classes
    MonadApplicativeFunctor
  72. def mapply[A, B](a: A)(f: F[W, (A) ⇒ B]): F[W, B]

    Lift apply(a), and apply the result to f.

    Lift apply(a), and apply the result to f.

    Definition Classes
    Functor
  73. def monadLaw: MonadLaw

    Definition Classes
    Monad
  74. val monadSyntax: MonadSyntax[[α]F[W, α]]

    Definition Classes
    Monad
  75. val monadTellSyntax: MonadTellSyntax[F, W]

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

    Definition Classes
    AnyRef
  77. final def notify(): Unit

    Definition Classes
    AnyRef
  78. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  79. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[W, α], G[α])]

    The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

    The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

    Definition Classes
    Applicative
  80. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[W, α], G[α])]

    The product of Applys F and G, [x](F[x], G[x]]), is a Apply

    The product of Applys F and G, [x](F[x], G[x]]), is a Apply

    Definition Classes
    Apply
  81. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[W, α], G[α])]

    The product of Functors F and G, [x](F[x], G[x]]), is a Functor

    The product of Functors F and G, [x](F[x], G[x]]), is a Functor

    Definition Classes
    Functor
  82. final def pure[A](a: ⇒ A): F[W, A]

    Definition Classes
    Applicative
  83. def replicateM[A](n: Int, fa: F[W, A]): F[W, List[A]]

    Performs the action n times, returning the list of results.

    Performs the action n times, returning the list of results.

    Definition Classes
    Applicative
  84. def replicateM_[A](n: Int, fa: F[W, A]): F[W, Unit]

    Performs the action n times, returning nothing.

    Performs the action n times, returning nothing.

    Definition Classes
    Applicative
  85. def sequence[A, G[_]](as: G[F[W, A]])(implicit arg0: Traverse[G]): F[W, G[A]]

    Definition Classes
    Applicative
  86. def sequence1[A, G[_]](as: G[F[W, A]])(implicit arg0: Traverse1[G]): F[W, G[A]]

    Definition Classes
    Apply
  87. def strengthL[A, B](a: A, f: F[W, B]): F[W, (A, B)]

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

    Definition Classes
    Functor
  88. def strengthR[A, B](f: F[W, A], b: B): F[W, (A, B)]

    Inject b to the right of As in f.

    Inject b to the right of As in f.

    Definition Classes
    Functor
  89. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  90. def tell(w: W): F[W, Unit]

  91. def toString(): String

    Definition Classes
    AnyRef → Any
  92. def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[W, B])(implicit G: Traverse[G]): F[W, G[B]]

    Definition Classes
    Applicative
  93. def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[W, B])(implicit G: Traverse1[G]): F[W, G[B]]

    Definition Classes
    Apply
  94. def tuple2[A, B](fa: ⇒ F[W, A], fb: ⇒ F[W, B]): F[W, (A, B)]

    Definition Classes
    Apply
  95. def tuple3[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C]): F[W, (A, B, C)]

    Definition Classes
    Apply
  96. def tuple4[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D]): F[W, (A, B, C, D)]

    Definition Classes
    Apply
  97. def tuple5[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E]): F[W, (A, B, C, D, E)]

    Definition Classes
    Apply
  98. def unlessM[A](cond: Boolean)(f: ⇒ F[W, A]): F[W, Unit]

    Returns the given argument if cond is false, otherwise, unit lifted into F.

    Returns the given argument if cond is false, otherwise, unit lifted into F.

    Definition Classes
    Applicative
  99. def untilM[G[_], A](f: F[W, A], cond: ⇒ F[W, Boolean])(implicit G: MonadPlus[G]): F[W, G[A]]

    Execute an action repeatedly until the Boolean condition returns true.

    Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Collects results into an arbitrary MonadPlus value, such as a List.

    Definition Classes
    Monad
  100. def untilM_[A](f: F[W, A], cond: ⇒ F[W, Boolean]): F[W, Unit]

    Execute an action repeatedly until the Boolean condition returns true.

    Execute an action repeatedly until the Boolean condition returns true. The condition is evaluated after the loop body. Discards results.

    Definition Classes
    Monad
  101. def void[A](fa: F[W, A]): F[W, Unit]

    Empty fa of meaningful pure values, preserving its structure.

    Empty fa of meaningful pure values, preserving its structure.

    Definition Classes
    Functor
  102. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  105. def whenM[A](cond: Boolean)(f: ⇒ F[W, A]): F[W, Unit]

    Returns the given argument if cond is true, otherwise, unit lifted into F.

    Returns the given argument if cond is true, otherwise, unit lifted into F.

    Definition Classes
    Applicative
  106. def whileM[G[_], A](p: F[W, Boolean], body: ⇒ F[W, A])(implicit G: MonadPlus[G]): F[W, G[A]]

    Execute an action repeatedly as long as the given Boolean expression returns true.

    Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evalated before the loop body. Collects the results into an arbitrary MonadPlus value, such as a List.

    Definition Classes
    Monad
  107. def whileM_[A](p: F[W, Boolean], body: ⇒ F[W, A]): F[W, Unit]

    Execute an action repeatedly as long as the given Boolean expression returns true.

    Execute an action repeatedly as long as the given Boolean expression returns true. The condition is evaluated before the loop body. Discards results.

    Definition Classes
    Monad
  108. def xmap[A, B](fa: F[W, A], f: (A) ⇒ B, g: (B) ⇒ A): F[W, B]

    Converts ma to a value of type F[B] using the provided functions f and g.

    Converts ma to a value of type F[B] using the provided functions f and g.

    Definition Classes
    FunctorInvariantFunctor
  109. def xmapb[A, B](ma: F[W, A])(b: BijectionT.Bijection[A, B]): F[W, B]

    Converts ma to a value of type F[B] using the provided bijection.

    Converts ma to a value of type F[B] using the provided bijection.

    Definition Classes
    InvariantFunctor
  110. def xmapi[A, B](ma: F[W, A])(iso: Isomorphism.<=>[A, B]): F[W, B]

    Converts ma to a value of type F[B] using the provided isomorphism.

    Converts ma to a value of type F[B] using the provided isomorphism.

    Definition Classes
    InvariantFunctor

Deprecated Value Members

  1. def zip: Zip[[α]F[W, α]]

    scalaz.Zip derived from tuple2.

    scalaz.Zip derived from tuple2.

    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1.0) Apply#zip produces unlawful instances

Inherited from Monad[[α]F[W, α]]

Inherited from Bind[[α]F[W, α]]

Inherited from Applicative[[α]F[W, α]]

Inherited from Apply[[α]F[W, α]]

Inherited from Functor[[α]F[W, α]]

Inherited from InvariantFunctor[[α]F[W, α]]

Inherited from AnyRef

Inherited from Any

Ungrouped