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, α]], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadTell
  2. Monad
  3. Bind
  4. Applicative
  5. Apply
  6. Functor
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends FunctorLaw

    Definition Classes
    Applicative
  2. trait FunctorLaw extends AnyRef

    Definition Classes
    Functor
  3. trait MonadLaw extends ApplicativeLaw

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

    Definition Classes
    BindApply
  7. 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
  8. 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
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. 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
  15. def applicativeLaw: ApplicativeLaw

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

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

    Alias for map.

    Alias for map.

    Definition Classes
    Functor
  18. 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
  19. 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
  20. 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
  21. def apply2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: (A, B) ⇒ C): F[W, C]

    Definition Classes
    ApplicativeApply
  22. 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
  23. 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
  24. 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
  25. 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
  26. 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
  27. 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
  28. 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
  29. val applySyntax: ApplySyntax[[+α]F[W, α]]

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

    Definition Classes
    Any
  31. val bindSyntax: BindSyntax[[+α]F[W, α]]

    Definition Classes
    Bind
  32. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. 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
  34. 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
  35. 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
  36. def counzip[A, B](a: \/[F[W, A], F[W, B]]): F[W, \/[A, B]]

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

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

    Definition Classes
    AnyRef → Any
  39. 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
  40. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  41. 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
  42. def fpair[A](fa: F[W, A]): F[W, (A, A)]

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor
  43. 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
  44. def functorLaw: FunctorLaw

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

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

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

    Definition Classes
    AnyRef → Any
  48. 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
  49. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  50. 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
  51. def lift[A, B](f: (A) ⇒ B): (F[W, A]) ⇒ F[W, B]

    Lift f into F.

    Lift f into F.

    Definition Classes
    Functor
  52. 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
  53. 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
  54. 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
  55. def lift2[A, B, C](f: (A, B) ⇒ C): (F[W, A], F[W, B]) ⇒ F[W, C]

    Definition Classes
    Apply
  56. 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
  57. 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
  58. 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
  59. 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
  60. 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
  61. 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
  62. 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
  63. 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
  64. 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
  65. def monadLaw: MonadLaw

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

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

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

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

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

    Definition Classes
    AnyRef
  71. 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
  72. 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
  73. 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
  74. def pure[A](a: ⇒ A): F[W, A]

    Definition Classes
    Applicative
  75. 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
  76. 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
  77. def sequence[A, G[_]](as: G[F[W, A]])(implicit arg0: Traverse[G]): F[W, G[A]]

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

    Definition Classes
    Apply
  79. 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
  80. 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
  81. final def synchronized[T0](arg0: ⇒ T0): T0

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

  83. def toString(): String

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

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

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

    Definition Classes
    Apply
  87. 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
  88. 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
  89. 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
  90. 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
  91. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  94. def zip: Zip[[+α]F[W, α]]

    scalaz.Zip derived from tuple2.

    scalaz.Zip derived from tuple2.

    Definition Classes
    Apply

Deprecated Value Members

  1. def map2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: (A, B) ⇒ C): F[W, C]

    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

    (Since version 7) given F: Apply[F] use F(a,b)(f) instead, or given implicitly[Apply[F]], use ^(a,b)(f)

  2. def map3[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
    Annotations
    @deprecated
    Deprecated

    (Since version 7) given F: Apply[F] use F(a,b,c)(f) instead, or given implicitly[Apply[F]], use ^(a,b,c)(f)

  3. def map4[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
    Annotations
    @deprecated
    Deprecated

    (Since version 7) given F: Apply[F] use F(a,b,c,d)(f) instead, or given implicitly[Apply[F]], use ^(a,b,c,d)(f)

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 AnyRef

Inherited from Any

Ungrouped