scalaz

MAB

trait MAB [M[_, _], A, B] extends PimpedType[M[A, B]] with MA[[X]M[A, X], B]

Attributes
sealed
Linear Supertypes
MA[[X]M[A, X], B], MASugar[[X]M[A, X], B], PimpedType[M[A, B]], AnyRef, Any
Ordering
1. Alphabetic
2. By inheritance
Inherited
1. Hide All
2. Show all
1. MAB
2. MA
3. MASugar
4. PimpedType
5. AnyRef
6. Any
Visibility
1. Public
2. All

Abstract Value Members

1. val value : M[A, B]

Attributes
abstract
Definition Classes
PimpedType

Concrete Value Members

1. def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
2. def != (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
3. def ## (): Int

Attributes
final
Definition Classes
AnyRef → Any

5. def &: (a: B): ViewL[[X]M[A, X], B]

Definition Classes
MA

7. def *> [B] (b: M[A, B])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, B]

Definition Classes
MA
8. def +>: (a: B)(implicit s: Semigroup[M[A, B]], q: Pure[[X]M[A, X]]): M[A, B]

Definition Classes
MA
9. def -!- (n: Int)(implicit i: Index[[X]M[A, X]]): B

Definition Classes
MA
10. def :& (a: B): ViewR[[X]M[A, X], B]

Definition Classes
MA

12. def <* [B] (b: M[A, B])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, B]

Definition Classes
MA
13. def <*****> [B, C, D, E, F] (b: M[A, B], c: M[A, C], d: M[A, D], e: M[A, E])(z: (B, B, C, D, E) ⇒ F)(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, F]

Definition Classes
MA
14. def <****> [B, C, D, E] (b: M[A, B], c: M[A, C], d: M[A, D])(z: (B, B, C, D) ⇒ E)(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, E]

Definition Classes
MA
15. def <***> [B, C, D] (b: M[A, B], c: M[A, C])(z: (B, B, C) ⇒ D)(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, D]

Definition Classes
MA
16. def <**> [B, C] (b: M[A, B])(z: (B, B) ⇒ C)(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, C]

Definition Classes
MA
17. def <*> [B] (f: M[A, (B) ⇒ B])(implicit a: Apply[[X]M[A, X]]): M[A, B]

Definition Classes
MA
18. def <+> (z: ⇒ M[A, B])(implicit p: Plus[[X]M[A, X]]): M[A, B]

Definition Classes
MA
19. def <+>: (a: B)(implicit p: Plus[[X]M[A, X]], q: Pure[[X]M[A, X]]): M[A, B]

Definition Classes
MA
20. def <---> (w: M[A, B])(implicit l: Length[[X]M[A, X]], ind: Index[[X]M[A, X]], equ: Equal[B]): Int

Definition Classes
MA

24. def <|****|> [B, C, D, E] (b: M[A, B], c: M[A, C], d: M[A, D], e: M[A, E])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, (B, B, C, D, E)]

Definition Classes
MA
25. def <|***|> [B, C, D] (b: M[A, B], c: M[A, C], d: M[A, D])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, (B, B, C, D)]

Definition Classes
MA
26. def <|**|> [B, C] (b: M[A, B], c: M[A, C])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, (B, B, C)]

Definition Classes
MA
27. def <|*|> [B] (b: M[A, B])(implicit t: Functor[[X]M[A, X]], a: Apply[[X]M[A, X]]): M[A, (B, B)]

Definition Classes
MA
28. def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
29. def == (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
30. def =>> [B] (f: (M[A, B]) ⇒ B)(implicit w: Comonad[[X]M[A, X]]): M[A, B]

Definition Classes
MA
31. def >>= [B] (f: (B) ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Definition Classes
MA
32. def >>=| [B] (f: ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Definition Classes
MA

35. def >| [B] (f: ⇒ B)(implicit t: Functor[[X]M[A, X]]): M[A, B]

Definition Classes
MA
36. def >|> [B] (f: ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Alias for >>=|

Alias for >>=|

Definition Classes
MA

39. def all (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): Boolean

Definition Classes
MA
40. def any (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): Boolean

Definition Classes
MA
41. def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
42. def asMA : MA[[X]M[A, X], B]

Use this to force implicit conversion of M[A] to MA[M, A].

Use this to force implicit conversion of M[A] to MA[M, A]. Useful when the original type contains a member with the same name as MA, for example: List(1,2,3) map f

Definition Classes
MA

44. def asStream [B] (f: (Stream[B]) ⇒ Stream[B])(implicit r: Foldable[[X]M[A, X]], m: Monoid[M[A, B]], p: Pure[[X]M[A, X]]): M[A, B]

Definition Classes
MA
45. def bktree (implicit f: Foldable[[X]M[A, X]], m: MetricSpace[B]): BKTree[B]

Definition Classes
MA
46. def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
47. def cojoin (implicit j: Cojoin[[X]M[A, X]]): M[A, M[A, B]]

Definition Classes
MA
48. def collapse (implicit t: Traverse[[X]M[A, X]], m: Monoid[B]): B

Definition Classes
MA
49. def comp [N[_], B] (implicit n: <:<[B, N[B]], f: Functor[[X]M[A, X]]): MA[[α]M[A, N[α]], B]

Returns a MA with the type parameter `M` equal to [A] M[N[A]], given that type `A` is constructed from type constructor `N`.

Returns a MA with the type parameter `M` equal to [A] M[N[A]], given that type `A` is constructed from type constructor `N`. This allows composition of type classes for `M` and `N`. For example: `(List(List(1)).comp.map {2 +}) assert_=== List(List(3))`

Definition Classes
MA
50. def copure (implicit p: Copure[[X]M[A, X]]): B

Definition Classes
MA
51. def count (implicit r: Foldable[[X]M[A, X]]): Int

Definition Classes
MA
52. def digits (implicit c: <:<[B, Char], t: Functor[[X]M[A, X]]): M[A, Option[Digit]]

Definition Classes
MA
53. def element (a: B)(implicit r: Foldable[[X]M[A, X]], eq: Equal[B]): Boolean

Definition Classes
MA
54. def empty (implicit r: Foldable[[X]M[A, X]]): Boolean

Definition Classes
MA
55. def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
56. def equals (arg0: Any): Boolean

Definition Classes
AnyRef → Any
57. def finalize (): Unit

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

59. def flatMap [B] (f: (B) ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Definition Classes
MA
60. def foldIndex (n: Int)(implicit r: Foldable[[X]M[A, X]]): B

Definition Classes
MA
61. def foldLeftM [N[_], B] (b: B)(f: (B, B) ⇒ N[B])(implicit fr: Foldable[[X]M[A, X]], m: Monad[N]): N[B]

Definition Classes
MA
62. def foldMap [B] (f: (B) ⇒ B)(implicit r: Foldable[[X]M[A, X]], m: Monoid[B]): B

Definition Classes
MA
63. def foldMapDefault [B] (f: (B) ⇒ B)(implicit t: Traverse[[X]M[A, X]], m: Monoid[B]): B

Definition Classes
MA
64. def foldReduce [B] (implicit f: Foldable[[X]M[A, X]], r: Reducer[B, B]): B

Definition Classes
MA
65. def foldRightM [N[_], B] (b: B)(f: (B, B) ⇒ N[B])(implicit fr: Foldable[[X]M[A, X]], m: Monad[N]): N[B]

Definition Classes
MA
66. def foldl [B] (b: B)(f: (B, B) ⇒ B)(implicit r: Foldable[[X]M[A, X]]): B

Definition Classes
MA
67. def foldl1 (f: (B, B) ⇒ B)(implicit r: Foldable[[X]M[A, X]]): Option[B]

Definition Classes
MA
68. def foldr [B] (b: B)(f: (B, ⇒ B) ⇒ B)(implicit r: Foldable[[X]M[A, X]]): B

Definition Classes
MA
69. def foldr1 (f: (B, ⇒ B) ⇒ B)(implicit r: Foldable[[X]M[A, X]]): Option[B]

Definition Classes
MA
70. def foreach (f: (B) ⇒ Unit)(implicit e: Each[[X]M[A, X]]): Unit

Definition Classes
MA
71. def forever [B] (implicit b: Bind[[X]M[A, X]]): M[A, B]

Definition Classes
MA
72. def fpair (implicit f: Functor[[X]M[A, X]]): M[A, (B, B)]

Definition Classes
MA
73. def fpure [N[_]] (implicit f: Functor[[X]M[A, X]], p: Pure[N]): M[A, N[B]]

Definition Classes
MA
74. def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
75. def getOrElseM (a: M[A, Option[B]])(implicit m: Monad[[X]M[A, X]]): M[A, B]

Definition Classes
MA
76. def hashCode (): Int

Definition Classes
AnyRef → Any
77. def ifM [B] (t: ⇒ M[A, B], f: ⇒ M[A, B])(implicit a: Monad[[X]M[A, X]], b: <:<[B, Boolean]): M[A, B]

Definition Classes
MA
78. def index (n: Int)(implicit i: Index[[X]M[A, X]]): Option[B]

Definition Classes
MA
79. def index_! (n: Int)(implicit i: Index[[X]M[A, X]]): B

Definition Classes
MA
80. def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
81. def join [B] (implicit m: <:<[B, M[A, B]], b: Bind[[X]M[A, X]]): M[A, B]

Definition Classes
MA
82. def len (implicit l: Length[[X]M[A, X]]): Int

Definition Classes
MA
83. def liftw [F[_]] (implicit f: Functor[[X]M[A, X]], p: Pure[F]): ~>[Id, [α]WriterT[[X]M[A, X], F[α], B]]

Puts the given write value into a writer transformer, lifted into a pointed functor, and associates with this M[A] value

Puts the given write value into a writer transformer, lifted into a pointed functor, and associates with this M[A] value

Definition Classes
MA
84. def liftwWith [F[_]] (implicit f: Functor[[X]M[A, X]], p: Pure[F]): ~>[[α](B) ⇒ α, [α]WriterT[[X]M[A, X], F[α], B]]

Puts the given write value that is produced by applying the given function into a writer transformer, lifted into a pointed functor, and associates with this M[A] value

Puts the given write value that is produced by applying the given function into a writer transformer, lifted into a pointed functor, and associates with this M[A] value

Definition Classes
MA
85. def listl (implicit r: Foldable[[X]M[A, X]]): List[B]

Definition Classes
MA
86. def listr (implicit r: Foldable[[X]M[A, X]]): List[B]

Definition Classes
MA
87. def longDigits (implicit d: <:<[B, Digit], t: Foldable[[X]M[A, X]]): Long

Definition Classes
MA
88. def map [B] (f: (B) ⇒ B)(implicit t: Functor[[X]M[A, X]]): M[A, B]

Definition Classes
MA
89. def map2 [N[_], B, C] (f: (B) ⇒ C)(implicit m: <:<[B, N[B]], f1: Functor[[X]M[A, X]], f2: Functor[N]): M[A, N[C]]

Definition Classes
MA
90. def maximum (implicit r: Foldable[[X]M[A, X]], ord: Order[B]): Option[B]

Definition Classes
MA
91. def minimum (implicit r: Foldable[[X]M[A, X]], ord: Order[B]): Option[B]

Definition Classes
MA
92. def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
93. def notify (): Unit

Attributes
final
Definition Classes
AnyRef
94. def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
95. def parBind [B] (f: (B) ⇒ M[A, B])(implicit m: Monad[[X]M[A, X]], s: Strategy, t: Traverse[[X]M[A, X]]): Promise[M[A, B]]

Definition Classes
MA
96. def parMap [B] (f: (B) ⇒ B)(implicit s: Strategy, t: Traverse[[X]M[A, X]]): Promise[M[A, B]]

Definition Classes
MA
97. def parZipWith [B, C] (bs: M[A, B])(f: (B, B) ⇒ C)(implicit z: Applicative[[X]M[A, X]], s: Strategy, t: Traverse[[X]M[A, X]]): Promise[M[A, C]]

Definition Classes
MA
98. def para [B] (b: B, f: (⇒ B, ⇒ M[A, B], B) ⇒ B)(implicit p: Paramorphism[[X]M[A, X]]): B

Definition Classes
MA

100. def put [W] (w: W)(implicit f: Functor[[X]M[A, X]]): WriterT[[X]M[A, X], W, B]

Puts the given write value into a writer transformer and associates with this M[A] value

Puts the given write value into a writer transformer and associates with this M[A] value

Definition Classes
MA
101. def putWith [W] (w: (B) ⇒ W)(implicit f: Functor[[X]M[A, X]]): WriterT[[X]M[A, X], W, B]

Puts the write value that is produced by applying the given function into a writer transformer and associates with this M[A] value

Puts the write value that is produced by applying the given function into a writer transformer and associates with this M[A] value

Definition Classes
MA
102. def replicateM [N[_]] (n: Int)(implicit m: Monad[[X]M[A, X]], p: Pure[N], d: Monoid[N[B]]): M[A, N[B]]

Definition Classes
MA
103. def replicateM_ (n: Int)(implicit m: Monad[[X]M[A, X]]): M[A, Unit]

Definition Classes
MA

105. def selectSplit (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): List[List[B]]

Selects groups of elements that satisfy p and discards others.

Selects groups of elements that satisfy p and discards others.

Definition Classes
MA
106. def sequence [N[_], B] (implicit a: <:<[B, N[B]], t: Traverse[[X]M[A, X]], n: Applicative[N]): N[M[A, B]]

Definition Classes
MA
107. def splitWith (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): List[List[B]]

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Splits the elements into groups that alternatively satisfy and don't satisfy the predicate p.

Definition Classes
MA
108. def stream (implicit r: Foldable[[X]M[A, X]]): Stream[B]

Definition Classes
MA
109. def sum (implicit r: Foldable[[X]M[A, X]], m: Monoid[B]): B

Definition Classes
MA
110. def sumr (implicit r: Foldable[[X]M[A, X]], m: Monoid[B]): B

Definition Classes
MA
111. def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
112. def toString (): String

Definition Classes
AnyRef → Any
113. def traverse [F[_], B] (f: (B) ⇒ F[B])(implicit a: Applicative[F], t: Traverse[[X]M[A, X]]): F[M[A, B]]

Definition Classes
MA
114. def traverseDigits (implicit c: <:<[B, Char], t: Traverse[[X]M[A, X]]): Option[M[A, Digit]]

Definition Classes
MA
115. def traverse_ [F[_], B] (f: (B) ⇒ F[B])(implicit a: Applicative[F], t: Foldable[[X]M[A, X]]): F[Unit]

Definition Classes
MA
116. def wait (): Unit

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

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

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
119. def xmap [B] (f: (B) ⇒ B)(g: (B) ⇒ B)(implicit xf: InvariantFunctor[[X]M[A, X]]): M[A, B]

Definition Classes
MA
120. def zipWithA [F[_], B, C] (b: M[A, B])(f: (B, B) ⇒ F[C])(implicit a: Applicative[[X]M[A, X]], t: Traverse[[X]M[A, X]], z: Applicative[F]): F[M[A, C]]

Definition Classes
MA
121. def |>| (f: (B) ⇒ Unit)(implicit e: Each[[X]M[A, X]]): Unit

Definition Classes
MA
122. def |@| [B] (b: M[A, B]): ApplicativeBuilder[[X]M[A, X], B, B]

Accumulates values MA[A] and MA[B], and returns an ApplicativeBuilder that can accumulate further such values.

Accumulates values MA[A] and MA[B], and returns an ApplicativeBuilder that can accumulate further such values. These values can be then applied to a provided function through the Applicative Functor for M.

Example:

(1.some ⊛ 2.some) apply { (a, b, c) => a + b + c) } === Some(3) (1.some ⊛ 2.some ⊛ 3.some) tupled === Some((1, 2, 3))

returns

An ApplicativeBuilder that has accumulated `value: M[A]` and `b: M[B]`.

Definition Classes
MA
123. def μ [B] (implicit m: <:<[B, M[A, B]], b: Bind[[X]M[A, X]]): M[A, B]

Alias for join

Alias for join

Definition Classes
MASugar
124. def ↦ [F[_], B] (f: (B) ⇒ F[B])(implicit a: Applicative[F], t: Traverse[[X]M[A, X]]): F[M[A, B]]

Alias for traverse

Alias for traverse

Definition Classes
MASugar
125. def ∀ (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): Boolean

Alias for all

Alias for all

Definition Classes
MASugar
126. def ∃ (p: (B) ⇒ Boolean)(implicit r: Foldable[[X]M[A, X]]): Boolean

Alias for any

Alias for any

Definition Classes
MASugar
127. def ∈: (a: B)(implicit r: Foldable[[X]M[A, X]], eq: Equal[B]): Boolean

Right associative alias for element

Right associative alias for element

Definition Classes
MASugar
128. def ∋ (a: B)(implicit r: Foldable[[X]M[A, X]], eq: Equal[B]): Boolean

Alias for element

Alias for element

Definition Classes
MASugar
129. def ∗ [B] (f: (B) ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Alias for >>= and flatMap

Alias for >>= and flatMap

Definition Classes
MASugar
130. def ∗| [B] (f: ⇒ M[A, B])(implicit b: Bind[[X]M[A, X]]): M[A, B]

Alias for >>=|

Alias for >>=|

Definition Classes
MASugar
131. def ∘ [B] (f: (B) ⇒ B)(implicit t: Functor[[X]M[A, X]]): M[A, B]

Alias for map

Alias for map

Definition Classes
MASugar
132. def ∘∘ [N[_], B, C] (f: (B) ⇒ C)(implicit m: <:<[B, N[B]], f1: Functor[[X]M[A, X]], f2: Functor[N]): M[A, N[C]]

Alias for map2

Alias for map2

Definition Classes
MASugar
133. def ⊛ [B] (b: M[A, B]): ApplicativeBuilder[[X]M[A, X], B, B]

Alias for |@|

Alias for |@|

Definition Classes
MASugar