scalaz

MonadReader

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

Source
MonadReader.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]], InvariantFunctor[[x]F[S, x]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MonadReader
  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 ask: F[S, S]

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

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

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

    Definition Classes
    Bind
  3. abstract def local[A](f: (S) ⇒ S)(fa: F[S, A]): F[S, A]

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

    Definition Classes
    Applicative

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

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

    Definition Classes
    Apply
  8. 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]

    Definition Classes
    Apply
  9. 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]

    Definition Classes
    Apply
  10. 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]

    Definition Classes
    Apply
  11. 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]

    Definition Classes
    Apply
  12. 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]

    Definition Classes
    Apply
  13. 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]

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

    Flipped variant of ap.

    Flipped variant of ap.

    Definition Classes
    Apply
  15. def applicativeLaw: ApplicativeLaw

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

    Definition Classes
    Applicative
  17. def apply[A, B](fa: F[S, A])(f: (A) ⇒ B): F[S, 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[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]

    Definition Classes
    Apply
  19. 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]

    Definition Classes
    Apply
  20. 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]

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

    Definition Classes
    ApplicativeApply
  22. 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]

    Definition Classes
    Apply
  23. 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]

    Definition Classes
    Apply
  24. 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]

    Definition Classes
    Apply
  25. 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]

    Definition Classes
    Apply
  26. 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]

    Definition Classes
    Apply
  27. 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]

    Definition Classes
    Apply
  28. 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]

    Definition Classes
    Apply
  29. def applyApplicative: Applicative[[α]\/[F[S, α], α]]

    Add a unit to any Apply to form an Applicative.

    Add a unit to any Apply to form an Applicative.

    Definition Classes
    Apply
  30. def applyLaw: ApplyLaw

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

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

    Definition Classes
    Any
  33. def asks[A](f: (S) ⇒ A): F[S, A]

  34. def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[S, 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
  35. def bindLaw: BindLaw

    Definition Classes
    Bind
  36. val bindSyntax: BindSyntax[[x]F[S, x]]

    Definition Classes
    Bind
  37. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[S, 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
  39. def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[S, 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
  40. def compose[G[_]](implicit G0: Functor[G]): Functor[[α]F[S, 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
  41. def counzip[A, B](a: \/[F[S, A], F[S, B]]): F[S, \/[A, B]]

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

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

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

    Filter l according to an applicative predicate.

    Filter l according to an applicative predicate.

    Definition Classes
    Applicative
  45. def finalize(): Unit

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

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

    Repeats a monadic action infinitely

    Repeats a monadic action infinitely

    Definition Classes
    Bind
  48. def fpair[A](fa: F[S, A]): F[S, (A, A)]

    Twin all As in fa.

    Twin all As in fa.

    Definition Classes
    Functor
  49. def fproduct[A, B](fa: F[S, A])(f: (A) ⇒ B): F[S, (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
  50. def functorLaw: FunctorLaw

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

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

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

    Definition Classes
    AnyRef → Any
  54. def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[S, 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
  55. def ifM[B](value: F[S, Boolean], ifTrue: ⇒ F[S, B], ifFalse: ⇒ F[S, B]): F[S, 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
  56. def invariantFunctorLaw: InvariantFunctorLaw

    Definition Classes
    InvariantFunctor
  57. val invariantFunctorSyntax: InvariantFunctorSyntax[[x]F[S, x]]

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

    Definition Classes
    Any
  59. def iterateUntil[A](f: F[S, A])(p: (A) ⇒ Boolean): F[S, 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
  60. def iterateWhile[A](f: F[S, A])(p: (A) ⇒ Boolean): F[S, 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
  61. def join[A](ffa: F[S, F[S, A]]): F[S, 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
  62. def lift[A, B](f: (A) ⇒ B): (F[S, A]) ⇒ F[S, B]

    Lift f into F.

    Lift f into F.

    Definition Classes
    Functor
  63. 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]

    Definition Classes
    Apply
  64. 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]

    Definition Classes
    Apply
  65. 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]

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

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

    Definition Classes
    Apply
  68. 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]

    Definition Classes
    Apply
  69. 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]

    Definition Classes
    Apply
  70. 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]

    Definition Classes
    Apply
  71. 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]

    Definition Classes
    Apply
  72. 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]

    Definition Classes
    Apply
  73. 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]

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

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

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

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

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

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

    Definition Classes
    Functor
  76. def monadLaw: MonadLaw

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

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

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

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

    Definition Classes
    AnyRef
  81. def product[G[_]](implicit G0: Applicative[G]): Applicative[[α](F[S, α], 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
  82. def product[G[_]](implicit G0: Apply[G]): Apply[[α](F[S, α], 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
  83. def product[G[_]](implicit G0: Functor[G]): Functor[[α](F[S, α], 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
  84. final def pure[A](a: ⇒ A): F[S, A]

    Definition Classes
    Applicative
  85. def replicateM[A](n: Int, fa: F[S, A]): F[S, 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
  86. def replicateM_[A](n: Int, fa: F[S, A]): F[S, Unit]

    Performs the action n times, returning nothing.

    Performs the action n times, returning nothing.

    Definition Classes
    Applicative
  87. def scope[A](k: S)(fa: F[S, A]): F[S, A]

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

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

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

    Inject a to the left of Bs in f.

    Inject a to the left of Bs in f.

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

    Inject b to the right of As in f.

    Inject b to the right of As in f.

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

    Definition Classes
    AnyRef
  93. def toString(): String

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

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

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

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

    Definition Classes
    Apply
  98. 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)]

    Definition Classes
    Apply
  99. 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)]

    Definition Classes
    Apply
  100. def unlessM[A](cond: Boolean)(f: ⇒ F[S, A]): F[S, 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
  101. def untilM[G[_], A](f: F[S, A], cond: ⇒ F[S, Boolean])(implicit G: MonadPlus[G]): F[S, 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
  102. def untilM_[A](f: F[S, A], cond: ⇒ F[S, Boolean]): F[S, 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
  103. def void[A](fa: F[S, A]): F[S, Unit]

    Empty fa of meaningful pure values, preserving its structure.

    Empty fa of meaningful pure values, preserving its structure.

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  107. def whenM[A](cond: Boolean)(f: ⇒ F[S, A]): F[S, 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
  108. def whileM[G[_], A](p: F[S, Boolean], body: ⇒ F[S, A])(implicit G: MonadPlus[G]): F[S, 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
  109. def whileM_[A](p: F[S, Boolean], body: ⇒ F[S, A]): F[S, 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
  110. def xmap[A, B](fa: F[S, A], f: (A) ⇒ B, g: (B) ⇒ A): F[S, 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
  111. def xmapb[A, B](ma: F[S, A])(b: BijectionT.Bijection[A, B]): F[S, 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
  112. def xmapi[A, B](ma: F[S, A])(iso: Isomorphism.<=>[A, B]): F[S, 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[[x]F[S, x]]

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

Inherited from AnyRef

Inherited from Any

Ungrouped