scalaz

WriterTMonad

trait WriterTMonad[F[+_], W] extends Monad[[+α]WriterT[F, W, α]] with WriterTApplicative[F, W] with WriterTPointed[F, W]

Source
WriterT.scala
Linear Supertypes
WriterTApplicative[F, W], WriterTPointed[F, W], WriterTApply[F, W], WriterTFunctor[F, W], Monad[[+α]WriterT[F, W, α]], Bind[[+α]WriterT[F, W, α]], Applicative[[+α]WriterT[F, W, α]], Pointed[[+α]WriterT[F, W, α]], Apply[[+α]WriterT[F, W, α]], Functor[[+α]WriterT[F, W, α]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. WriterTMonad
  2. WriterTApplicative
  3. WriterTPointed
  4. WriterTApply
  5. WriterTFunctor
  6. Monad
  7. Bind
  8. Applicative
  9. Pointed
  10. Apply
  11. Functor
  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 FunctorLaw

    Definition Classes
    Applicative

  2. trait FunctorLaw extends AnyRef

    Definition Classes
    Functor

  3. trait MonadLaw extends ApplicativeLaw

    Definition Classes
    Monad

Abstract Value Members

  1. implicit abstract def F: Monad[F]

    Definition Classes
    WriterTMonad → WriterTApplicative → WriterTPointed → WriterTApply → WriterTFunctor

  2. implicit abstract def W: Monoid[W]

    Definition Classes
    WriterTApplicative → WriterTPointed → WriterTApply

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

    Definition Classes
    WriterTApply → Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  14. def apF[A, B](f: ⇒ WriterT[F, W, (A) ⇒ B]): (WriterT[F, W, A]) ⇒ WriterT[F, W, B]

    Definition Classes
    Apply

  15. def applicativeLaw: ApplicativeLaw

    Definition Classes
    Applicative

  16. val applicativeSyntax: ApplicativeSyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Applicative

  17. def apply[A, B](fa: WriterT[F, W, A])(f: (A) ⇒ B): WriterT[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: ⇒ WriterT[F, W, A], fb: ⇒ WriterT[F, W, B], fc: ⇒ WriterT[F, W, C], fd: ⇒ WriterT[F, W, D], fe: ⇒ WriterT[F, W, E], ff: ⇒ WriterT[F, W, FF], fg: ⇒ WriterT[F, W, G], fh: ⇒ WriterT[F, W, H], fi: ⇒ WriterT[F, W, I], fj: ⇒ WriterT[F, W, J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): WriterT[F, W, R]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Applicative → Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  29. val applySyntax: ApplySyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Apply

  30. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

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

    Definition Classes
    WriterTMonad → Bind

  32. val bindSyntax: BindSyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Bind

  33. def clone(): AnyRef

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

  34. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]WriterT[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

  35. def compose[G[_]](implicit G0: Pointed[G]): Pointed[[α]WriterT[F, W, G[α]]]

    The composition of Pointeds F and G, [x]F[G[x]], is a Pointed

    The composition of Pointeds F and G, [x]F[G[x]], is a Pointed

    Definition Classes
    Pointed

  36. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]WriterT[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[[α]WriterT[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: \/[WriterT[F, W, A], WriterT[F, W, B]]): WriterT[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) ⇒ WriterT[F, W, Boolean]): WriterT[F, W, List[A]]

    Definition Classes
    Monad

  42. def finalize(): Unit

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

  43. def flip: Applicative[[+α]WriterT[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 fpair[A](fa: WriterT[F, W, A]): WriterT[F, W, (A, A)]

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor

  45. def functorLaw: FunctorLaw

    Definition Classes
    Functor

  46. val functorSyntax: FunctorSyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Functor

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

    Definition Classes
    AnyRef → Any

  48. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  49. def ifM[B](value: WriterT[F, W, Boolean], ifTrue: ⇒ WriterT[F, W, B], ifFalse: ⇒ WriterT[F, W, B]): WriterT[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

  50. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  51. def join[A](ffa: WriterT[F, W, WriterT[F, W, A]]): WriterT[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

  52. def lift[A, B](f: (A) ⇒ B): (WriterT[F, W, A]) ⇒ WriterT[F, W, B]

    Lift f into F.

    Lift f into F.

    Definition Classes
    Functor

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  56. def lift2[A, B, C](f: (A, B) ⇒ C): (WriterT[F, W, A], WriterT[F, W, B]) ⇒ WriterT[F, W, C]

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  64. def map[A, B](fa: WriterT[F, W, A])(f: (A) ⇒ B): WriterT[F, W, B]

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

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

    Definition Classes
    WriterTFunctor → Functor

  65. def mapply[A, B](a: A)(f: WriterT[F, W, (A) ⇒ B]): WriterT[F, W, B]

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

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

    Definition Classes
    Functor

  66. def monadLaw: MonadLaw

    Definition Classes
    Monad

  67. val monadSyntax: MonadSyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Monad

  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 point[A](a: ⇒ A): WriterT[F, W, A]

    Definition Classes
    WriterTPointed → Pointed

  72. val pointedSyntax: PointedSyntax[[+α]WriterT[F, W, α]]

    Definition Classes
    Pointed

  73. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](WriterT[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

  74. def product[G[_]](implicit G0: Pointed[G]): Pointed[[α](WriterT[F, W, α], G[α])]

    The product of Pointeds F and G, [x](F[x], G[x]]), is a Pointed

    The product of Pointeds F and G, [x](F[x], G[x]]), is a Pointed

    Definition Classes
    Pointed

  75. def product[G[_]](implicit G0: Apply[G]): Apply[[α](WriterT[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

  76. def product[G[_]](implicit G0: Functor[G]): Functor[[α](WriterT[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

  77. def pure[A](a: ⇒ A): WriterT[F, W, A]

    alias for point

    alias for point

    Definition Classes
    Pointed

  78. def replicateM[A](n: Int, fa: WriterT[F, W, A]): WriterT[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
    Monad

  79. def replicateM_[A](n: Int, fa: WriterT[F, W, A]): WriterT[F, W, Unit]

    Performs the action n times, returning nothing.

    Performs the action n times, returning nothing.

    Definition Classes
    Monad

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

    Definition Classes
    Applicative

  81. def strengthL[A, B](a: A, f: WriterT[F, W, B]): WriterT[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

  82. def strengthR[A, B](f: WriterT[F, W, A], b: B): WriterT[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

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

    Definition Classes
    AnyRef

  84. def toString(): String

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    Applicative

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

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

    Definition Classes
    Apply

  90. def void[A](fa: WriterT[F, W, A]): WriterT[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[[+α]WriterT[F, W, α]]

    Definition Classes
    Apply

Deprecated Value Members

  1. def map2[A, B, C](fa: ⇒ WriterT[F, W, A], fb: ⇒ WriterT[F, W, B])(f: (A, B) ⇒ C): WriterT[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: ⇒ WriterT[F, W, A], fb: ⇒ WriterT[F, W, B], fc: ⇒ WriterT[F, W, C])(f: (A, B, C) ⇒ D): WriterT[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: ⇒ WriterT[F, W, A], fb: ⇒ WriterT[F, W, B], fc: ⇒ WriterT[F, W, C], fd: ⇒ WriterT[F, W, D])(f: (A, B, C, D) ⇒ E): WriterT[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 WriterTApplicative[F, W]

Inherited from WriterTPointed[F, W]

Inherited from WriterTApply[F, W]

Inherited from WriterTFunctor[F, W]

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

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

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

Inherited from Pointed[[+α]WriterT[F, W, α]]

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped