org.specs2.internal.scalaz

MA

trait MA[M[_], A] extends PimpedType[M[A]] with MASugar[M, A]

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

Abstract Value Members

  1. abstract val value: M[A]

    Definition Classes
    PimpedType

Concrete Value Members

  1. def !(n: Int)(implicit i: Index[M]): Option[A]

  2. def !!(n: Int)(implicit r: Foldable[M]): A

  3. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  5. final def ##(): Int

    Definition Classes
    AnyRef → Any

  6. def &:(a: A): ViewL[M, A]

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

  8. def +>:(a: A)(implicit s: Semigroup[M[A]], q: Pure[M]): M[A]

  9. def -!-(n: Int)(implicit i: Index[M]): A

  10. def :&(a: A): ViewR[M, A]

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

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

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

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

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

  16. def <*>[B](f: M[(A) ⇒ B])(implicit a: Apply[M]): M[B]

  17. def <+>(z: ⇒ M[A])(implicit p: Plus[M]): M[A]

  18. def <+>:(a: A)(implicit p: Plus[M], q: Pure[M]): M[A]

  19. def <--->(w: M[A])(implicit l: Length[M], ind: Index[M], equ: Equal[A]): Int

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

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

  22. def <|**|>[B, C](b: M[B], c: M[C])(implicit t: Functor[M], a: Apply[M]): M[(A, B, C)]

  23. def <|*|>[B](b: M[B])(implicit t: Functor[M], a: Apply[M]): M[(A, B)]

  24. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  25. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  26. def =>>[B](f: (M[A]) ⇒ B)(implicit w: Comonad[M]): M[B]

  27. def >>=[B](f: (A) ⇒ M[B])(implicit b: Bind[M]): M[B]

  28. def >>=|[B](f: ⇒ M[B])(implicit b: Bind[M]): M[B]

  29. def >|[B](f: ⇒ B)(implicit t: Functor[M]): M[B]

  30. def >|>[B](f: ⇒ M[B])(implicit b: Bind[M]): M[B]

    Alias for >>=|

  31. def all(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): Boolean

  32. def any(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): Boolean

  33. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  34. def asMA: MA[M, A]

    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:

    scala> List(1, 2, 3).min res0: Int = 1 scala> List(1, 2, 3).asMA.min res1: Option[Int] = Some(1)

    This is less noisy than the alternative:

    scala> (List(1, 2, 3): MA[List, Int]).min res2: Option[Int] = Some(1)

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

  36. def bktree(implicit f: Foldable[M], m: MetricSpace[A]): BKTree[A]

  37. def clone(): AnyRef

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

  38. def cojoin(implicit j: Cojoin[M]): M[M[A]]

  39. def collapse(implicit t: Traverse[M], m: Monoid[A]): A

  40. def comp[N[_], B](implicit n: <:<[A, N[B]], f: Functor[M]): MA[[α]M[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))

  41. def copure(implicit p: Copure[M]): A

  42. def count(implicit r: Foldable[M]): Int

  43. def digits(implicit c: <:<[A, Char], t: Functor[M]): M[Option[Digit]]

  44. def element(a: A)(implicit r: Foldable[M], eq: Equal[A]): Boolean

  45. def empty(implicit r: Foldable[M]): Boolean

  46. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  47. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  48. def finalize(): Unit

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

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

  50. def foldLeftM[N[_], B](b: B)(f: (B, A) ⇒ N[B])(implicit fr: Foldable[M], m: Monad[N]): N[B]

  51. def foldMap[B](f: (A) ⇒ B)(implicit r: Foldable[M], m: Monoid[B]): B

  52. def foldMapDefault[B](f: (A) ⇒ B)(implicit t: Traverse[M], m: Monoid[B]): B

  53. def foldReduce[B](implicit f: Foldable[M], r: Reducer[A, B]): B

  54. def foldRightM[N[_], B](b: B)(f: (B, A) ⇒ N[B])(implicit fr: Foldable[M], m: Monad[N]): N[B]

  55. def foldl[B](b: B)(f: (B, A) ⇒ B)(implicit r: Foldable[M]): B

  56. def foldl1(f: (A, A) ⇒ A)(implicit r: Foldable[M]): Option[A]

  57. def foldr[B](b: B)(f: (A, ⇒ B) ⇒ B)(implicit r: Foldable[M]): B

  58. def foldr1(f: (A, ⇒ A) ⇒ A)(implicit r: Foldable[M]): Option[A]

  59. def foreach(f: (A) ⇒ Unit)(implicit e: Each[M]): Unit

  60. def forever[B](implicit b: Bind[M]): M[B]

  61. def fpair(implicit f: Functor[M]): M[(A, A)]

  62. def fpure[N[_]](implicit f: Functor[M], p: Pure[N]): M[N[A]]

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

    Definition Classes
    AnyRef → Any

  64. def getOrElseM(a: M[Option[A]])(implicit m: Monad[M]): M[A]

  65. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  66. def ifM[B](t: ⇒ M[B], f: ⇒ M[B])(implicit a: Monad[M], b: <:<[A, Boolean]): M[B]

  67. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  68. def join[B](implicit m: <:<[A, M[B]], b: Bind[M]): M[B]

  69. def len(implicit l: Length[M]): Int

  70. def liftw[F[_]](implicit f: Functor[M], p: Pure[F]): ~>[Id, [α]WriterT[M, F[α], A]]

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

  71. def liftwWith[F[_]](implicit f: Functor[M], p: Pure[F]): ~>[[α](A) ⇒ α, [α]WriterT[M, F[α], A]]

    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

  72. def listl(implicit r: Foldable[M]): List[A]

  73. def listr(implicit r: Foldable[M]): List[A]

  74. def longDigits(implicit d: <:<[A, Digit], t: Foldable[M]): Long

  75. def map[B](f: (A) ⇒ B)(implicit t: Functor[M]): M[B]

  76. def map2[N[_], B, C](f: (B) ⇒ C)(implicit m: <:<[A, N[B]], f1: Functor[M], f2: Functor[N]): M[N[C]]

  77. def max(implicit r: Foldable[M], ord: Order[A]): Option[A]

  78. def min(implicit r: Foldable[M], ord: Order[A]): Option[A]

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

    Definition Classes
    AnyRef

  80. final def notify(): Unit

    Definition Classes
    AnyRef

  81. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  82. def parBind[B](f: (A) ⇒ M[B])(implicit m: Monad[M], s: Strategy, t: Traverse[M]): Promise[M[B]]

  83. def parMap[B](f: (A) ⇒ B)(implicit s: Strategy, t: Traverse[M]): Promise[M[B]]

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

  85. def para[B](b: B, f: (⇒ A, ⇒ M[A], B) ⇒ B)(implicit p: Paramorphism[M]): B

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

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

  87. def putWith[W](w: (A) ⇒ W)(implicit f: Functor[M]): WriterT[M, W, A]

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

  88. def replicateM[N[_]](n: Int)(implicit m: Monad[M], p: Pure[N], d: Monoid[N[A]]): M[N[A]]

  89. def replicateM_(n: Int)(implicit m: Monad[M]): M[Unit]

  90. def selectSplit(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): List[List[A]]

    Selects groups of elements that satisfy p and discards others.

  91. def sequence[N[_], B](implicit a: <:<[A, N[B]], t: Traverse[M], n: Applicative[N]): N[M[B]]

  92. def splitWith(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): List[List[A]]

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

  93. def stream(implicit r: Foldable[M]): Stream[A]

  94. def sum(implicit r: Foldable[M], m: Monoid[A]): A

  95. def sumr(implicit r: Foldable[M], m: Monoid[A]): A

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

    Definition Classes
    AnyRef

  97. def toString(): String

    Definition Classes
    AnyRef → Any

  98. def traverse[F[_], B](f: (A) ⇒ F[B])(implicit a: Applicative[F], t: Traverse[M]): F[M[B]]

  99. def traverseDigits(implicit c: <:<[A, Char], t: Traverse[M]): Option[M[Digit]]

  100. def traverse_[F[_], B](f: (A) ⇒ F[B])(implicit a: Applicative[F], t: Foldable[M]): F[Unit]

  101. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  102. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  103. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  104. def xmap[B](f: (A) ⇒ B)(g: (B) ⇒ A)(implicit xf: InvariantFunctor[M]): M[B]

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

  106. def |>|(f: (A) ⇒ Unit)(implicit e: Each[M]): Unit

  107. def |@|[B](b: M[B]): ApplicativeBuilder[M, A, 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].

  108. def μ[B](implicit m: <:<[A, M[B]], b: Bind[M]): M[B]

    Alias for join

    Alias for join

    Definition Classes
    MASugar

  109. def ↦[F[_], B](f: (A) ⇒ F[B])(implicit a: Applicative[F], t: Traverse[M]): F[M[B]]

    Alias for traverse

    Alias for traverse

    Definition Classes
    MASugar

  110. def ∀(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): Boolean

    Alias for all

    Alias for all

    Definition Classes
    MASugar

  111. def ∃(p: (A) ⇒ Boolean)(implicit r: Foldable[M]): Boolean

    Alias for any

    Alias for any

    Definition Classes
    MASugar

  112. def ∈:(a: A)(implicit r: Foldable[M], eq: Equal[A]): Boolean

    Right associative alias for element

    Right associative alias for element

    Definition Classes
    MASugar

  113. def ∋(a: A)(implicit r: Foldable[M], eq: Equal[A]): Boolean

    Alias for element

    Alias for element

    Definition Classes
    MASugar

  114. def ∗[B](f: (A) ⇒ M[B])(implicit b: Bind[M]): M[B]

    Alias for >>= and flatMap

    Alias for >>= and flatMap

    Definition Classes
    MASugar

  115. def ∗|[B](f: ⇒ M[B])(implicit b: Bind[M]): M[B]

    Alias for >>=|

    Alias for >>=|

    Definition Classes
    MASugar

  116. def ∘[B](f: (A) ⇒ B)(implicit t: Functor[M]): M[B]

    Alias for map

    Alias for map

    Definition Classes
    MASugar

  117. def ∘∘[N[_], B, C](f: (B) ⇒ C)(implicit m: <:<[A, N[B]], f1: Functor[M], f2: Functor[N]): M[N[C]]

    Alias for map2

    Alias for map2

    Definition Classes
    MASugar

  118. def ⊛[B](b: M[B]): ApplicativeBuilder[M, A, B]

    Alias for |@|

    Alias for |@|

    Definition Classes
    MASugar

Inherited from MASugar[M, A]

Inherited from PimpedType[M[A]]

Inherited from AnyRef

Inherited from Any