Packages

o

scalaz

Scalaz

object Scalaz extends StateFunctions with ToTypeClassOps with ToDataOps with AllInstances with AllFunctions with ToAllStdOps with IdInstances

Source
Scalaz.scala
Linear Supertypes
IdInstances, ToAllStdOps, ToTryOps, ToEitherOps, ToMapOps, ToTupleOps, ToStringOps, ToFunction1Ops, ToFunction2Ops, ToLazyListOps, ToVectorOps, ToStreamOps, ToListOps, ToOptionIdOps, ToOptionOps, ToBooleanOps, AllFunctions, FunctionFunctions, StringFunctions, OrderingFunctions, BooleanFunctions, LazyListFunctions, OptionFunctions, ListFunctions, AllInstances, TimeInstances, CallableInstances, EnumInstances, BigIntegerInstances, BigDecimalInstances, std.java.util.MapInstances, std.math.OrderingInstances, BigInts, BigDecimalInstances, TypeConstraintInstances, PartialFunctionInstances, EitherInstances, EitherInstances0, FutureInstances, FutureInstances1, VectorInstances, VectorInstances0, TupleInstances, TupleInstances3, TupleInstances2, TupleInstances1, TupleInstances0, LazyListInstances, StreamInstances, StringInstances, SetInstances, OptionInstances, OptionInstances0, OptionInstances1, SortedMapInstances, SortedMapFunctions, SortedMapInstances0, std.MapInstances, MapFunctions, std.MapInstances0, ListInstances, ListInstances0, FunctionInstances, FunctionInstances0, FunctionInstances1, AnyValInstances, ToDataOps, ToConstOps, ToContTOps, ToMaybeOps, ToTheseOps, ToNelOps, ToEitherTOps, ToEitherOps, ToKleisliOps, ToKleisliOps0, ToValidationOps, ToStateOps, ToWriterOps, ToReducerOps, ToStrictTreeOps, ToTreeOps, ToIdOps, ToTypeClassOps, ToProChoiceOps0[ProChoice], ToProChoiceOpsU[ProChoice], ToMonadTransOps, ToAlignOps0[Align], ToAlignOpsU[Align], ToOptionalOps0[Optional], ToOptionalOpsU[Optional], ToTraverse1Ops0[Traverse1], ToTraverse1OpsU[Traverse1], ToFoldable1Ops0[Foldable1], ToFoldable1OpsU[Foldable1], ToApplicativeErrorOps0[ApplicativeError], ToMonadErrorOps0[MonadError], ToMonadListenOps0[MonadListen], ToMonadTellOps0[MonadTell], ToUnzipOps0[Unzip], ToUnzipOpsU[Unzip], ToZipOps0[Zip], ToZipOpsU[Zip], ToSplitOps0[Split], ToSplitOpsU[Split], ToChoiceOps0[Choice], ToChoiceOpsU[Choice], ToFoldableOps0[Foldable], ToFoldableOpsU[Foldable], ToStrongOps0[Strong], ToStrongOpsU[Strong], ToProfunctorOps0[Profunctor], ToProfunctorOpsU[Profunctor], ToArrowOps0[Arrow], ToArrowOpsU[Arrow], ToCategoryOps0[Category], ToCategoryOpsU[Category], ToComposeOps0[Compose], ToComposeOpsU[Compose], ToBitraverseOps0[Bitraverse], ToBitraverseOpsU[Bitraverse], ToAssociativeOps0[Associative], ToAssociativeOpsU[Associative], ToBifunctorOps0[Bifunctor], ToBifunctorOpsU[Bifunctor], ToTraverseOps0[Traverse], ToTraverseOpsU[Traverse], ToMonadPlusOps0[MonadPlus], ToMonadPlusOpsU[MonadPlus], ToAltOps0[Alt], ToAltOpsU[Alt], ToApplicativePlusOps0[ApplicativePlus], ToApplicativePlusOpsU[ApplicativePlus], ToPlusOps0[Plus], ToPlusOpsU[Plus], ToCozipOps0[Cozip], ToCozipOpsU[Cozip], ToBifoldableOps0[Bifoldable], ToBifoldableOpsU[Bifoldable], ToComonadOps0[Comonad], ToComonadOpsU[Comonad], ToMonadOps0[Monad], ToMonadOpsU[Monad], ToBindOps0[Bind], ToBindOpsU[Bind], ToApplicativeOps0[Applicative], ToApplicativeOpsU[Applicative], ToApplyOps0[Apply], ToApplyOpsU[Apply], ToContravariantOps0[Contravariant], ToContravariantOpsU[Contravariant], ToFunctorOps0[Functor], ToFunctorOpsU[Functor], ToPlusEmptyOps0[PlusEmpty], ToPlusEmptyOpsU[PlusEmpty], ToEnumOps, ToOrderOps, ToShowOps, ToEqualOps, ToBandOps, ToMonoidOps, ToSemigroupOps, StateFunctions, IndexedStateFunctions, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Scalaz
  2. IdInstances
  3. ToAllStdOps
  4. ToTryOps
  5. ToEitherOps
  6. ToMapOps
  7. ToTupleOps
  8. ToStringOps
  9. ToFunction1Ops
  10. ToFunction2Ops
  11. ToLazyListOps
  12. ToVectorOps
  13. ToStreamOps
  14. ToListOps
  15. ToOptionIdOps
  16. ToOptionOps
  17. ToBooleanOps
  18. AllFunctions
  19. FunctionFunctions
  20. StringFunctions
  21. OrderingFunctions
  22. BooleanFunctions
  23. LazyListFunctions
  24. OptionFunctions
  25. ListFunctions
  26. AllInstances
  27. TimeInstances
  28. CallableInstances
  29. EnumInstances
  30. BigIntegerInstances
  31. BigDecimalInstances
  32. MapInstances
  33. OrderingInstances
  34. BigInts
  35. BigDecimalInstances
  36. TypeConstraintInstances
  37. PartialFunctionInstances
  38. EitherInstances
  39. EitherInstances0
  40. FutureInstances
  41. FutureInstances1
  42. VectorInstances
  43. VectorInstances0
  44. TupleInstances
  45. TupleInstances3
  46. TupleInstances2
  47. TupleInstances1
  48. TupleInstances0
  49. LazyListInstances
  50. StreamInstances
  51. StringInstances
  52. SetInstances
  53. OptionInstances
  54. OptionInstances0
  55. OptionInstances1
  56. SortedMapInstances
  57. SortedMapFunctions
  58. SortedMapInstances0
  59. MapInstances
  60. MapFunctions
  61. MapInstances0
  62. ListInstances
  63. ListInstances0
  64. FunctionInstances
  65. FunctionInstances0
  66. FunctionInstances1
  67. AnyValInstances
  68. ToDataOps
  69. ToConstOps
  70. ToContTOps
  71. ToMaybeOps
  72. ToTheseOps
  73. ToNelOps
  74. ToEitherTOps
  75. ToEitherOps
  76. ToKleisliOps
  77. ToKleisliOps0
  78. ToValidationOps
  79. ToStateOps
  80. ToWriterOps
  81. ToReducerOps
  82. ToStrictTreeOps
  83. ToTreeOps
  84. ToIdOps
  85. ToTypeClassOps
  86. ToProChoiceOps0
  87. ToProChoiceOpsU
  88. ToMonadTransOps
  89. ToAlignOps0
  90. ToAlignOpsU
  91. ToOptionalOps0
  92. ToOptionalOpsU
  93. ToTraverse1Ops0
  94. ToTraverse1OpsU
  95. ToFoldable1Ops0
  96. ToFoldable1OpsU
  97. ToApplicativeErrorOps0
  98. ToMonadErrorOps0
  99. ToMonadListenOps0
  100. ToMonadTellOps0
  101. ToUnzipOps0
  102. ToUnzipOpsU
  103. ToZipOps0
  104. ToZipOpsU
  105. ToSplitOps0
  106. ToSplitOpsU
  107. ToChoiceOps0
  108. ToChoiceOpsU
  109. ToFoldableOps0
  110. ToFoldableOpsU
  111. ToStrongOps0
  112. ToStrongOpsU
  113. ToProfunctorOps0
  114. ToProfunctorOpsU
  115. ToArrowOps0
  116. ToArrowOpsU
  117. ToCategoryOps0
  118. ToCategoryOpsU
  119. ToComposeOps0
  120. ToComposeOpsU
  121. ToBitraverseOps0
  122. ToBitraverseOpsU
  123. ToAssociativeOps0
  124. ToAssociativeOpsU
  125. ToBifunctorOps0
  126. ToBifunctorOpsU
  127. ToTraverseOps0
  128. ToTraverseOpsU
  129. ToMonadPlusOps0
  130. ToMonadPlusOpsU
  131. ToAltOps0
  132. ToAltOpsU
  133. ToApplicativePlusOps0
  134. ToApplicativePlusOpsU
  135. ToPlusOps0
  136. ToPlusOpsU
  137. ToCozipOps0
  138. ToCozipOpsU
  139. ToBifoldableOps0
  140. ToBifoldableOpsU
  141. ToComonadOps0
  142. ToComonadOpsU
  143. ToMonadOps0
  144. ToMonadOpsU
  145. ToBindOps0
  146. ToBindOpsU
  147. ToApplicativeOps0
  148. ToApplicativeOpsU
  149. ToApplyOps0
  150. ToApplyOpsU
  151. ToContravariantOps0
  152. ToContravariantOpsU
  153. ToFunctorOps0
  154. ToFunctorOpsU
  155. ToPlusEmptyOps0
  156. ToPlusEmptyOpsU
  157. ToEnumOps
  158. ToOrderOps
  159. ToShowOps
  160. ToEqualOps
  161. ToBandOps
  162. ToMonoidOps
  163. ToSemigroupOps
  164. StateFunctions
  165. IndexedStateFunctions
  166. AnyRef
  167. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Type Members

  1. type Id[X] = X

    The strict identity type constructor.

    The strict identity type constructor. Can be thought of as Tuple1, but with no runtime representation.

    Definition Classes
    IdInstances
  2. type Identity[X] = Need[X]
    Definition Classes
    IdInstances
  3. trait ApplicativeIdV[A] extends Ops[A]
    Definition Classes
    ToApplicativeOps0
  4. trait FunctorIdV[A] extends Ops[A]
    Definition Classes
    ToFunctorOps0
  5. trait LiftV[F[_], A, B] extends Ops[(A) => B]
    Definition Classes
    ToFunctorOps0
  6. final class UnzipPairOps[F[_], A, B] extends AnyRef
    Definition Classes
    ToUnzipOps0

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. val <:<: Category[<:<]
    Definition Classes
    TypeConstraintInstances
  4. final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) => B)(implicit arg0: Monoid[B]): B

    Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

    Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

    Definition Classes
    ListFunctions
  5. val =:=: Category[=:=]
    Definition Classes
    TypeConstraintInstances
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. implicit def ApplicativeIdV[A](v: => A): ApplicativeIdV[A]
    Definition Classes
    ToApplicativeOps0
  8. implicit val BigDecimalMultiplicationNewType: Monoid[@@[BigDecimal, Multiplication]]
    Definition Classes
    BigDecimalInstances
  9. implicit def MonadTransGFGA[F[_[_], _], G[_], A](gfga: G[F[G, A]]): MonadTransGFGA[F, G, A]
    Definition Classes
    ToMonadTransOps
  10. implicit def ToAlignOps[F[_], A](v: F[A])(implicit F0: Align[F]): AlignOps[F, A]
    Definition Classes
    ToAlignOps0
  11. implicit def ToAlignOpsUnapply[FA](v: FA)(implicit F0: Unapply[Align, FA]): AlignOps[M, A]
    Definition Classes
    ToAlignOpsU
  12. implicit def ToAltOps[F[_], A](v: F[A])(implicit F0: Alt[F]): AltOps[F, A]
    Definition Classes
    ToAltOps0
  13. implicit def ToAltOpsUnapply[FA](v: FA)(implicit F0: Unapply[Alt, FA]): AltOps[M, A]
    Definition Classes
    ToAltOpsU
  14. implicit def ToApplicativeErrorOps[F[_], S, A](v: F[A])(implicit F0: ApplicativeError[F, S]): ApplicativeErrorOps[F, S, A]
    Definition Classes
    ToApplicativeErrorOps0
  15. implicit def ToApplicativeOps[F[_], A](v: F[A])(implicit F0: Applicative[F]): ApplicativeOps[F, A]
    Definition Classes
    ToApplicativeOps0
  16. implicit def ToApplicativeOpsUnapply[FA](v: FA)(implicit F0: Unapply[Applicative, FA]): ApplicativeOps[M, A]
    Definition Classes
    ToApplicativeOpsU
  17. implicit def ToApplicativePlusOps[F[_], A](v: F[A])(implicit F0: ApplicativePlus[F]): ApplicativePlusOps[F, A]
    Definition Classes
    ToApplicativePlusOps0
  18. implicit def ToApplicativePlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[ApplicativePlus, FA]): ApplicativePlusOps[M, A]
    Definition Classes
    ToApplicativePlusOpsU
  19. implicit def ToApplyOps[F[_], A](v: F[A])(implicit F0: Apply[F]): ApplyOps[F, A]
    Definition Classes
    ToApplyOps0
  20. implicit def ToApplyOpsUnapply[FA](v: FA)(implicit F0: Unapply[Apply, FA]): ApplyOps[M, A]
    Definition Classes
    ToApplyOpsU
  21. implicit def ToArrowOps[F[_, _], A, B](v: F[A, B])(implicit F0: Arrow[F]): ArrowOps[F, A, B]
    Definition Classes
    ToArrowOps0
  22. implicit def ToArrowOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Arrow, FA]): ArrowOps[M, A, B]
    Definition Classes
    ToArrowOpsU
  23. implicit def ToArrowVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Arrow[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ArrowOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToArrowOps0
  24. implicit def ToAssociativeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Associative[F]): AssociativeOps[F, A, B]
    Definition Classes
    ToAssociativeOps0
  25. implicit def ToAssociativeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Associative, FA]): AssociativeOps[M, A, B]
    Definition Classes
    ToAssociativeOpsU
  26. implicit def ToAssociativeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Associative[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): AssociativeOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToAssociativeOps0
  27. implicit def ToBandOps[F](v: F)(implicit F0: Band[F]): BandOps[F]
    Definition Classes
    ToBandOps
  28. implicit def ToBifoldableOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifoldable[F]): BifoldableOps[F, A, B]
    Definition Classes
    ToBifoldableOps0
  29. implicit def ToBifoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifoldable, FA]): BifoldableOps[M, A, B]
    Definition Classes
    ToBifoldableOpsU
  30. implicit def ToBifoldableVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifoldable[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BifoldableOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToBifoldableOps0
  31. implicit def ToBifunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifunctor[F]): BifunctorOps[F, A, B]
    Definition Classes
    ToBifunctorOps0
  32. implicit def ToBifunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifunctor, FA]): BifunctorOps[M, A, B]
    Definition Classes
    ToBifunctorOpsU
  33. implicit def ToBifunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifunctor[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BifunctorOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToBifunctorOps0
  34. implicit def ToBindOps[F[_], A](v: F[A])(implicit F0: Bind[F]): BindOps[F, A]
    Definition Classes
    ToBindOps0
  35. implicit def ToBindOpsUnapply[FA](v: FA)(implicit F0: Unapply[Bind, FA]): BindOps[M, A]
    Definition Classes
    ToBindOpsU
  36. implicit def ToBitraverseOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bitraverse[F]): BitraverseOps[F, A, B]
    Definition Classes
    ToBitraverseOps0
  37. implicit def ToBitraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bitraverse, FA]): BitraverseOps[M, A, B]
    Definition Classes
    ToBitraverseOpsU
  38. implicit def ToBitraverseVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bitraverse[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BitraverseOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToBitraverseOps0
  39. implicit def ToBooleanOps2FromBoolean(a: Boolean): BooleanOps2
    Definition Classes
    ToBooleanOps
  40. implicit def ToBooleanOpsFromBoolean(a: Boolean): BooleanOps
    Definition Classes
    ToBooleanOps
  41. implicit def ToCategoryOps[F[_, _], A, B](v: F[A, B])(implicit F0: Category[F]): CategoryOps[F, A, B]
    Definition Classes
    ToCategoryOps0
  42. implicit def ToCategoryOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Category, FA]): CategoryOps[M, A, B]
    Definition Classes
    ToCategoryOpsU
  43. implicit def ToCategoryVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Category[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): CategoryOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToCategoryOps0
  44. implicit def ToChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: Choice[F]): ChoiceOps[F, A, B]
    Definition Classes
    ToChoiceOps0
  45. implicit def ToChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Choice, FA]): ChoiceOps[M, A, B]
    Definition Classes
    ToChoiceOpsU
  46. implicit def ToChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Choice[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ChoiceOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToChoiceOps0
  47. implicit def ToComonadOps[F[_], A](v: F[A])(implicit F0: Comonad[F]): ComonadOps[F, A]
    Definition Classes
    ToComonadOps0
  48. implicit def ToComonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Comonad, FA]): ComonadOps[M, A]
    Definition Classes
    ToComonadOpsU
  49. implicit def ToComposeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Compose[F]): ComposeOps[F, A, B]
    Definition Classes
    ToComposeOps0
  50. implicit def ToComposeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Compose, FA]): ComposeOps[M, A, B]
    Definition Classes
    ToComposeOpsU
  51. implicit def ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Compose[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ComposeOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToComposeOps0
  52. implicit def ToConstOps[A](a: A): ConstOps[A]
    Definition Classes
    ToConstOps
  53. implicit def ToContTOps[M[_], A](ma: M[A]): ContTOps[M, A]
    Definition Classes
    ToContTOps
  54. implicit def ToContravariantOps[F[_], A](v: F[A])(implicit F0: Contravariant[F]): ContravariantOps[F, A]
    Definition Classes
    ToContravariantOps0
  55. implicit def ToContravariantOpsUnapply[FA](v: FA)(implicit F0: Unapply[Contravariant, FA]): ContravariantOps[M, A]
    Definition Classes
    ToContravariantOpsU
  56. implicit def ToCozipOps[F[_], A](v: F[A])(implicit F0: Cozip[F]): CozipOps[F, A]
    Definition Classes
    ToCozipOps0
  57. implicit def ToCozipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cozip, FA]): CozipOps[M, A]
    Definition Classes
    ToCozipOpsU
  58. implicit def ToEitherOps[A](a: A): EitherOps[A]
    Definition Classes
    ToEitherOps
  59. implicit def ToEitherOpsFromEither[A, B](e: Either[A, B]): EitherOps[A, B]
    Definition Classes
    ToEitherOps
  60. implicit def ToEitherTOps[A](a: A): EitherTOps[A]
    Definition Classes
    ToEitherTOps
  61. implicit def ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]
    Definition Classes
    ToEnumOps
  62. implicit def ToEqualOps[F](v: F)(implicit F0: Equal[F]): EqualOps[F]
    Definition Classes
    ToEqualOps
  63. implicit def ToFoldable1Ops[F[_], A](v: F[A])(implicit F0: Foldable1[F]): Foldable1Ops[F, A]
    Definition Classes
    ToFoldable1Ops0
  64. implicit def ToFoldable1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable1, FA]): Foldable1Ops[M, A]
    Definition Classes
    ToFoldable1OpsU
  65. implicit def ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]
    Definition Classes
    ToFoldableOps0
  66. implicit def ToFoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable, FA]): FoldableOps[M, A]
    Definition Classes
    ToFoldableOpsU
  67. implicit def ToFunction1OpsFromBoolean[A, B](f: (A) => B): Function1Ops[A, B]
    Definition Classes
    ToFunction1Ops
  68. implicit def ToFunction2Ops[T1, T2, R](f: (T1, T2) => R): Function2Ops[T1, T2, R]
    Definition Classes
    ToFunction2Ops
  69. implicit def ToFunctorIdV[A](v: A): FunctorIdV[A]
    Definition Classes
    ToFunctorOps0
  70. implicit def ToFunctorOps[F[_], A](v: F[A])(implicit F0: Functor[F]): FunctorOps[F, A]
    Definition Classes
    ToFunctorOps0
  71. implicit def ToFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[Functor, FA]): FunctorOps[M, A]
    Definition Classes
    ToFunctorOpsU
  72. implicit def ToIdOps[A](a: A): IdOps[A]
    Definition Classes
    ToIdOps
  73. implicit def ToKleisliFAOps[F[_], A](fa: F[A]): KleisliFAOps[F, A]
    Definition Classes
    ToKleisliOps
  74. implicit def ToKleisliIdOps[A](a: A): KleisliIdOps[A]
    Definition Classes
    ToKleisliOps
  75. implicit def ToKleisliOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): KleisliFAOps[M, A]
    Definition Classes
    ToKleisliOps0
  76. implicit def ToLazyListOpsFromLazyList[A](a: LazyList[A]): LazyListOps[A]
    Definition Classes
    ToLazyListOps
  77. implicit def ToLeftOpsFromLeft[A, B](e: Left[A, B]): LeftOps[A, B]
    Definition Classes
    ToEitherOps
  78. implicit def ToLiftV[F[_], A, B](v: (A) => B): LiftV[F, A, B]
    Definition Classes
    ToFunctorOps0
  79. implicit def ToListOpsFromList[A](a: List[A]): ListOps[A]
    Definition Classes
    ToListOps
  80. implicit def ToMapOpsFromMap[K, V](m: Map[K, V]): MapOps[K, V]
    Definition Classes
    ToMapOps
  81. implicit def ToMaybeOps[A](a: A): MaybeOps[A]
    Definition Classes
    ToMaybeOps
  82. implicit def ToMonadErrorIdOps[E](v: E): MonadErrorIdOps[E]
    Definition Classes
    ToMonadErrorOps0
  83. implicit def ToMonadErrorOps[F[_], S, A](v: F[A])(implicit F0: MonadError[F, S]): MonadErrorOps[F, S, A]
    Definition Classes
    ToMonadErrorOps0
  84. implicit def ToMonadListenOps[F[_], A, W](v: F[A])(implicit F0: MonadListen[F, W]): MonadListenOps[F, W, A]
    Definition Classes
    ToMonadListenOps0
  85. implicit def ToMonadOps[F[_], A](v: F[A])(implicit F0: Monad[F]): MonadOps[F, A]
    Definition Classes
    ToMonadOps0
  86. implicit def ToMonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): MonadOps[M, A]
    Definition Classes
    ToMonadOpsU
  87. implicit def ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]
    Definition Classes
    ToMonadPlusOps0
  88. implicit def ToMonadPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[MonadPlus, FA]): MonadPlusOps[M, A]
    Definition Classes
    ToMonadPlusOpsU
  89. implicit def ToMonadTellOps[F[_], S, A](v: F[A])(implicit F0: MonadTell[F, S]): MonadTellOps[F, S, A]
    Definition Classes
    ToMonadTellOps0
  90. implicit def ToMonoidOps[F](v: F)(implicit F0: Monoid[F]): MonoidOps[F]
    Definition Classes
    ToMonoidOps
  91. implicit def ToNelOps[A](a: A): NelOps[A]
    Definition Classes
    ToNelOps
  92. implicit def ToOptionIdOps[A](a: A): OptionIdOps[A]
    Definition Classes
    ToOptionIdOps
  93. implicit def ToOptionOps2FromOption[A](a: Option[A]): OptionOps2[A]
    Definition Classes
    ToOptionOps
  94. implicit def ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]
    Definition Classes
    ToOptionOps
  95. implicit def ToOptionalOps[F[_], A](v: F[A])(implicit F0: Optional[F]): OptionalOps[F, A]
    Definition Classes
    ToOptionalOps0
  96. implicit def ToOptionalOpsUnapply[FA](v: FA)(implicit F0: Unapply[Optional, FA]): OptionalOps[M, A]
    Definition Classes
    ToOptionalOpsU
  97. implicit def ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]
    Definition Classes
    ToOrderOps
  98. implicit def ToPlusEmptyOps[F[_], A](v: F[A])(implicit F0: PlusEmpty[F]): PlusEmptyOps[F, A]
    Definition Classes
    ToPlusEmptyOps0
  99. implicit def ToPlusEmptyOpsUnapply[FA](v: FA)(implicit F0: Unapply[PlusEmpty, FA]): PlusEmptyOps[M, A]
    Definition Classes
    ToPlusEmptyOpsU
  100. implicit def ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]
    Definition Classes
    ToPlusOps0
  101. implicit def ToPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[Plus, FA]): PlusOps[M, A]
    Definition Classes
    ToPlusOpsU
  102. implicit def ToProChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: ProChoice[F]): ProChoiceOps[F, A, B]
    Definition Classes
    ToProChoiceOps0
  103. implicit def ToProChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[ProChoice, FA]): ProChoiceOps[M, A, B]
    Definition Classes
    ToProChoiceOpsU
  104. implicit def ToProChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: ProChoice[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ProChoiceOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToProChoiceOps0
  105. implicit def ToProfunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Profunctor[F]): ProfunctorOps[F, A, B]
    Definition Classes
    ToProfunctorOps0
  106. implicit def ToProfunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Profunctor, FA]): ProfunctorOps[M, A, B]
    Definition Classes
    ToProfunctorOpsU
  107. implicit def ToProfunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Profunctor[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ProfunctorOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToProfunctorOps0
  108. implicit def ToReducerOps[A](a: A): ReducerOps[A]
    Definition Classes
    ToReducerOps
  109. implicit def ToRightOpsFromRight[A, B](e: Right[A, B]): RightOps[A, B]
    Definition Classes
    ToEitherOps
  110. final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
    Definition Classes
    OrderingFunctions
  111. implicit def ToSemigroupOps[F](v: F)(implicit F0: Semigroup[F]): SemigroupOps[F]
    Definition Classes
    ToSemigroupOps
  112. implicit def ToShowOps[F](v: F)(implicit F0: Show[F]): ShowOps[F]
    Definition Classes
    ToShowOps
  113. implicit def ToSplitOps[F[_, _], A, B](v: F[A, B])(implicit F0: Split[F]): SplitOps[F, A, B]
    Definition Classes
    ToSplitOps0
  114. implicit def ToSplitOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Split, FA]): SplitOps[M, A, B]
    Definition Classes
    ToSplitOpsU
  115. implicit def ToSplitVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Split[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): SplitOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToSplitOps0
  116. implicit def ToStateOps[A](a: A): StateOps[A]
    Definition Classes
    ToStateOps
  117. implicit def ToStreamOpsFromStream[A](a: Stream[A]): StreamOps[A]
    Definition Classes
    ToStreamOps
  118. implicit def ToStrictTreeOps[A](a: A): StrictTreeOps[A]
    Definition Classes
    ToStrictTreeOps
  119. implicit def ToStringOpsFromString(a: String): StringOps
    Definition Classes
    ToStringOps
  120. implicit def ToStrongOps[F[_, _], A, B](v: F[A, B])(implicit F0: Strong[F]): StrongOps[F, A, B]
    Definition Classes
    ToStrongOps0
  121. implicit def ToStrongOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Strong, FA]): StrongOps[M, A, B]
    Definition Classes
    ToStrongOpsU
  122. implicit def ToStrongVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Strong[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): StrongOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToStrongOps0
  123. implicit def ToTheseOps[A](a: A): TheseOps[A]
    Definition Classes
    ToTheseOps
  124. implicit def ToThesePairOps[A, B](a: (A, B)): ThesePairOps[A, B]
    Definition Classes
    ToTheseOps
  125. implicit def ToTraverse1Ops[F[_], A](v: F[A])(implicit F0: Traverse1[F]): Traverse1Ops[F, A]
    Definition Classes
    ToTraverse1Ops0
  126. implicit def ToTraverse1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse1, FA]): Traverse1Ops[M, A]
    Definition Classes
    ToTraverse1OpsU
  127. implicit def ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]
    Definition Classes
    ToTraverseOps0
  128. implicit def ToTraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse, FA]): TraverseOps[M, A]
    Definition Classes
    ToTraverseOpsU
  129. implicit def ToTreeOps[A](a: A): TreeOps[A]
    Definition Classes
    ToTreeOps
  130. implicit def ToTryOpsFromTry[A](a: Try[A]): TryOps[A]
    Definition Classes
    ToTryOps
  131. implicit def ToTuple10Ops[A, B, C, D, E, F, G, H, I, J](t: (A, B, C, D, E, F, G, H, I, J)): Tuple10Ops[A, B, C, D, E, F, G, H, I, J]
    Definition Classes
    ToTupleOps
  132. implicit def ToTuple11Ops[A, B, C, D, E, F, G, H, I, J, K](t: (A, B, C, D, E, F, G, H, I, J, K)): Tuple11Ops[A, B, C, D, E, F, G, H, I, J, K]
    Definition Classes
    ToTupleOps
  133. implicit def ToTuple12Ops[A, B, C, D, E, F, G, H, I, J, K, L](t: (A, B, C, D, E, F, G, H, I, J, K, L)): Tuple12Ops[A, B, C, D, E, F, G, H, I, J, K, L]
    Definition Classes
    ToTupleOps
  134. implicit def ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]
    Definition Classes
    ToTupleOps
  135. implicit def ToTuple3Ops[A, B, C](t: (A, B, C)): Tuple3Ops[A, B, C]
    Definition Classes
    ToTupleOps
  136. implicit def ToTuple4Ops[A, B, C, D](t: (A, B, C, D)): Tuple4Ops[A, B, C, D]
    Definition Classes
    ToTupleOps
  137. implicit def ToTuple5Ops[A, B, C, D, E](t: (A, B, C, D, E)): Tuple5Ops[A, B, C, D, E]
    Definition Classes
    ToTupleOps
  138. implicit def ToTuple6Ops[A, B, C, D, E, F](t: (A, B, C, D, E, F)): Tuple6Ops[A, B, C, D, E, F]
    Definition Classes
    ToTupleOps
  139. implicit def ToTuple7Ops[A, B, C, D, E, F, G](t: (A, B, C, D, E, F, G)): Tuple7Ops[A, B, C, D, E, F, G]
    Definition Classes
    ToTupleOps
  140. implicit def ToTuple8Ops[A, B, C, D, E, F, G, H](t: (A, B, C, D, E, F, G, H)): Tuple8Ops[A, B, C, D, E, F, G, H]
    Definition Classes
    ToTupleOps
  141. implicit def ToTuple9Ops[A, B, C, D, E, F, G, H, I](t: (A, B, C, D, E, F, G, H, I)): Tuple9Ops[A, B, C, D, E, F, G, H, I]
    Definition Classes
    ToTupleOps
  142. implicit def ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]
    Definition Classes
    ToUnzipOps0
  143. implicit def ToUnzipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Unzip, FA]): UnzipOps[M, A]
    Definition Classes
    ToUnzipOpsU
  144. implicit def ToUnzipPairOps[F[_], A, B](v: F[(A, B)])(implicit F0: Unzip[F]): UnzipPairOps[F, A, B]
    Definition Classes
    ToUnzipOps0
  145. implicit def ToValidationOps[A](a: A): ValidationOps[A]
    Definition Classes
    ToValidationOps
  146. implicit def ToVectorOpsFromVector[A](a: Vector[A]): VectorOps[A]
    Definition Classes
    ToVectorOps
  147. implicit def ToWriterOps[A](a: A): WriterOps[A]
    Definition Classes
    ToWriterOps
  148. implicit def ToZipOps[F[_], A](v: F[A])(implicit F0: Zip[F]): ZipOps[F, A]
    Definition Classes
    ToZipOps0
  149. implicit def ToZipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Zip, FA]): ZipOps[M, A]
    Definition Classes
    ToZipOpsU
  150. def ^[F[_], A, B, C](fa: => F[A], fb: => F[B])(f: (A, B) => C)(implicit F: Apply[F]): F[C]
    Definition Classes
    ToApplyOps0
  151. def ^^[F[_], A, B, C, D](fa: => F[A], fb: => F[B], fc: => F[C])(f: (A, B, C) => D)(implicit F: Apply[F]): F[D]
    Definition Classes
    ToApplyOps0
  152. def ^^^[F[_], A, B, C, D, E](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D])(f: (A, B, C, D) => E)(implicit F: Apply[F]): F[E]
    Definition Classes
    ToApplyOps0
  153. def ^^^^[F[_], A, B, C, D, E, I](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E])(f: (A, B, C, D, E) => I)(implicit F: Apply[F]): F[I]
    Definition Classes
    ToApplyOps0
  154. def ^^^^^[F[_], A, B, C, D, E, I, J](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I])(f: (A, B, C, D, E, I) => J)(implicit F: Apply[F]): F[J]
    Definition Classes
    ToApplyOps0
  155. def ^^^^^^[F[_], A, B, C, D, E, I, J, K](fa: => F[A], fb: => F[B], fc: => F[C], fd: => F[D], fe: => F[E], fi: => F[I], fj: => F[J])(f: (A, B, C, D, E, I, J) => K)(implicit F: Apply[F]): F[K]
    Definition Classes
    ToApplyOps0
  156. final def adjacentPairs[A](as: List[A]): List[(A, A)]

    [(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

    [(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

    Definition Classes
    ListFunctions
  157. final def allPairs[A](as: List[A]): List[(A, A)]

    Combinations of as and as, excluding same-element pairs.

    Combinations of as and as, excluding same-element pairs.

    Definition Classes
    ListFunctions
  158. final def alter[K, A](m: SortedMap[K, A], k: K)(f: (Option[A]) => Option[A]): SortedMap[K, A]

    Vary the value of m get k.

    Vary the value of m get k.

    Definition Classes
    SortedMapFunctions
  159. final def alter[K, A](m: Map[K, A], k: K)(f: (Option[A]) => Option[A]): Map[K, A]

    Vary the value of m get k.

    Vary the value of m get k.

    Definition Classes
    MapFunctions
  160. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  161. implicit val bigDecimalInstance: Monoid[BigDecimal] with Enum[BigDecimal] with Show[BigDecimal]
    Definition Classes
    BigDecimalInstances
  162. implicit val bigIntInstance: Monoid[BigInt] with Enum[BigInt] with Show[BigInt]
    Definition Classes
    BigInts
  163. implicit val bigIntMultiplication: Monoid[@@[BigInt, Multiplication]] with Order[@@[BigInt, Multiplication]] with Show[@@[BigInt, Multiplication]]
    Definition Classes
    BigInts
  164. implicit val bigIntegerInstance: Monoid[BigInteger] with Enum[BigInteger] with Show[BigInteger]
    Definition Classes
    BigIntegerInstances
  165. implicit val bigIntegerMultiplication: Monoid[@@[BigInteger, Multiplication]] with Order[@@[BigInteger, Multiplication]] with Show[@@[BigInteger, Multiplication]]
    Definition Classes
    BigIntegerInstances
  166. implicit val booleanConjunctionNewTypeInstance: Monoid[@@[Boolean, Conjunction]] with Enum[@@[Boolean, Conjunction]] with Band[@@[Boolean, Conjunction]]
    Definition Classes
    AnyValInstances
  167. implicit val booleanDisjunctionNewTypeInstance: Monoid[@@[Boolean, Tags.Disjunction]] with Enum[@@[Boolean, Tags.Disjunction]] with Band[@@[Boolean, Tags.Disjunction]]
    Definition Classes
    AnyValInstances
  168. final def breakM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    spanM with p's complement.

    spanM with p's complement.

    Definition Classes
    ListFunctions
  169. implicit val byteInstance: Monoid[Byte] with Enum[Byte] with Show[Byte]
    Definition Classes
    AnyValInstances
  170. implicit val byteMultiplicationNewType: Monoid[@@[Byte, Multiplication]] with Enum[@@[Byte, Multiplication]]
    Definition Classes
    AnyValInstances
  171. implicit val callableMonad: Monad[Callable]
    Definition Classes
    CallableInstances
  172. implicit def callableOrder[A](implicit arg0: Order[A]): Order[Callable[A]]
    Definition Classes
    CallableInstances
  173. final def cata[A, X](oa: Option[A])(some: (A) => X, none: => X): X

    Catamorphism over the option.

    Catamorphism over the option. Returns the provided function some applied to item contained in the Option if it is defined, otherwise, the provided value none.

    Definition Classes
    OptionFunctions
  174. implicit val char: Monoid[Char] with Enum[Char] with Show[Char]
    Definition Classes
    AnyValInstances
  175. implicit val charMultiplicationNewType: Monoid[@@[Char, Multiplication]] with Enum[@@[Char, Multiplication]]
    Definition Classes
    AnyValInstances
  176. def charsNel(s: String, e: => NonEmptyList[Char]): NonEmptyList[Char]

    Constructs a non-empty list with the given string if it is not empty, otherwise, returns the second argument.

    Constructs a non-empty list with the given string if it is not empty, otherwise, returns the second argument.

    Definition Classes
    StringFunctions
  177. def charsNel(s: String): Maybe[NonEmptyList[Char]]

    Constructs a non-empty list with the value if it is not empty, otherwise, throws an error.

    Constructs a non-empty list with the value if it is not empty, otherwise, throws an error.

    Definition Classes
    StringFunctions
  178. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  179. final def conditional(p: Boolean, q: => Boolean): Boolean

    Conditional.

    Conditional.

    p q  p --> q
0 0  1
0 1  1
1 0  0
1 1  1
    Definition Classes
    BooleanFunctions
  180. final def conjunction(p: Boolean, q: => Boolean): Boolean

    Conjunction.

    Conjunction. (AND)

    p q  p ∧ q
0 0  0
0 1  0
1 0  0
1 1  1
    Definition Classes
    BooleanFunctions
  181. def constantIndexedState[S1, S2, A](a: A, s: => S2): IndexedState[S1, S2, A]
    Definition Classes
    IndexedStateFunctions
  182. def constantState[S, A](a: A, s: => S): State[S, A]
    Definition Classes
    StateFunctions
  183. implicit final def cordInterpolator(sc: StringContext): CordInterpolator
    Definition Classes
    ToShowOps
  184. final def disjunction(p: Boolean, q: => Boolean): Boolean

    Disjunction.

    Disjunction. (OR)

    p q  p ∨ q
0 0  0
0 1  1
1 0  1
1 1  1
    Definition Classes
    BooleanFunctions
  185. implicit val doubleInstance: Order[Double] with Show[Double]
    Definition Classes
    AnyValInstances
  186. implicit def eitherAssociative: Associative[Either]
    Definition Classes
    EitherInstances
  187. implicit def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]
    Definition Classes
    EitherInstances0
  188. implicit val eitherInstance: Bitraverse[Either]
    Definition Classes
    EitherInstances
  189. implicit def eitherMonad[L]: Traverse[[β$0$]Either[L, β$0$]] with MonadError[[β$1$]Either[L, β$1$], L] with BindRec[[β$2$]Either[L, β$2$]] with Cozip[[β$3$]Either[L, β$3$]] with Optional[[β$4$]Either[L, β$4$]]

    Right biased monad

    Right biased monad

    Definition Classes
    EitherInstances
  190. implicit def eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]
    Definition Classes
    EitherInstances
  191. implicit def eitherShow[A, B](implicit SA: Show[A], SB: Show[B]): Show[Either[A, B]]
    Definition Classes
    EitherInstances
  192. final def emptyOrPoint[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

    Returns the value a lifted into the context M if cond is false, otherwise, the empty value for M.

    Returns the value a lifted into the context M if cond is false, otherwise, the empty value for M.

    Definition Classes
    BooleanFunctions
  193. final def emptyOrPointNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]

    emptyOrPoint curried into a natural transformation.

    emptyOrPoint curried into a natural transformation.

    Definition Classes
    BooleanFunctions
  194. implicit def enumInstance[E <: java.lang.Enum[E]]: Equal[E]
    Definition Classes
    EnumInstances
  195. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  196. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  197. final def filterM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]
    Definition Classes
    ListFunctions
  198. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  199. final def findM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[Maybe[A]]

    Run p(a)s left-to-right until it yields a true value, answering Maybe.Just(that), or Maybe.empty if nothing matched p.

    Run p(a)s left-to-right until it yields a true value, answering Maybe.Just(that), or Maybe.empty if nothing matched p.

    Definition Classes
    ListFunctions
  200. final def fix[A](f: (=> A) => A): A

    f(f(f(... for referentially transparent f.

    f(f(f(... for referentially transparent f.

    Definition Classes
    FunctionFunctions
    Since

    7.0.1

  201. implicit val floatInstance: Order[Float] with Show[Float]
    Definition Classes
    AnyValInstances
  202. final def fold[A](cond: Boolean, t: => A, f: => A): A

    returns

    t if cond is true, f otherwise

    Definition Classes
    BooleanFunctions
  203. final def fold[A, X](oa: Option[A])(some: (A) => X, none: => X): X

    Alias for cata

    Alias for cata

    Definition Classes
    OptionFunctions
  204. final def foldLift[F[_], A, B](oa: Option[A])(b: => B, k: (F[A]) => B)(implicit p: Applicative[F]): B

    Returns the given value if None, otherwise lifts the Some value and passes it to the given function.

    Returns the given value if None, otherwise lifts the Some value and passes it to the given function.

    Definition Classes
    OptionFunctions
  205. final def foldLiftOpt[A, B](oa: Option[A])(b: => B, k: (Option[A]) => B): B

    Returns the given value if None, otherwise lifts the Some value to Option and passes it to the given function.

    Returns the given value if None, otherwise lifts the Some value to Option and passes it to the given function.

    Definition Classes
    OptionFunctions
  206. implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() => R]
    Definition Classes
    FunctionInstances
  207. implicit val function0Instance: Traverse[Function0] with Monad[Function0] with BindRec[Function0] with Comonad[Function0] with Distributive[Function0]
    Definition Classes
    FunctionInstances
  208. implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[β$0$](A) => β$0$]
    Definition Classes
    FunctionInstances1
  209. implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[β$1$](A) => β$1$]
    Definition Classes
    FunctionInstances0
  210. implicit def function1Contravariant[R]: Contravariant[[α$22$](α$22$) => R]
    Definition Classes
    FunctionInstances
  211. implicit def function1Covariant[T]: Monad[[β$12$](T) => β$12$] with BindRec[[β$13$](T) => β$13$] with Zip[[β$14$](T) => β$14$] with Unzip[[β$15$](T) => β$15$] with Distributive[[β$16$](T) => β$16$]
    Definition Classes
    FunctionInstances
  212. implicit def function1CovariantByName[T]: Monad[[β$2$](=> T) => β$2$] with BindRec[[β$3$](=> T) => β$3$] with Zip[[β$4$](=> T) => β$4$] with Unzip[[β$5$](=> T) => β$5$] with Distributive[[β$6$](=> T) => β$6$]
    Definition Classes
    FunctionInstances0
  213. implicit val function1Instance: Arrow[Function1] with Choice[Function1] with ProChoice[Function1]
    Definition Classes
    FunctionInstances
  214. implicit def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[(A) => R]
    Definition Classes
    FunctionInstances0
  215. implicit def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[(A) => R]
    Definition Classes
    FunctionInstances1
  216. implicit def function2Instance[T1, T2]: Monad[[γ$24$](T1, T2) => γ$24$] with BindRec[[γ$25$](T1, T2) => γ$25$]
    Definition Classes
    FunctionInstances
  217. implicit def function3Instance[T1, T2, T3]: Monad[[δ$28$](T1, T2, T3) => δ$28$] with BindRec[[δ$29$](T1, T2, T3) => δ$29$]
    Definition Classes
    FunctionInstances
  218. implicit def function4Instance[T1, T2, T3, T4]: Monad[[ε$32$](T1, T2, T3, T4) => ε$32$] with BindRec[[ε$33$](T1, T2, T3, T4) => ε$33$]
    Definition Classes
    FunctionInstances
  219. implicit def function5Instance[T1, T2, T3, T4, T5]: Monad[[ζ$36$](T1, T2, T3, T4, T5) => ζ$36$] with BindRec[[ζ$37$](T1, T2, T3, T4, T5) => ζ$37$]
    Definition Classes
    FunctionInstances
  220. implicit def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[η$40$](T1, T2, T3, T4, T5, T6) => η$40$] with BindRec[[η$41$](T1, T2, T3, T4, T5, T6) => η$41$]
    Definition Classes
    FunctionInstances
  221. implicit def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[θ$44$](T1, T2, T3, T4, T5, T6, T7) => θ$44$] with BindRec[[θ$45$](T1, T2, T3, T4, T5, T6, T7) => θ$45$]
    Definition Classes
    FunctionInstances
  222. implicit def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[ι$48$](T1, T2, T3, T4, T5, T6, T7, T8) => ι$48$] with BindRec[[ι$49$](T1, T2, T3, T4, T5, T6, T7, T8) => ι$49$]
    Definition Classes
    FunctionInstances
  223. implicit def futureInstance(implicit ec: ExecutionContext): Nondeterminism[Future] with Cobind[Future] with MonadError[Future, Throwable]
    Definition Classes
    FutureInstances1
  224. implicit def futureMonoid[A](implicit g: Monoid[A], ec: ExecutionContext): Monoid[Future[A]]
    Definition Classes
    FutureInstances
  225. implicit def futureSemigroup[A](implicit m: Semigroup[A], ec: ExecutionContext): Semigroup[Future[A]]
    Definition Classes
    FutureInstances1
  226. def get[S]: State[S, S]
    Definition Classes
    StateFunctions
  227. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  228. final def getOrAdd[F[_], K, A](m: SortedMap[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(SortedMap[K, A], A)]

    Grab a value out of SortedMap if it's present.

    Grab a value out of SortedMap if it's present. Otherwise evaluate a value to be placed at that key in the SortedMap.

    Definition Classes
    SortedMapFunctions
  229. final def getOrAdd[F[_], K, A](m: Map[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(Map[K, A], A)]

    Grab a value out of Map if it's present.

    Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.

    Definition Classes
    MapFunctions
  230. final def getOrElseF[A, F[_]](oa: Option[A])(fa: => F[A])(implicit arg0: Applicative[F]): F[A]

    Returns the item contained in the Option wrapped in type F if the Option is defined, otherwise, returns the supplied action.

    Returns the item contained in the Option wrapped in type F if the Option is defined, otherwise, returns the supplied action.

    Definition Classes
    OptionFunctions
  231. def gets[S, T](f: (S) => T): State[S, T]
    Definition Classes
    StateFunctions
  232. final def groupBy1[A, B](as: List[A])(f: (A) => B): Map[B, NonEmptyList[A]]

    As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty

    As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty

    Definition Classes
    ListFunctions
  233. final def groupWhen[A](as: List[A])(p: (A, A) => Boolean): List[NonEmptyList[A]]

    groupWhenM specialized to scalaz.Id.Id.

    groupWhenM specialized to scalaz.Id.Id.

    Definition Classes
    ListFunctions
  234. final def groupWhenM[A, M[_]](as: List[A])(p: (A, A) => M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]

    Split at each point where p(as(n), as(n+1)) yields false.

    Split at each point where p(as(n), as(n+1)) yields false.

    Definition Classes
    ListFunctions
  235. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  236. final def heads[A](as: LazyList[A]): LazyList[LazyList[A]]

    [as take 1, as take 2, ..., as]

    [as take 1, as take 2, ..., as]

    Definition Classes
    LazyListFunctions
  237. def iModify[S1, S2](f: (S1) => S2): IndexedState[S1, S2, Unit]
    Definition Classes
    IndexedStateFunctions
  238. def iPut[S1, S2](s: S2): IndexedState[S1, S2, Unit]
    Definition Classes
    IndexedStateFunctions
  239. val id: Traverse1[Id] with Monad[Id] with BindRec[Id] with Comonad[Id] with Distributive[Id] with Zip[Id] with Unzip[Id] with Align[Id] with Cozip[Id] with Optional[Id]
    Definition Classes
    IdInstances
  240. def init[S]: State[S, S]
    Definition Classes
    StateFunctions
  241. final def initz[A](as: List[A]): List[List[A]]

    [Nil, as take 1, as take 2, ..., as]

    [Nil, as take 1, as take 2, ..., as]

    Definition Classes
    ListFunctions
  242. final def insertWith[K, A](m1: SortedMap[K, A], k: K, v: A)(f: (A, A) => A): SortedMap[K, A]

    As with SortedMap.updated, but resolve a collision with f.

    As with SortedMap.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

    Definition Classes
    SortedMapFunctions
  243. final def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) => A): Map[K, A]

    As with Map.updated, but resolve a collision with f.

    As with Map.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

    Definition Classes
    MapFunctions
  244. implicit val intInstance: Monoid[Int] with Enum[Int] with Show[Int]
    Definition Classes
    AnyValInstances
  245. implicit val intMultiplicationNewType: Monoid[@@[Int, Multiplication]] with Enum[@@[Int, Multiplication]]
    Definition Classes
    AnyValInstances
  246. final def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
    Definition Classes
    LazyListFunctions
  247. final def intersectWith[K, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (A, B) => C)(implicit arg0: scala.Ordering[K]): SortedMap[K, C]

    Collect only elements with matching keys, joining their associated values with f.

    Collect only elements with matching keys, joining their associated values with f.

    Definition Classes
    SortedMapFunctions
  248. final def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) => C): Map[K, C]

    Collect only elements with matching keys, joining their associated values with f.

    Collect only elements with matching keys, joining their associated values with f.

    Definition Classes
    MapFunctions
  249. final def intersectWithKey[K, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (K, A, B) => C)(implicit arg0: scala.Ordering[K]): SortedMap[K, C]

    Like intersectWith, but tell f about the key.

    Like intersectWith, but tell f about the key.

    Definition Classes
    SortedMapFunctions
  250. final def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) => C): Map[K, C]

    Like intersectWith, but tell f about the key.

    Like intersectWith, but tell f about the key.

    Definition Classes
    MapFunctions
  251. final def intersperse[A](as: LazyList[A], a: A): LazyList[A]

    Intersperse the element a between each adjacent pair of elements in as

    Intersperse the element a between each adjacent pair of elements in as

    Definition Classes
    LazyListFunctions
  252. final def intersperse[A](as: List[A], a: A): List[A]

    Intersperse the element a between each adjacent pair of elements in as

    Intersperse the element a between each adjacent pair of elements in as

    Definition Classes
    ListFunctions
  253. final def inverseConditional(p: Boolean, q: => Boolean): Boolean

    Inverse Conditional.

    Inverse Conditional.

    p q  p <-- q
0 0  1
0 1  0
1 0  1
1 1  1
    Definition Classes
    BooleanFunctions
  254. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  255. implicit val javaBigDecimalInstance: Show[BigDecimal] with Equal[BigDecimal]
    Definition Classes
    BigDecimalInstances
  256. implicit def lazylistEqual[A](implicit A0: Equal[A]): Equal[LazyList[A]]
    Definition Classes
    LazyListInstances
  257. implicit val lazylistInstance: Traverse[LazyList] with MonadPlus[LazyList] with Alt[LazyList] with BindRec[LazyList] with Zip[LazyList] with Unzip[LazyList] with Align[LazyList] with IsEmpty[LazyList] with Cobind[LazyList]
    Definition Classes
    LazyListInstances
  258. implicit def lazylistMonoid[A]: Monoid[LazyList[A]]
    Definition Classes
    LazyListInstances
  259. implicit def lazylistOrder[A](implicit A0: Order[A]): Order[LazyList[A]]
    Definition Classes
    LazyListInstances
  260. implicit def lazylistShow[A](implicit A0: Show[A]): Show[LazyList[A]]
    Definition Classes
    LazyListInstances
  261. implicit val lazylistZipApplicative: Applicative[[α]TagKind.@@[LazyList[α], Tags.Zip]]

    An alternative scalaz.Applicative instance for LazyList, discriminated by the type tag scalaz.Tags.Zip, that zips lazylists together.

    An alternative scalaz.Applicative instance for LazyList, discriminated by the type tag scalaz.Tags.Zip, that zips lazylists together.

    Example:

    import scalaz.Tags.Zip
lazylistZipApplicative.apply2(Zip(LazyList(1, 2)), Zip(LazyList(3, 4)))(_ * _) // LazyList(3, 8)
    Definition Classes
    LazyListInstances
  262. implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]
    Definition Classes
    ListInstances0
  263. implicit val listInstance: Traverse[List] with MonadPlus[List] with Alt[List] with BindRec[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List]
    Definition Classes
    ListInstances
  264. implicit def listMonoid[A]: Monoid[List[A]]
    Definition Classes
    ListInstances
  265. implicit def listOrder[A](implicit A0: Order[A]): Order[List[A]]
    Definition Classes
    ListInstances
  266. implicit def listShow[A](implicit A: Show[A]): Show[List[A]]
    Definition Classes
    ListInstances
  267. implicit val longInstance: Monoid[Long] with Enum[Long] with Show[Long]
    Definition Classes
    AnyValInstances
  268. implicit val longMultiplicationNewType: Monoid[@@[Long, Multiplication]] with Enum[@@[Long, Multiplication]]
    Definition Classes
    AnyValInstances
  269. final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])

    All of the Bs, in order, and the final C acquired by a stateful left fold over as.

    All of the Bs, in order, and the final C acquired by a stateful left fold over as.

    Definition Classes
    ListFunctions
  270. final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])

    All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

    All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

    Definition Classes
    ListFunctions
  271. implicit def mapBand[K, V](implicit S: Band[V]): Band[Map[K, V]]
    Definition Classes
    MapInstances0
  272. implicit val mapEntryBitraverse: Bitraverse[Entry]
    Definition Classes
    MapInstances
  273. implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[Map[K, V]]
    Definition Classes
    MapInstances0
  274. implicit def mapFoldable[K]: Foldable[[β$1$]Map[K, β$1$]]
    Definition Classes
    MapInstances0
  275. implicit def mapInstance[K]: Traverse[[β$2$]Map[K, β$2$]] with IsEmpty[[β$3$]Map[K, β$3$]] with Bind[[β$4$]Map[K, β$4$]] with Align[[β$5$]Map[K, β$5$]]

    Covariant over the value parameter, where plus applies the Last semigroup to values.

    Covariant over the value parameter, where plus applies the Last semigroup to values.

    Definition Classes
    MapInstances
  276. final def mapKeys[K, K2, A](m: SortedMap[K, A])(f: (K) => K2)(implicit arg0: scala.Ordering[K2]): SortedMap[K2, A]

    Exchange keys of m according to f.

    Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

    Definition Classes
    SortedMapFunctions
  277. final def mapKeys[K, K2, A](m: Map[K, A])(f: (K) => K2): Map[K2, A]

    Exchange keys of m according to f.

    Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

    Definition Classes
    MapFunctions
  278. implicit def mapMonoid[K, V](implicit S: Semigroup[V]): Monoid[Map[K, V]]

    Map union monoid, unifying values with V's append.

    Map union monoid, unifying values with V's append.

    Definition Classes
    MapInstances
  279. implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[Map[K, V]]
    Definition Classes
    MapInstances
  280. implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[Map[K, V]]
    Definition Classes
    MapInstances
  281. def mempty[F[_], A](implicit F: PlusEmpty[F]): F[A]
    Definition Classes
    ToPlusEmptyOps0
  282. def modify[S](f: (S) => S): State[S, Unit]
    Definition Classes
    StateFunctions
  283. def mzero[F](implicit F: Monoid[F]): F
    Definition Classes
    ToMonoidOps
  284. final def nand(p: Boolean, q: => Boolean): Boolean

    Negation of Conjunction.

    Negation of Conjunction. (NAND)

    p q  p !&& q
0 0  1
0 1  1
1 0  1
1 1  0
    Definition Classes
    BooleanFunctions
  285. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  286. final def negConditional(p: Boolean, q: => Boolean): Boolean

    Negational of Conditional.

    Negational of Conditional.

    p q  p ⇏ q
0 0  0
0 1  0
1 0  1
1 1  0
    Definition Classes
    BooleanFunctions
  287. final def negInverseConditional(p: Boolean, q: => Boolean): Boolean

    Negation of Inverse Conditional.

    Negation of Inverse Conditional.

    p q  p <\- q
0 0  0
0 1  1
1 0  0
1 1  0
    Definition Classes
    BooleanFunctions
  288. final def nil[A]: List[A]

    scala.Nil with a sometimes more convenient type

    scala.Nil with a sometimes more convenient type

    Definition Classes
    ListFunctions
  289. final def none[A]: Option[A]

    scala.None with a sometimes more convenient type.

    scala.None with a sometimes more convenient type.

    Definition Classes
    OptionFunctions
  290. final def nor(p: Boolean, q: => Boolean): Boolean

    Negation of Disjunction.

    Negation of Disjunction. (NOR)

    p q  p !|| q
0 0  1
0 1  0
1 0  0
1 1  0
    Definition Classes
    BooleanFunctions
  291. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  292. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  293. final def option[A](cond: Boolean, a: => A): Option[A]

    Returns the given argument in Some if cond is true, None otherwise.

    Returns the given argument in Some if cond is true, None otherwise.

    Definition Classes
    BooleanFunctions
  294. implicit def optionBand[A](implicit arg0: Band[A]): Band[Option[A]]
    Definition Classes
    OptionInstances1
  295. implicit def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]
    Definition Classes
    OptionInstances0
  296. implicit def optionFirst[A]: Monoid[FirstOption[A]] with Band[FirstOption[A]]
    Definition Classes
    OptionInstances
  297. implicit def optionFirstMonad: Monad[FirstOption]
    Definition Classes
    OptionInstances
  298. implicit def optionFirstOrder[A](implicit arg0: Order[A]): Order[FirstOption[A]]
    Definition Classes
    OptionInstances
  299. implicit def optionFirstShow[A](implicit arg0: Show[A]): Show[FirstOption[A]]
    Definition Classes
    OptionInstances
  300. implicit val optionInstance: Traverse[Option] with MonadPlus[Option] with Alt[Option] with BindRec[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with Align[Option] with IsEmpty[Option] with Cobind[Option] with Optional[Option]
    Definition Classes
    OptionInstances
  301. implicit def optionLast[A]: Monoid[LastOption[A]] with Band[LastOption[A]]
    Definition Classes
    OptionInstances
  302. implicit def optionLastMonad: Monad[LastOption]
    Definition Classes
    OptionInstances
  303. implicit def optionLastOrder[A](implicit arg0: Order[A]): Order[LastOption[A]]
    Definition Classes
    OptionInstances
  304. implicit def optionLastShow[A](implicit arg0: Show[A]): Show[LastOption[A]]
    Definition Classes
    OptionInstances
  305. implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]] with Band[MaxOption[A]]
    Definition Classes
    OptionInstances
  306. implicit def optionMaxMonad: Monad[MaxOption]
    Definition Classes
    OptionInstances
  307. implicit def optionMaxOrder[A](implicit arg0: Order[A]): Order[MaxOption[A]]
    Definition Classes
    OptionInstances
  308. implicit def optionMaxShow[A](implicit arg0: Show[A]): Show[MaxOption[A]]
    Definition Classes
    OptionInstances
  309. implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]] with Band[MinOption[A]]
    Definition Classes
    OptionInstances
  310. implicit def optionMinMonad: Monad[MinOption]
    Definition Classes
    OptionInstances
  311. implicit def optionMinOrder[A](implicit arg0: Order[A]): Order[MinOption[A]]
    Definition Classes
    OptionInstances
  312. implicit def optionMinShow[A](implicit arg0: Show[A]): Show[MinOption[A]]
    Definition Classes
    OptionInstances
  313. implicit def optionMonoid[A](implicit arg0: Semigroup[A]): Monoid[Option[A]]
    Definition Classes
    OptionInstances
  314. implicit def optionOrder[A](implicit A0: Order[A]): Order[Option[A]]

    Add None as an element less than all As.

    Add None as an element less than all As.

    Definition Classes
    OptionInstances
  315. implicit def optionSemiLattice[A](implicit arg0: SemiLattice[A]): SemiLattice[Option[A]]
    Definition Classes
    OptionInstances0
  316. implicit def optionShow[A](implicit arg0: Show[A]): Show[Option[A]]
    Definition Classes
    OptionInstances
  317. final def orEmpty[A, M[_]](oa: Option[A])(implicit arg0: Applicative[M], arg1: PlusEmpty[M]): M[A]

    Returns the item contained in the Option wrapped in type M if the Option is defined, otherwise, the empty value for type M.

    Returns the item contained in the Option wrapped in type M if the Option is defined, otherwise, the empty value for type M.

    Definition Classes
    OptionFunctions
  318. def orderingMonoid[A]: Monoid[scala.math.Ordering[A]]
    Definition Classes
    OrderingInstances
  319. def parseBigDecimal(s: String): Validation[String, BigDecimal]
    Definition Classes
    StringFunctions
  320. def parseBigInt(s: String): Validation[String, BigInteger]
    Definition Classes
    StringFunctions
  321. def parseBoolean(s: String): Validation[String, Boolean]
    Definition Classes
    StringFunctions
  322. def parseByte(s: String): Validation[String, Byte]
    Definition Classes
    StringFunctions
  323. def parseDouble(s: String): Validation[String, Double]
    Definition Classes
    StringFunctions
  324. def parseFloat(s: String): Validation[String, Float]
    Definition Classes
    StringFunctions
  325. def parseInt(s: String): Validation[String, Int]
    Definition Classes
    StringFunctions
  326. def parseLong(s: String): Validation[String, Long]
    Definition Classes
    StringFunctions
  327. def parseShort(s: String): Validation[String, Short]
    Definition Classes
    StringFunctions
  328. implicit val partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]
    Definition Classes
    PartialFunctionInstances
  329. final def partitionM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]

    A pair of passing and failing values of as against p.

    A pair of passing and failing values of as against p.

    Definition Classes
    ListFunctions
  330. def plural(s: String, n: Long): String

    Returns the same String value if the given value is 1 otherwise pluralises this String by appending an "s" unless this String ends with "y" and not one of ["ay", "ey", "iy", "oy", "uy"] in which case the 'y' character is chopped and "ies" is appended.

    Returns the same String value if the given value is 1 otherwise pluralises this String by appending an "s" unless this String ends with "y" and not one of ["ay", "ey", "iy", "oy", "uy"] in which case the 'y' character is chopped and "ies" is appended.

    Definition Classes
    StringFunctions
  331. final def pointOrEmpty[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

    Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.

    Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.

    Definition Classes
    BooleanFunctions
  332. final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]

    pointOrEmpty curried into a natural transformation.

    pointOrEmpty curried into a natural transformation.

    Definition Classes
    BooleanFunctions
  333. final def powerset[A](as: List[A]): List[List[A]]
    Definition Classes
    ListFunctions
  334. def put[S](s: S): State[S, Unit]
    Definition Classes
    StateFunctions
  335. implicit val setInstance: Foldable[Set] with IsEmpty[Set]
    Definition Classes
    SetInstances
  336. implicit def setMonoid[A]: Monoid[Set[A]] with SemiLattice[Set[A]]
    Definition Classes
    SetInstances
  337. implicit def setOrder[A](implicit arg0: Order[A]): Order[Set[A]]

    We could derive set equality from Equal[A], but it would be O(n^2). Instead, we require Order[A], reducing the complexity to O(log n)

    We could derive set equality from Equal[A], but it would be O(n^2). Instead, we require Order[A], reducing the complexity to O(log n)

    If Equal[A].equalIsNatural == true, than Any#== is used.

    Definition Classes
    SetInstances
  338. implicit def setShow[A](implicit A: Show[A]): Show[Set[A]]
    Definition Classes
    SetInstances
  339. implicit val shortInstance: Monoid[Short] with Enum[Short] with Show[Short]
    Definition Classes
    AnyValInstances
  340. implicit val shortMultiplicationNewType: Monoid[@@[Short, Multiplication]] with Enum[@@[Short, Multiplication]]
    Definition Classes
    AnyValInstances
  341. implicit final def showInterpolator(sc: StringContext): ShowInterpolator
    Definition Classes
    ToShowOps
  342. final def some[A](a: A): Option[A]

    scala.Some.apply with a sometimes more convenient type.

    scala.Some.apply with a sometimes more convenient type.

    Definition Classes
    OptionFunctions
  343. implicit def sortedMapBand[K, V](implicit S: Band[V], K: scala.Ordering[K]): Band[SortedMap[K, V]]
    Definition Classes
    SortedMapInstances0
  344. implicit def sortedMapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[SortedMap[K, V]]
    Definition Classes
    SortedMapInstances0
  345. implicit def sortedMapFoldable[K]: Foldable[[β$1$]SortedMap[K, β$1$]]
    Definition Classes
    SortedMapInstances0
  346. implicit def sortedMapInstance[K](implicit arg0: scala.Ordering[K]): Traverse[[β$2$]SortedMap[K, β$2$]] with IsEmpty[[β$3$]SortedMap[K, β$3$]] with Bind[[β$4$]SortedMap[K, β$4$]] with Align[[β$5$]SortedMap[K, β$5$]]

    Covariant over the value parameter, where plus applies the Last semigroup to values.

    Covariant over the value parameter, where plus applies the Last semigroup to values.

    Definition Classes
    SortedMapInstances
  347. implicit def sortedMapMonoid[K, V](implicit S: Semigroup[V], K: scala.Ordering[K]): Monoid[SortedMap[K, V]]

    SortedMap union monoid, unifying values with V's append.

    SortedMap union monoid, unifying values with V's append.

    Definition Classes
    SortedMapInstances
  348. implicit def sortedMapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[SortedMap[K, V]]
    Definition Classes
    SortedMapInstances
  349. implicit def sortedMapShow[K, V](implicit K: Show[K], V: Show[V]): Show[SortedMap[K, V]]
    Definition Classes
    SortedMapInstances
  350. final def spanM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    A pair of the longest prefix of passing as against p, and the remainder.

    A pair of the longest prefix of passing as against p, and the remainder.

    Definition Classes
    ListFunctions
  351. def state[S, A](a: A): State[S, A]
    Definition Classes
    StateFunctions
  352. implicit def streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]
    Definition Classes
    StreamInstances
  353. implicit val streamInstance: Traverse[Stream] with MonadPlus[Stream] with Alt[Stream] with BindRec[Stream] with Zip[Stream] with Unzip[Stream] with Align[Stream] with IsEmpty[Stream] with Cobind[Stream]
    Definition Classes
    StreamInstances
  354. implicit def streamMonoid[A]: Monoid[Stream[A]]
    Definition Classes
    StreamInstances
  355. implicit def streamOrder[A](implicit A0: Order[A]): Order[Stream[A]]
    Definition Classes
    StreamInstances
  356. implicit def streamShow[A](implicit A0: Show[A]): Show[Stream[A]]
    Definition Classes
    StreamInstances
  357. implicit val streamZipApplicative: Applicative[[α]TagKind.@@[Stream[α], Tags.Zip]]

    An alternative scalaz.Applicative instance for Stream, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.

    An alternative scalaz.Applicative instance for Stream, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.

    Example:

    import scalaz.Tags.Zip
streamZipApplicative.apply2(Zip(Stream(1, 2)), Zip(Stream(3, 4)))(_ * _) // Stream(3, 8)
    Definition Classes
    StreamInstances
  358. implicit val stringInstance: Monoid[String] with Show[String] with Order[String] with IsEmpty[[α]String]
    Definition Classes
    StringInstances
  359. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  360. final def tailOption[A](as: List[A]): Option[List[A]]
    Definition Classes
    ListFunctions
  361. final def tails[A](as: LazyList[A]): LazyList[LazyList[A]]

    [as, as.tail, as.tail.tail, ..., LazyList(as.last)]

    [as, as.tail, as.tail.tail, ..., LazyList(as.last)]

    Definition Classes
    LazyListFunctions
  362. final def tailz[A](as: List[A]): List[List[A]]

    [as, as.tail, as.tail.tail, ..., Nil]

    [as, as.tail, as.tail.tail, ..., Nil]

    Definition Classes
    ListFunctions
  363. final def takeUntilM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Run p(a)s and collect as while p yields false.

    Run p(a)s and collect as while p yields false. Don't run any ps after the first true.

    Definition Classes
    ListFunctions
  364. final def takeWhileM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Run p(a)s and collect as while p yields true.

    Run p(a)s and collect as while p yields true. Don't run any ps after the first false.

    Definition Classes
    ListFunctions
  365. def test(p: Boolean): Int

    Returns 1 if p is true, or 0 otherwise.

    Returns 1 if p is true, or 0 otherwise.

    Definition Classes
    BooleanFunctions
  366. final def toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
    Definition Classes
    OptionFunctions
  367. final def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
    Definition Classes
    OptionFunctions
  368. final def toLeft[A, B](oa: Option[A])(b: => B): \/[A, B]
    Definition Classes
    OptionFunctions
  369. final def toMaybe[A](oa: Option[A]): Maybe[A]
    Definition Classes
    OptionFunctions
  370. final def toNel[A](as: List[A]): Maybe[NonEmptyList[A]]
    Definition Classes
    ListFunctions
  371. final def toRight[A, E](oa: Option[A])(e: => E): \/[E, A]
    Definition Classes
    OptionFunctions
  372. def toString(): String
    Definition Classes
    AnyRef → Any
  373. final def toSuccess[A, E](oa: Option[A])(e: => E): Validation[E, A]
    Definition Classes
    OptionFunctions
  374. final def toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
    Definition Classes
    OptionFunctions
  375. final def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
    Definition Classes
    LazyListFunctions
  376. final def toZipper[A](as: List[A]): Maybe[Zipper[A]]
    Definition Classes
    ListFunctions
  377. implicit def tuple1Band[A1](implicit A1: Band[A1]): Band[(A1)]
    Definition Classes
    TupleInstances2
  378. implicit val tuple1Cozip: Cozip[Tuple1]
    Definition Classes
    TupleInstances3
  379. implicit def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]
    Definition Classes
    TupleInstances2
  380. implicit val tuple1Instance: Traverse[Tuple1] with Monad[Tuple1] with Comonad[Tuple1]

    Tuple1[A] is isomorphic to Id[X]

    Tuple1[A] is isomorphic to Id[X]

    Definition Classes
    TupleInstances2
  381. implicit def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]
    Definition Classes
    TupleInstances1
  382. implicit def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]
    Definition Classes
    TupleInstances3
  383. implicit def tuple1SemiLattice[A1](implicit A1: SemiLattice[A1]): SemiLattice[(A1)]
    Definition Classes
    TupleInstances3
  384. implicit def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]
    Definition Classes
    TupleInstances0
  385. implicit def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]
    Definition Classes
    TupleInstances3
  386. implicit val tuple2Associative: Associative[Tuple2]
    Definition Classes
    TupleInstances2
  387. implicit def tuple2Band[A1, A2](implicit A1: Band[A1], A2: Band[A2]): Band[(A1, A2)]
    Definition Classes
    TupleInstances2
  388. implicit def tuple2BindRec[A1](implicit arg0: Semigroup[A1]): BindRec[[β$9$](A1, β$9$)]

    Product BindRec

    Product BindRec

    Definition Classes
    TupleInstances2
  389. implicit val tuple2Bitraverse: Bitraverse[Tuple2]
    Definition Classes
    TupleInstances2
  390. implicit def tuple2Cozip[A1]: Cozip[[β$16$](A1, β$16$)]
    Definition Classes
    TupleInstances3
  391. implicit def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]
    Definition Classes
    TupleInstances2
  392. implicit def tuple2Instance[A1]: Traverse[[β$0$](A1, β$0$)] with Comonad[[β$1$](A1, β$1$)]

    Product functor and comonad

    Product functor and comonad

    Definition Classes
    TupleInstances1
  393. implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[β$23$](A1, β$23$)]
    Definition Classes
    TupleInstances3
  394. implicit def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]
    Definition Classes
    TupleInstances1
  395. implicit def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]
    Definition Classes
    TupleInstances3
  396. implicit def tuple2SemiLattice[A1, A2](implicit A1: SemiLattice[A1], A2: SemiLattice[A2]): SemiLattice[(A1, A2)]
    Definition Classes
    TupleInstances3
  397. implicit def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]
    Definition Classes
    TupleInstances0
  398. implicit def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]
    Definition Classes
    TupleInstances3
  399. implicit def tuple3Band[A1, A2, A3](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3]): Band[(A1, A2, A3)]
    Definition Classes
    TupleInstances2
  400. implicit def tuple3BindRec[A1, A2](implicit arg0: Semigroup[A1], arg1: Semigroup[A2]): BindRec[[γ$10$](A1, A2, γ$10$)]
    Definition Classes
    TupleInstances2
  401. implicit def tuple3Cozip[A1, A2]: Cozip[[γ$17$](A1, A2, γ$17$)]
    Definition Classes
    TupleInstances3
  402. implicit def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]
    Definition Classes
    TupleInstances2
  403. implicit def tuple3Functor[A1, A2]: Traverse[[γ$3$](A1, A2, γ$3$)]
    Definition Classes
    TupleInstances1
  404. implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[γ$24$](A1, A2, γ$24$)]
    Definition Classes
    TupleInstances3
  405. implicit def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]
    Definition Classes
    TupleInstances1
  406. implicit def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]
    Definition Classes
    TupleInstances3
  407. implicit def tuple3SemiLattice[A1, A2, A3](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3]): SemiLattice[(A1, A2, A3)]
    Definition Classes
    TupleInstances3
  408. implicit def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]
    Definition Classes
    TupleInstances0
  409. implicit def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]
    Definition Classes
    TupleInstances3
  410. implicit def tuple4Band[A1, A2, A3, A4](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4]): Band[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances2
  411. implicit def tuple4BindRec[A1, A2, A3](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3]): BindRec[[δ$11$](A1, A2, A3, δ$11$)]
    Definition Classes
    TupleInstances2
  412. implicit def tuple4Cozip[A1, A2, A3]: Cozip[[δ$18$](A1, A2, A3, δ$18$)]
    Definition Classes
    TupleInstances3
  413. implicit def tuple4Equal[A1, A2, A3, A4](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4]): Equal[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances2
  414. implicit def tuple4Functor[A1, A2, A3]: Traverse[[δ$4$](A1, A2, A3, δ$4$)]
    Definition Classes
    TupleInstances1
  415. implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[δ$25$](A1, A2, A3, δ$25$)]
    Definition Classes
    TupleInstances3
  416. implicit def tuple4Monoid[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monoid[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances1
  417. implicit def tuple4Order[A1, A2, A3, A4](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4]): Order[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances3
  418. implicit def tuple4SemiLattice[A1, A2, A3, A4](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4]): SemiLattice[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances3
  419. implicit def tuple4Semigroup[A1, A2, A3, A4](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4]): Semigroup[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances0
  420. implicit def tuple4Show[A1, A2, A3, A4](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4]): Show[(A1, A2, A3, A4)]
    Definition Classes
    TupleInstances3
  421. implicit def tuple5Band[A1, A2, A3, A4, A5](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5]): Band[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances2
  422. implicit def tuple5BindRec[A1, A2, A3, A4](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4]): BindRec[[ε$12$](A1, A2, A3, A4, ε$12$)]
    Definition Classes
    TupleInstances2
  423. implicit def tuple5Cozip[A1, A2, A3, A4]: Cozip[[ε$19$](A1, A2, A3, A4, ε$19$)]
    Definition Classes
    TupleInstances3
  424. implicit def tuple5Equal[A1, A2, A3, A4, A5](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5]): Equal[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances2
  425. implicit def tuple5Functor[A1, A2, A3, A4]: Traverse[[ε$5$](A1, A2, A3, A4, ε$5$)]
    Definition Classes
    TupleInstances1
  426. implicit def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[ε$26$](A1, A2, A3, A4, ε$26$)]
    Definition Classes
    TupleInstances3
  427. implicit def tuple5Monoid[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monoid[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances1
  428. implicit def tuple5Order[A1, A2, A3, A4, A5](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5]): Order[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances3
  429. implicit def tuple5SemiLattice[A1, A2, A3, A4, A5](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5]): SemiLattice[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances3
  430. implicit def tuple5Semigroup[A1, A2, A3, A4, A5](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5]): Semigroup[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances0
  431. implicit def tuple5Show[A1, A2, A3, A4, A5](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5]): Show[(A1, A2, A3, A4, A5)]
    Definition Classes
    TupleInstances3
  432. implicit def tuple6Band[A1, A2, A3, A4, A5, A6](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6]): Band[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances2
  433. implicit def tuple6BindRec[A1, A2, A3, A4, A5](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5]): BindRec[[ζ$13$](A1, A2, A3, A4, A5, ζ$13$)]
    Definition Classes
    TupleInstances2
  434. implicit def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[ζ$20$](A1, A2, A3, A4, A5, ζ$20$)]
    Definition Classes
    TupleInstances3
  435. implicit def tuple6Equal[A1, A2, A3, A4, A5, A6](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6]): Equal[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances2
  436. implicit def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[ζ$6$](A1, A2, A3, A4, A5, ζ$6$)]
    Definition Classes
    TupleInstances1
  437. implicit def tuple6Monad[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monad[[ζ$27$](A1, A2, A3, A4, A5, ζ$27$)]
    Definition Classes
    TupleInstances3
  438. implicit def tuple6Monoid[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monoid[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances1
  439. implicit def tuple6Order[A1, A2, A3, A4, A5, A6](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6]): Order[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances3
  440. implicit def tuple6SemiLattice[A1, A2, A3, A4, A5, A6](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6]): SemiLattice[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances3
  441. implicit def tuple6Semigroup[A1, A2, A3, A4, A5, A6](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6]): Semigroup[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances0
  442. implicit def tuple6Show[A1, A2, A3, A4, A5, A6](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6]): Show[(A1, A2, A3, A4, A5, A6)]
    Definition Classes
    TupleInstances3
  443. implicit def tuple7Band[A1, A2, A3, A4, A5, A6, A7](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6], A7: Band[A7]): Band[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances2
  444. implicit def tuple7BindRec[A1, A2, A3, A4, A5, A6](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6]): BindRec[[η$14$](A1, A2, A3, A4, A5, A6, η$14$)]
    Definition Classes
    TupleInstances2
  445. implicit def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[η$21$](A1, A2, A3, A4, A5, A6, η$21$)]
    Definition Classes
    TupleInstances3
  446. implicit def tuple7Equal[A1, A2, A3, A4, A5, A6, A7](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6], A7: Equal[A7]): Equal[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances2
  447. implicit def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[η$7$](A1, A2, A3, A4, A5, A6, η$7$)]
    Definition Classes
    TupleInstances1
  448. implicit def tuple7Monad[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monad[[η$28$](A1, A2, A3, A4, A5, A6, η$28$)]
    Definition Classes
    TupleInstances3
  449. implicit def tuple7Monoid[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monoid[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances1
  450. implicit def tuple7Order[A1, A2, A3, A4, A5, A6, A7](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6], A7: Order[A7]): Order[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances3
  451. implicit def tuple7SemiLattice[A1, A2, A3, A4, A5, A6, A7](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6], A7: SemiLattice[A7]): SemiLattice[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances3
  452. implicit def tuple7Semigroup[A1, A2, A3, A4, A5, A6, A7](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6], A7: Semigroup[A7]): Semigroup[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances0
  453. implicit def tuple7Show[A1, A2, A3, A4, A5, A6, A7](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6], A7: Show[A7]): Show[(A1, A2, A3, A4, A5, A6, A7)]
    Definition Classes
    TupleInstances3
  454. implicit def tuple8Band[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6], A7: Band[A7], A8: Band[A8]): Band[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances2
  455. implicit def tuple8BindRec[A1, A2, A3, A4, A5, A6, A7](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6], arg6: Semigroup[A7]): BindRec[[θ$15$](A1, A2, A3, A4, A5, A6, A7, θ$15$)]
    Definition Classes
    TupleInstances2
  456. implicit def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[θ$22$](A1, A2, A3, A4, A5, A6, A7, θ$22$)]
    Definition Classes
    TupleInstances3
  457. implicit def tuple8Equal[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5], A6: Equal[A6], A7: Equal[A7], A8: Equal[A8]): Equal[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances2
  458. implicit def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[θ$8$](A1, A2, A3, A4, A5, A6, A7, θ$8$)]
    Definition Classes
    TupleInstances1
  459. implicit def tuple8Monad[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monad[[θ$29$](A1, A2, A3, A4, A5, A6, A7, θ$29$)]
    Definition Classes
    TupleInstances3
  460. implicit def tuple8Monoid[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7], A8: Monoid[A8]): Monoid[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances1
  461. implicit def tuple8Order[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5], A6: Order[A6], A7: Order[A7], A8: Order[A8]): Order[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances3
  462. implicit def tuple8SemiLattice[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6], A7: SemiLattice[A7], A8: SemiLattice[A8]): SemiLattice[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances3
  463. implicit def tuple8Semigroup[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5], A6: Semigroup[A6], A7: Semigroup[A7], A8: Semigroup[A8]): Semigroup[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances0
  464. implicit def tuple8Show[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5], A6: Show[A6], A7: Show[A7], A8: Show[A8]): Show[(A1, A2, A3, A4, A5, A6, A7, A8)]
    Definition Classes
    TupleInstances3
  465. def unfold[A, B](seed: A)(f: (A) => Option[(B, A)]): LazyList[B]
    Definition Classes
    LazyListFunctions
  466. final def unfoldForest[A, B](as: LazyList[A])(f: (A) => (B, () => LazyList[A])): LazyList[Tree[B]]
    Definition Classes
    LazyListFunctions
  467. final def unfoldForestM[A, B, M[_]](as: LazyList[A])(f: (A) => M[(B, LazyList[A])])(implicit arg0: Monad[M]): M[LazyList[Tree[B]]]
    Definition Classes
    LazyListFunctions
  468. def unfoldm[A, B](seed: A)(f: (A) => Maybe[(B, A)]): LazyList[B]
    Definition Classes
    LazyListFunctions
  469. final def unionWith[K, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (A, A) => A)(implicit arg0: scala.Ordering[K]): SortedMap[K, A]

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Definition Classes
    SortedMapFunctions
    Note

    iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).

  470. final def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) => A): Map[K, A]

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

    Definition Classes
    MapFunctions
    Note

    iff f gives rise to a scalaz.Semigroup, so does unionWith(_, _)(f).

  471. final def unionWithKey[K, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (K, A, A) => A)(implicit arg0: scala.Ordering[K]): SortedMap[K, A]

    Like unionWith, but telling f about the key.

    Like unionWith, but telling f about the key.

    Definition Classes
    SortedMapFunctions
  472. final def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) => A): Map[K, A]

    Like unionWith, but telling f about the key.

    Like unionWith, but telling f about the key.

    Definition Classes
    MapFunctions
  473. implicit val unitInstance: Monoid[Unit] with Enum[Unit] with Show[Unit] with SemiLattice[Unit]
    Definition Classes
    AnyValInstances
  474. final def unless(cond: Boolean)(f: => Unit): Unit

    Executes the given side-effect if cond is false

    Executes the given side-effect if cond is false

    Definition Classes
    BooleanFunctions
  475. final def unlessM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]

    Returns the given argument if cond is false, otherwise, unit lifted into M.

    Returns the given argument if cond is false, otherwise, unit lifted into M.

    Definition Classes
    BooleanFunctions
  476. final def unlessMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]

    A version of unlessM that infers the type constructor M.

    A version of unlessM that infers the type constructor M.

    Definition Classes
    BooleanFunctions
  477. final def valueOrZero[A](cond: Boolean)(value: => A)(implicit z: Monoid[A]): A

    Returns the given argument if cond is true, otherwise, the zero element for the type of the given argument.

    Returns the given argument if cond is true, otherwise, the zero element for the type of the given argument.

    Definition Classes
    BooleanFunctions
  478. implicit def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]
    Definition Classes
    VectorInstances0
  479. implicit val vectorInstance: Traverse[Vector] with MonadPlus[Vector] with Alt[Vector] with BindRec[Vector] with Zip[Vector] with Unzip[Vector] with IsEmpty[Vector] with Align[Vector]
    Definition Classes
    VectorInstances
  480. implicit def vectorMonoid[A]: Monoid[Vector[A]]
    Definition Classes
    VectorInstances
  481. implicit def vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]
    Definition Classes
    VectorInstances
  482. implicit def vectorShow[A](implicit arg0: Show[A]): Show[Vector[A]]
    Definition Classes
    VectorInstances
  483. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  484. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  485. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  486. final def when(cond: Boolean)(f: => Unit): Unit

    Executes the given side-effect if cond is true

    Executes the given side-effect if cond is true

    Definition Classes
    BooleanFunctions
  487. final def whenM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]

    Returns the given argument if cond is true, otherwise, unit lifted into M.

    Returns the given argument if cond is true, otherwise, unit lifted into M.

    Definition Classes
    BooleanFunctions
  488. final def whenMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]

    A version of whenM that infers the type constructor M.

    A version of whenM that infers the type constructor M.

    Definition Classes
    BooleanFunctions
  489. final def zapp[A, B, C](a: LazyList[A])(f: LazyList[(A) => (B) => C]): LazyList[(B) => C]
    Definition Classes
    LazyListFunctions
  490. final def zeroOrValue[A](cond: Boolean)(value: => A)(implicit z: Monoid[A]): A

    Returns the given argument if cond is false, otherwise, the zero element for the type of the given argument.

    Returns the given argument if cond is false, otherwise, the zero element for the type of the given argument.

    Definition Classes
    BooleanFunctions
  491. final def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
    Definition Classes
    LazyListFunctions
  492. final def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
    Definition Classes
    ListFunctions
  493. def ∅[F](implicit F: Monoid[F]): F
    Definition Classes
    ToMonoidOps
  494. implicit object booleanInstance extends Enum[Boolean] with Show[Boolean]
    Definition Classes
    AnyValInstances

Inherited from IdInstances

Inherited from ToAllStdOps

Inherited from ToTryOps

Inherited from ToEitherOps

Inherited from ToMapOps

Inherited from ToTupleOps

Inherited from ToStringOps

Inherited from ToFunction1Ops

Inherited from ToFunction2Ops

Inherited from ToLazyListOps

Inherited from ToVectorOps

Inherited from ToStreamOps

Inherited from ToListOps

Inherited from ToOptionIdOps

Inherited from ToOptionOps

Inherited from ToBooleanOps

Inherited from AllFunctions

Inherited from FunctionFunctions

Inherited from StringFunctions

Inherited from OrderingFunctions

Inherited from BooleanFunctions

Inherited from LazyListFunctions

Inherited from OptionFunctions

Inherited from ListFunctions

Inherited from AllInstances

Inherited from TimeInstances

Inherited from CallableInstances

Inherited from EnumInstances

Inherited from BigIntegerInstances

Inherited from BigDecimalInstances

Inherited from std.java.util.MapInstances

Inherited from std.math.OrderingInstances

Inherited from BigInts

Inherited from BigDecimalInstances

Inherited from TypeConstraintInstances

Inherited from PartialFunctionInstances

Inherited from EitherInstances

Inherited from EitherInstances0

Inherited from FutureInstances

Inherited from FutureInstances1

Inherited from VectorInstances

Inherited from VectorInstances0

Inherited from TupleInstances

Inherited from TupleInstances3

Inherited from TupleInstances2

Inherited from TupleInstances1

Inherited from TupleInstances0

Inherited from LazyListInstances

Inherited from StreamInstances

Inherited from StringInstances

Inherited from SetInstances

Inherited from OptionInstances

Inherited from OptionInstances0

Inherited from OptionInstances1

Inherited from SortedMapInstances

Inherited from SortedMapFunctions

Inherited from SortedMapInstances0

Inherited from std.MapInstances

Inherited from MapFunctions

Inherited from std.MapInstances0

Inherited from ListInstances

Inherited from ListInstances0

Inherited from FunctionInstances

Inherited from FunctionInstances0

Inherited from FunctionInstances1

Inherited from AnyValInstances

Inherited from ToDataOps

Inherited from ToConstOps

Inherited from ToContTOps

Inherited from ToMaybeOps

Inherited from ToTheseOps

Inherited from ToNelOps

Inherited from ToEitherTOps

Inherited from ToEitherOps

Inherited from ToKleisliOps

Inherited from ToKleisliOps0

Inherited from ToValidationOps

Inherited from ToStateOps

Inherited from ToWriterOps

Inherited from ToReducerOps

Inherited from ToStrictTreeOps

Inherited from ToTreeOps

Inherited from ToIdOps

Inherited from ToTypeClassOps

Inherited from ToProChoiceOps0[ProChoice]

Inherited from ToProChoiceOpsU[ProChoice]

Inherited from ToMonadTransOps

Inherited from ToAlignOps0[Align]

Inherited from ToAlignOpsU[Align]

Inherited from ToOptionalOps0[Optional]

Inherited from ToOptionalOpsU[Optional]

Inherited from ToTraverse1Ops0[Traverse1]

Inherited from ToTraverse1OpsU[Traverse1]

Inherited from ToFoldable1Ops0[Foldable1]

Inherited from ToFoldable1OpsU[Foldable1]

Inherited from ToApplicativeErrorOps0[ApplicativeError]

Inherited from ToMonadErrorOps0[MonadError]

Inherited from ToMonadListenOps0[MonadListen]

Inherited from ToMonadTellOps0[MonadTell]

Inherited from ToUnzipOps0[Unzip]

Inherited from ToUnzipOpsU[Unzip]

Inherited from ToZipOps0[Zip]

Inherited from ToZipOpsU[Zip]

Inherited from ToSplitOps0[Split]

Inherited from ToSplitOpsU[Split]

Inherited from ToChoiceOps0[Choice]

Inherited from ToChoiceOpsU[Choice]

Inherited from ToFoldableOps0[Foldable]

Inherited from ToFoldableOpsU[Foldable]

Inherited from ToStrongOps0[Strong]

Inherited from ToStrongOpsU[Strong]

Inherited from ToProfunctorOps0[Profunctor]

Inherited from ToProfunctorOpsU[Profunctor]

Inherited from ToArrowOps0[Arrow]

Inherited from ToArrowOpsU[Arrow]

Inherited from ToCategoryOps0[Category]

Inherited from ToCategoryOpsU[Category]

Inherited from ToComposeOps0[Compose]

Inherited from ToComposeOpsU[Compose]

Inherited from ToBitraverseOps0[Bitraverse]

Inherited from ToBitraverseOpsU[Bitraverse]

Inherited from ToAssociativeOps0[Associative]

Inherited from ToAssociativeOpsU[Associative]

Inherited from ToBifunctorOps0[Bifunctor]

Inherited from ToBifunctorOpsU[Bifunctor]

Inherited from ToTraverseOps0[Traverse]

Inherited from ToTraverseOpsU[Traverse]

Inherited from ToMonadPlusOps0[MonadPlus]

Inherited from ToMonadPlusOpsU[MonadPlus]

Inherited from ToAltOps0[Alt]

Inherited from ToAltOpsU[Alt]

Inherited from ToApplicativePlusOps0[ApplicativePlus]

Inherited from ToApplicativePlusOpsU[ApplicativePlus]

Inherited from ToPlusOps0[Plus]

Inherited from ToPlusOpsU[Plus]

Inherited from ToCozipOps0[Cozip]

Inherited from ToCozipOpsU[Cozip]

Inherited from ToBifoldableOps0[Bifoldable]

Inherited from ToBifoldableOpsU[Bifoldable]

Inherited from ToComonadOps0[Comonad]

Inherited from ToComonadOpsU[Comonad]

Inherited from ToMonadOps0[Monad]

Inherited from ToMonadOpsU[Monad]

Inherited from ToBindOps0[Bind]

Inherited from ToBindOpsU[Bind]

Inherited from ToApplicativeOps0[Applicative]

Inherited from ToApplicativeOpsU[Applicative]

Inherited from ToApplyOps0[Apply]

Inherited from ToApplyOpsU[Apply]

Inherited from ToContravariantOps0[Contravariant]

Inherited from ToContravariantOpsU[Contravariant]

Inherited from ToFunctorOps0[Functor]

Inherited from ToFunctorOpsU[Functor]

Inherited from ToPlusEmptyOps0[PlusEmpty]

Inherited from ToPlusEmptyOpsU[PlusEmpty]

Inherited from ToEnumOps

Inherited from ToOrderOps

Inherited from ToShowOps

Inherited from ToEqualOps

Inherited from ToBandOps

Inherited from ToMonoidOps

Inherited from ToSemigroupOps

Inherited from StateFunctions

Inherited from IndexedStateFunctions

Inherited from AnyRef

Inherited from Any

Ungrouped