Trait/Object

scalaz

MonadState

Related Docs: object MonadState | package scalaz

Permalink

trait MonadState[F[_, _], S] extends Monad[[x]F[S, x]]

The class of monads supporting the operations of scalaz.State.

Source
MonadState.scala
Linear Supertypes
Monad[[x]F[S, x]], Bind[[x]F[S, x]], Applicative[[x]F[S, x]], Apply[[x]F[S, x]], Functor[[x]F[S, x]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadState
  2. Monad
  3. Bind
  4. Applicative
  5. Apply
  6. Functor
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeLaw extends FunctorLaw

    Permalink
    Definition Classes
    Applicative
  2. trait FunctorLaw extends AnyRef

    Permalink
    Definition Classes
    Functor
  3. trait MonadLaw extends ApplicativeLaw

    Permalink
    Definition Classes
    Monad

Abstract Value Members

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

    Permalink

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

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

    Definition Classes
    Bind
  2. abstract def get: F[S, S]

    Permalink
  3. abstract def init: F[S, S]

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

    Permalink
    Definition Classes
    Applicative
  5. abstract def put(s: S): F[S, Unit]

    Permalink

Concrete Value Members

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

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

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

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

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

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

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

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

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

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

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

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

    Permalink

    Flipped variant of ap.

    Flipped variant of ap.

    Definition Classes
    Apply
  13. def applicativeLaw: ApplicativeLaw

    Permalink
    Definition Classes
    Applicative
  14. val applicativeSyntax: ApplicativeSyntax[[x]F[S, x]]

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

    Permalink

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

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    Apply
  27. val applySyntax: ApplySyntax[[x]F[S, x]]

    Permalink
    Definition Classes
    Apply
  28. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  29. val bindSyntax: BindSyntax[[x]F[S, x]]

    Permalink
    Definition Classes
    Bind
  30. def clone(): AnyRef

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

    Permalink

    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
  32. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[S, G[α]]]

    Permalink

    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
  33. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[S, G[α]]]

    Permalink

    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
  34. def counzip[A, B](a: \/[F[S, A], F[S, B]]): F[S, \/[A, B]]

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

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

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

    Permalink

    Filter l according to an applicative predicate.

    Filter l according to an applicative predicate.

    Definition Classes
    Applicative
  38. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  39. def flip: Applicative[[x]F[S, x]]

    Permalink

    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
  40. def fpair[A](fa: F[S, A]): F[S, (A, A)]

    Permalink

    Twin all As in fa.

    Twin all As in fa.

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

    Permalink

    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
  42. def functorLaw: FunctorLaw

    Permalink
    Definition Classes
    Functor
  43. val functorSyntax: FunctorSyntax[[x]F[S, x]]

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

    Permalink
    Definition Classes
    AnyRef → Any
  45. def gets[A](f: (S) ⇒ A): F[S, A]

    Permalink
  46. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  47. def ifM[B](value: F[S, Boolean], ifTrue: ⇒ F[S, B], ifFalse: ⇒ F[S, B]): F[S, B]

    Permalink

    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
  48. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  49. def join[A](ffa: F[S, F[S, A]]): F[S, A]

    Permalink

    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
  50. def lift[A, B](f: (A) ⇒ B): (F[S, A]) ⇒ F[S, B]

    Permalink

    Lift f into F.

    Lift f into F.

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

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

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

    Permalink
    Definition Classes
    Apply
  54. def lift2[A, B, C](f: (A, B) ⇒ C): (F[S, A], F[S, B]) ⇒ F[S, C]

    Permalink
    Definition Classes
    Apply
  55. def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[S, A], F[S, B], F[S, C]) ⇒ F[S, D]

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

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

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

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

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

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

    Permalink
    Definition Classes
    Apply
  62. def map[A, B](fa: F[S, A])(f: (A) ⇒ B): F[S, B]

    Permalink

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

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

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

    Permalink

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

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

    Definition Classes
    Functor
  64. def modify(f: (S) ⇒ S): F[S, Unit]

    Permalink
  65. def monadLaw: MonadLaw

    Permalink
    Definition Classes
    Monad
  66. val monadSyntax: MonadSyntax[[x]F[S, x]]

    Permalink
    Definition Classes
    Monad
  67. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  68. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  69. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  70. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[S, α], G[α])]

    Permalink

    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
  71. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[S, α], G[α])]

    Permalink

    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
  72. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[S, α], G[α])]

    Permalink

    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
  73. def pure[A](a: ⇒ A): F[S, A]

    Permalink
    Definition Classes
    Applicative
  74. def replicateM[A](n: Int, fa: F[S, A]): F[S, List[A]]

    Permalink

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

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

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

    Permalink

    Performs the action n times, returning nothing.

    Performs the action n times, returning nothing.

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

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

    Permalink
    Definition Classes
    Apply
  78. def strengthL[A, B](a: A, f: F[S, B]): F[S, (A, B)]

    Permalink

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

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

    Permalink

    Inject b to the right of As in f.

    Inject b to the right of As in f.

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

    Permalink
    Definition Classes
    AnyRef
  81. def toString(): String

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

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

    Permalink
    Definition Classes
    Apply
  84. def tuple2[A, B](fa: ⇒ F[S, A], fb: ⇒ F[S, B]): F[S, (A, B)]

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

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

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

    Permalink
    Definition Classes
    Apply
  88. def void[A](fa: F[S, A]): F[S, Unit]

    Permalink

    Empty fa of meaningful pure values, preserving its structure.

    Empty fa of meaningful pure values, preserving its structure.

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

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

    Permalink
    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

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

  2. def map3[A, B, C, D](fa: ⇒ F[S, A], fb: ⇒ F[S, B], fc: ⇒ F[S, C])(f: (A, B, C) ⇒ D): F[S, D]

    Permalink
    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

    (Since version 7) given F: Apply[F] use F.apply3(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[S, A], fb: ⇒ F[S, B], fc: ⇒ F[S, C], fd: ⇒ F[S, D])(f: (A, B, C, D) ⇒ E): F[S, E]

    Permalink
    Definition Classes
    Apply
    Annotations
    @deprecated
    Deprecated

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

  4. def zip: Zip[[x]F[S, x]]

    Permalink

    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[[x]F[S, x]]

Inherited from Bind[[x]F[S, x]]

Inherited from Applicative[[x]F[S, x]]

Inherited from Apply[[x]F[S, x]]

Inherited from Functor[[x]F[S, x]]

Inherited from AnyRef

Inherited from Any

Ungrouped