scalaz

Scalaz

Related Doc: package scalaz

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

Source
Scalaz.scala
Linear Supertypes
IdInstances, ToAllStdOps, ToEitherOps, ToMapOps, ToTupleOps, ToStringOps, ToFunction1Ops, ToFunction2Ops, ToVectorOps, ToStreamOps, ToListOps, ToOptionIdOps, ToOptionOps, ToBooleanOps, AllFunctions, FunctionFunctions, StringFunctions, std.math.OrderingFunctions, BooleanFunctions, StreamFunctions, OptionFunctions, ListFunctions, AllInstances, NodeSeqInstances, CallableInstances, EnumInstances, BigIntegerInstances, std.java.util.MapInstances, Parsers, std.math.OrderingInstances, BigInts, BigDecimalInstances, TypeConstraintInstances, PartialFunctionInstances, EitherInstances, EitherInstances0, FutureInstances, FutureInstances1, VectorInstances, VectorInstances0, TupleInstances, TupleInstances1, TupleInstances0, StreamInstances, StringInstances, SetInstances, OptionInstances, OptionInstances0, std.MapInstances, MapSubMap, MapSubInstances, MapSubFunctions, MapSubInstances0, MapSub, ListInstances, ListInstances0, FunctionInstances, FunctionInstances0, FunctionInstances1, AnyValInstances, ToDataOps, ToMaybeOps, ToTheseOps, ToNelOps, ToEitherOps, ToKleisliOps, ToKleisliOps0, ToValidationOps, ToStateOps, ToWriterOps, ToReducerOps, ToTreeOps, ToIdOps, ToTypeClassOps, ToProChoiceOps, ToProChoiceOps0, ToAlignOps, ToAlignOps0, ToCatchableOps, ToCatchableOps0, ToOptionalOps, ToOptionalOps0, ToTraverse1Ops, ToTraverse1Ops0, ToFoldable1Ops, ToFoldable1Ops0, ToMonadErrorOps, ToMonadListenOps, ToMonadListenOps0, ToMonadTellOps, ToMonadTellOps0, ToUnzipOps, ToUnzipOps0, ToZipOps, ToZipOps0, ToChoiceOps, ToChoiceOps0, ToArrowOps, ToProfunctorOps, ToProfunctorOps0, ToSplitOps, ToSplitOps0, ToArrowOps0, ToCategoryOps, ToCategoryOps0, ToComposeOps, ToComposeOps0, ToBitraverseOps, ToBitraverseOps0, ToAssociativeOps, ToAssociativeOps0, ToBifunctorOps, ToBifunctorOps0, ToTraverseOps, ToFoldableOps, ToFoldableOps0, ToTraverseOps0, ToMonadPlusOps, ToMonadPlusOps0, ToApplicativePlusOps, ToApplicativePlusOps0, ToCozipOps, ToCozipOps0, ToBifoldableOps, ToBifoldableOps0, ToComonadOps, ToCobindOps, ToCobindOps0, ToComonadOps0, ToMonadOps, ToMonadOps0, ToBindOps, ToBindOps0, ToApplicativeOps, ToApplicativeOps0, ToApplyOps, ToApplyOps0, ToContravariantOps, ToContravariantOps0, ToFunctorOps, ToInvariantFunctorOps, ToInvariantFunctorOps0, ToFunctorOps0, ToIndexOps, ToIndexOps0, ToEachOps, ToEachOps0, ToPlusEmptyOps, ToPlusOps, ToPlusOps0, ToPlusEmptyOps0, ToMetricSpaceOps, ToEnumOps, ToOrderOps, ToShowOps, ToLengthOps, ToLengthOps0, ToEqualOps, ToMonoidOps, ToSemigroupOps, StateFunctions, IndexedStateFunctions, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Scalaz
  2. IdInstances
  3. ToAllStdOps
  4. ToEitherOps
  5. ToMapOps
  6. ToTupleOps
  7. ToStringOps
  8. ToFunction1Ops
  9. ToFunction2Ops
  10. ToVectorOps
  11. ToStreamOps
  12. ToListOps
  13. ToOptionIdOps
  14. ToOptionOps
  15. ToBooleanOps
  16. AllFunctions
  17. FunctionFunctions
  18. StringFunctions
  19. OrderingFunctions
  20. BooleanFunctions
  21. StreamFunctions
  22. OptionFunctions
  23. ListFunctions
  24. AllInstances
  25. NodeSeqInstances
  26. CallableInstances
  27. EnumInstances
  28. BigIntegerInstances
  29. MapInstances
  30. Parsers
  31. OrderingInstances
  32. BigInts
  33. BigDecimalInstances
  34. TypeConstraintInstances
  35. PartialFunctionInstances
  36. EitherInstances
  37. EitherInstances0
  38. FutureInstances
  39. FutureInstances1
  40. VectorInstances
  41. VectorInstances0
  42. TupleInstances
  43. TupleInstances1
  44. TupleInstances0
  45. StreamInstances
  46. StringInstances
  47. SetInstances
  48. OptionInstances
  49. OptionInstances0
  50. MapInstances
  51. MapSubMap
  52. MapSubInstances
  53. MapSubFunctions
  54. MapSubInstances0
  55. MapSub
  56. ListInstances
  57. ListInstances0
  58. FunctionInstances
  59. FunctionInstances0
  60. FunctionInstances1
  61. AnyValInstances
  62. ToDataOps
  63. ToMaybeOps
  64. ToTheseOps
  65. ToNelOps
  66. ToEitherOps
  67. ToKleisliOps
  68. ToKleisliOps0
  69. ToValidationOps
  70. ToStateOps
  71. ToWriterOps
  72. ToReducerOps
  73. ToTreeOps
  74. ToIdOps
  75. ToTypeClassOps
  76. ToProChoiceOps
  77. ToProChoiceOps0
  78. ToAlignOps
  79. ToAlignOps0
  80. ToCatchableOps
  81. ToCatchableOps0
  82. ToOptionalOps
  83. ToOptionalOps0
  84. ToTraverse1Ops
  85. ToTraverse1Ops0
  86. ToFoldable1Ops
  87. ToFoldable1Ops0
  88. ToMonadErrorOps
  89. ToMonadListenOps
  90. ToMonadListenOps0
  91. ToMonadTellOps
  92. ToMonadTellOps0
  93. ToUnzipOps
  94. ToUnzipOps0
  95. ToZipOps
  96. ToZipOps0
  97. ToChoiceOps
  98. ToChoiceOps0
  99. ToArrowOps
  100. ToProfunctorOps
  101. ToProfunctorOps0
  102. ToSplitOps
  103. ToSplitOps0
  104. ToArrowOps0
  105. ToCategoryOps
  106. ToCategoryOps0
  107. ToComposeOps
  108. ToComposeOps0
  109. ToBitraverseOps
  110. ToBitraverseOps0
  111. ToAssociativeOps
  112. ToAssociativeOps0
  113. ToBifunctorOps
  114. ToBifunctorOps0
  115. ToTraverseOps
  116. ToFoldableOps
  117. ToFoldableOps0
  118. ToTraverseOps0
  119. ToMonadPlusOps
  120. ToMonadPlusOps0
  121. ToApplicativePlusOps
  122. ToApplicativePlusOps0
  123. ToCozipOps
  124. ToCozipOps0
  125. ToBifoldableOps
  126. ToBifoldableOps0
  127. ToComonadOps
  128. ToCobindOps
  129. ToCobindOps0
  130. ToComonadOps0
  131. ToMonadOps
  132. ToMonadOps0
  133. ToBindOps
  134. ToBindOps0
  135. ToApplicativeOps
  136. ToApplicativeOps0
  137. ToApplyOps
  138. ToApplyOps0
  139. ToContravariantOps
  140. ToContravariantOps0
  141. ToFunctorOps
  142. ToInvariantFunctorOps
  143. ToInvariantFunctorOps0
  144. ToFunctorOps0
  145. ToIndexOps
  146. ToIndexOps0
  147. ToEachOps
  148. ToEachOps0
  149. ToPlusEmptyOps
  150. ToPlusOps
  151. ToPlusOps0
  152. ToPlusEmptyOps0
  153. ToMetricSpaceOps
  154. ToEnumOps
  155. ToOrderOps
  156. ToShowOps
  157. ToLengthOps
  158. ToLengthOps0
  159. ToEqualOps
  160. ToMonoidOps
  161. ToSemigroupOps
  162. StateFunctions
  163. IndexedStateFunctions
  164. AnyRef
  165. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait ApplicativeIdV[A] extends Ops[A]

    Definition Classes
    ToApplicativeOps
  2. type BuildKeyConstraint[K] = DummyImplicit

    Evidence on key needed to construct new maps.

    Evidence on key needed to construct new maps.

    Definition Classes
    MapSubMapMapSub
  3. trait FunctorIdV[A] extends Ops[A]

    Definition Classes
    ToFunctorOps
  4. 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
  5. type Identity[+X] = Need[X]

    Definition Classes
    IdInstances
  6. trait LiftV[F[_], A, B] extends Ops[(A) ⇒ B]

    Definition Classes
    ToFunctorOps
  7. class ParsersW[P <: scala.util.parsing.combinator.Parsers] extends AnyRef

    Definition Classes
    Parsers
  8. final class UnzipPairOps[F[_], A, B] extends AnyRef

    Definition Classes
    ToUnzipOps
  9. type XMap[K, V] = Map[K, V]

    Definition Classes
    MapSubMapMapSub

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] { lazy val self: A }

    Definition Classes
    ToApplicativeOps
  8. implicit val BigDecimalMultiplicationNewType: Monoid[@@[BigDecimal, Multiplication]]

    Definition Classes
    BigDecimalInstances
  9. implicit def FirstLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[E, α]]

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    Definition Classes
    EitherInstances
  10. implicit val FirstLeftProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.LeftProjection is isomorphic to scala.Either

    scala.Either.LeftProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  11. implicit def FirstRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[α, A]]

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    Definition Classes
    EitherInstances
  12. implicit val FirstRightProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  13. implicit def LastLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[E, α]]

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    Definition Classes
    EitherInstances
  14. implicit val LastLeftProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.LeftProjection is isomorphic to scala.Either

    scala.Either.LeftProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  15. implicit def LastRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α]Either[α, A]]

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    Definition Classes
    EitherInstances
  16. implicit val LastRightProjectionIso2: Isomorphism.<~~>[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  17. implicit def LeftProjectionEIso2[E]: Isomorphism.<~>[[α]LeftProjection[E, α], [α]Either[E, α]]

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter E is partially applied.

    Definition Classes
    EitherInstances
  18. implicit val LeftProjectionIso2: Isomorphism.<~~>[LeftProjection, Either]

    scala.Either.LeftProjection is isomorphic to scala.Either

    scala.Either.LeftProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  19. implicit def RightProjectionAIso2[A]: Isomorphism.<~>[[α]RightProjection[α, A], [α]Either[α, A]]

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter A is partially applied.

    Definition Classes
    EitherInstances
  20. implicit val RightProjectionIso2: Isomorphism.<~~>[RightProjection, Either]

    scala.Either.RightProjection is isomorphic to scala.Either

    scala.Either.RightProjection is isomorphic to scala.Either

    Definition Classes
    EitherInstances
  21. implicit def ToAlignOps[F[_], A](v: F[A])(implicit F0: Align[F]): AlignOps[F, A]

    Definition Classes
    ToAlignOps
  22. implicit def ToAlignOpsUnapply[FA](v: FA)(implicit F0: Unapply[Align, FA]): AlignOps[M, A]

    Definition Classes
    ToAlignOps0
  23. implicit def ToApplicativeOps[F[_], A](v: F[A])(implicit F0: Applicative[F]): ApplicativeOps[F, A]

    Definition Classes
    ToApplicativeOps
  24. implicit def ToApplicativeOpsUnapply[FA](v: FA)(implicit F0: Unapply[Applicative, FA]): ApplicativeOps[M, A]

    Definition Classes
    ToApplicativeOps0
  25. implicit def ToApplicativePlusOps[F[_], A](v: F[A])(implicit F0: ApplicativePlus[F]): ApplicativePlusOps[F, A]

    Definition Classes
    ToApplicativePlusOps
  26. implicit def ToApplicativePlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[ApplicativePlus, FA]): ApplicativePlusOps[M, A]

    Definition Classes
    ToApplicativePlusOps0
  27. implicit def ToApplyOps[F[_], A](v: F[A])(implicit F0: Apply[F]): ApplyOps[F, A]

    Definition Classes
    ToApplyOps
  28. implicit def ToApplyOpsUnapply[FA](v: FA)(implicit F0: Unapply[Apply, FA]): ApplyOps[M, A]

    Definition Classes
    ToApplyOps0
  29. implicit def ToArrowOps[F[_, _], A, B](v: F[A, B])(implicit F0: Arrow[F]): ArrowOps[F, A, B]

    Definition Classes
    ToArrowOps
  30. implicit def ToArrowOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Arrow, FA]): ArrowOps[M, A, B]

    Definition Classes
    ToArrowOps0
  31. implicit def ToArrowVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Arrow[[α, β]F[G, α, β]]): ArrowOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToArrowOps
  32. implicit def ToAssociativeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Associative[F]): AssociativeOps[F, A, B]

    Definition Classes
    ToAssociativeOps
  33. implicit def ToAssociativeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Associative, FA]): AssociativeOps[M, A, B]

    Definition Classes
    ToAssociativeOps0
  34. implicit def ToAssociativeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Associative[[α, β]F[G, α, β]]): AssociativeOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToAssociativeOps
  35. implicit def ToBifoldableOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifoldable[F]): BifoldableOps[F, A, B]

    Definition Classes
    ToBifoldableOps
  36. implicit def ToBifoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifoldable, FA]): BifoldableOps[M, A, B]

    Definition Classes
    ToBifoldableOps0
  37. implicit def ToBifoldableVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifoldable[[α, β]F[G, α, β]]): BifoldableOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToBifoldableOps
  38. implicit def ToBifunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifunctor[F]): BifunctorOps[F, A, B]

    Definition Classes
    ToBifunctorOps
  39. implicit def ToBifunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifunctor, FA]): BifunctorOps[M, A, B]

    Definition Classes
    ToBifunctorOps0
  40. implicit def ToBifunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifunctor[[α, β]F[G, α, β]]): BifunctorOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToBifunctorOps
  41. implicit def ToBindOps[F[_], A](v: F[A])(implicit F0: Bind[F]): BindOps[F, A]

    Definition Classes
    ToBindOps
  42. implicit def ToBindOpsUnapply[FA](v: FA)(implicit F0: Unapply[Bind, FA]): BindOps[M, A]

    Definition Classes
    ToBindOps0
  43. implicit def ToBitraverseOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bitraverse[F]): BitraverseOps[F, A, B]

    Definition Classes
    ToBitraverseOps
  44. implicit def ToBitraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bitraverse, FA]): BitraverseOps[M, A, B]

    Definition Classes
    ToBitraverseOps0
  45. implicit def ToBitraverseVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bitraverse[[α, β]F[G, α, β]]): BitraverseOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToBitraverseOps
  46. implicit def ToBooleanOpsFromBoolean(a: Boolean): BooleanOps

    Definition Classes
    ToBooleanOps
  47. implicit def ToCatchableOps[F[_], A](v: F[A])(implicit F0: Catchable[F]): CatchableOps[F, A]

    Definition Classes
    ToCatchableOps
  48. implicit def ToCatchableOpsUnapply[FA](v: FA)(implicit F0: Unapply[Catchable, FA]): CatchableOps[M, A]

    Definition Classes
    ToCatchableOps0
  49. implicit def ToCategoryOps[F[_, _], A, B](v: F[A, B])(implicit F0: Category[F]): CategoryOps[F, A, B]

    Definition Classes
    ToCategoryOps
  50. implicit def ToCategoryOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Category, FA]): CategoryOps[M, A, B]

    Definition Classes
    ToCategoryOps0
  51. implicit def ToCategoryVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Category[[α, β]F[G, α, β]]): CategoryOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToCategoryOps
  52. implicit def ToChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: Choice[F]): ChoiceOps[F, A, B]

    Definition Classes
    ToChoiceOps
  53. implicit def ToChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Choice, FA]): ChoiceOps[M, A, B]

    Definition Classes
    ToChoiceOps0
  54. implicit def ToChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Choice[[α, β]F[G, α, β]]): ChoiceOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToChoiceOps
  55. implicit def ToCobindOps[F[_], A](v: F[A])(implicit F0: Cobind[F]): CobindOps[F, A]

    Definition Classes
    ToCobindOps
  56. implicit def ToCobindOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cobind, FA]): CobindOps[M, A]

    Definition Classes
    ToCobindOps0
  57. implicit def ToComonadOps[F[_], A](v: F[A])(implicit F0: Comonad[F]): ComonadOps[F, A]

    Definition Classes
    ToComonadOps
  58. implicit def ToComonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Comonad, FA]): ComonadOps[M, A]

    Definition Classes
    ToComonadOps0
  59. implicit def ToComposeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Compose[F]): ComposeOps[F, A, B]

    Definition Classes
    ToComposeOps
  60. implicit def ToComposeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Compose, FA]): ComposeOps[M, A, B]

    Definition Classes
    ToComposeOps0
  61. implicit def ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Compose[[α, β]F[G, α, β]]): ComposeOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToComposeOps
  62. implicit def ToContravariantOps[F[_], A](v: F[A])(implicit F0: Contravariant[F]): ContravariantOps[F, A]

    Definition Classes
    ToContravariantOps
  63. implicit def ToContravariantOpsUnapply[FA](v: FA)(implicit F0: Unapply[Contravariant, FA]): ContravariantOps[M, A]

    Definition Classes
    ToContravariantOps0
  64. implicit def ToCozipOps[F[_], A](v: F[A])(implicit F0: Cozip[F]): CozipOps[F, A]

    Definition Classes
    ToCozipOps
  65. implicit def ToCozipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cozip, FA]): CozipOps[M, A]

    Definition Classes
    ToCozipOps0
  66. implicit def ToEachOps[F[_], A](v: F[A])(implicit F0: Each[F]): EachOps[F, A]

    Definition Classes
    ToEachOps
  67. implicit def ToEachOpsUnapply[FA](v: FA)(implicit F0: Unapply[Each, FA]): EachOps[M, A]

    Definition Classes
    ToEachOps0
  68. implicit def ToEitherOps[A](a: A): EitherOps[A]

    Definition Classes
    ToEitherOps
  69. implicit def ToEitherOpsFromEither[A, B](e: Either[A, B]): EitherOps[A, B]

    Definition Classes
    ToEitherOps
  70. implicit def ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]

    Definition Classes
    ToEnumOps
  71. implicit def ToEqualOps[F](v: F)(implicit F0: Equal[F]): EqualOps[F]

    Definition Classes
    ToEqualOps
  72. implicit def ToFoldable1Ops[F[_], A](v: F[A])(implicit F0: Foldable1[F]): Foldable1Ops[F, A]

    Definition Classes
    ToFoldable1Ops
  73. implicit def ToFoldable1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable1, FA]): Foldable1Ops[M, A]

    Definition Classes
    ToFoldable1Ops0
  74. implicit def ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]

    Definition Classes
    ToFoldableOps
  75. implicit def ToFoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable, FA]): FoldableOps[M, A]

    Definition Classes
    ToFoldableOps0
  76. implicit def ToFunction1OpsFromBoolean[A, B](f: (A) ⇒ B): Function1Ops[A, B]

    Definition Classes
    ToFunction1Ops
  77. implicit def ToFunction2Ops[T1, T2, R](f: (T1, T2) ⇒ R): Function2Ops[T1, T2, R]

    Definition Classes
    ToFunction2Ops
  78. implicit def ToFunctorIdV[A](v: A): FunctorIdV[A]

    Definition Classes
    ToFunctorOps
  79. implicit def ToFunctorOps[F[_], A](v: F[A])(implicit F0: Functor[F]): FunctorOps[F, A]

    Definition Classes
    ToFunctorOps
  80. implicit def ToFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[Functor, FA]): FunctorOps[M, A]

    Definition Classes
    ToFunctorOps0
  81. implicit def ToIdOps[A](a: A): IdOps[A]

    Definition Classes
    ToIdOps
  82. implicit def ToIndexOps[F[_], A](v: F[A])(implicit F0: Index[F]): IndexOps[F, A]

    Definition Classes
    ToIndexOps
  83. implicit def ToIndexOpsUnapply[FA](v: FA)(implicit F0: Unapply[Index, FA]): IndexOps[M, A]

    Definition Classes
    ToIndexOps0
  84. implicit def ToInvariantFunctorOps[F[_], A](v: F[A])(implicit F0: InvariantFunctor[F]): InvariantFunctorOps[F, A]

    Definition Classes
    ToInvariantFunctorOps
  85. implicit def ToInvariantFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[InvariantFunctor, FA]): InvariantFunctorOps[M, A]

    Definition Classes
    ToInvariantFunctorOps0
  86. implicit def ToKleisliFAOps[F[_], A](fa: F[A]): KleisliFAOps[F, A]

    Definition Classes
    ToKleisliOps
  87. implicit def ToKleisliIdOps[A](a: A): KleisliIdOps[A]

    Definition Classes
    ToKleisliOps
  88. implicit def ToKleisliOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): KleisliFAOps[M, A]

    Definition Classes
    ToKleisliOps0
  89. implicit def ToLengthOps[F[_], A](v: F[A])(implicit F0: Length[F]): LengthOps[F, A]

    Definition Classes
    ToLengthOps
  90. implicit def ToLengthOpsUnapply[FA](v: FA)(implicit F0: Unapply[Length, FA]): LengthOps[M, A]

    Definition Classes
    ToLengthOps0
  91. implicit def ToLiftV[F[_], A, B](v: (A) ⇒ B): LiftV[F, A, B]

    Definition Classes
    ToFunctorOps
  92. implicit def ToListOpsFromList[A](a: List[A]): ListOps[A]

    Definition Classes
    ToListOps
  93. implicit def ToMapOpsFromMap[K, V](m: Map[K, V]): MapOps[Map, std.map.BuildKeyConstraint, K, V]

    Definition Classes
    ToMapOps
  94. implicit def ToMaybeOps[A](a: A): MaybeOps[A]

    Definition Classes
    ToMaybeOps
  95. implicit def ToMetricSpaceOps[F](v: F)(implicit F0: MetricSpace[F]): MetricSpaceOps[F]

    Definition Classes
    ToMetricSpaceOps
  96. implicit def ToMonadErrorIdOps[E](v: E): MonadErrorIdOps[E]

    Definition Classes
    ToMonadErrorOps
  97. implicit def ToMonadErrorOps[F[_, _], E, A](v: F[E, A])(implicit F: MonadError[F, E]): MonadErrorOps[F, E, A]

    Definition Classes
    ToMonadErrorOps
  98. implicit def ToMonadListenOps[F[_, _], A, W](v: F[W, A])(implicit F0: MonadListen[F, W]): MonadListenOps[F, W, A]

    Definition Classes
    ToMonadListenOps
  99. implicit def ToMonadListenOpsUnapply[FA](v: FA)(implicit F0: Unapply21[MonadListen, FA]): MonadListenOps[M, A, B]

    Definition Classes
    ToMonadListenOps0
  100. implicit def ToMonadOps[F[_], A](v: F[A])(implicit F0: Monad[F]): MonadOps[F, A]

    Definition Classes
    ToMonadOps
  101. implicit def ToMonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): MonadOps[M, A]

    Definition Classes
    ToMonadOps0
  102. implicit def ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]

    Definition Classes
    ToMonadPlusOps
  103. implicit def ToMonadPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[MonadPlus, FA]): MonadPlusOps[M, A]

    Definition Classes
    ToMonadPlusOps0
  104. implicit def ToMonadTellOps[F[_, _], A, W](v: F[W, A])(implicit F0: MonadTell[F, W]): MonadTellOps[F, W, A]

    Definition Classes
    ToMonadTellOps
  105. implicit def ToMonadTellOpsUnapply[FA](v: FA)(implicit F0: Unapply21[MonadTell, FA]): MonadTellOps[M, A, B]

    Definition Classes
    ToMonadTellOps0
  106. implicit def ToMonoidOps[F](v: F)(implicit F0: Monoid[F]): MonoidOps[F]

    Definition Classes
    ToMonoidOps
  107. implicit def ToNelOps[A](a: A): NelOps[A]

    Definition Classes
    ToNelOps
  108. implicit def ToOptionIdOps[A](a: A): OptionIdOps[A]

    Definition Classes
    ToOptionIdOps
  109. implicit def ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]

    Definition Classes
    ToOptionOps
  110. implicit def ToOptionalOps[F[_], A](v: F[A])(implicit F0: Optional[F]): OptionalOps[F, A]

    Definition Classes
    ToOptionalOps
  111. implicit def ToOptionalOpsUnapply[FA](v: FA)(implicit F0: Unapply[Optional, FA]): OptionalOps[M, A]

    Definition Classes
    ToOptionalOps0
  112. implicit def ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]

    Definition Classes
    ToOrderOps
  113. implicit def ToPlusEmptyOps[F[_], A](v: F[A])(implicit F0: PlusEmpty[F]): PlusEmptyOps[F, A]

    Definition Classes
    ToPlusEmptyOps
  114. implicit def ToPlusEmptyOpsUnapply[FA](v: FA)(implicit F0: Unapply[PlusEmpty, FA]): PlusEmptyOps[M, A]

    Definition Classes
    ToPlusEmptyOps0
  115. implicit def ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]

    Definition Classes
    ToPlusOps
  116. implicit def ToPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[Plus, FA]): PlusOps[M, A]

    Definition Classes
    ToPlusOps0
  117. implicit def ToProChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: ProChoice[F]): ProChoiceOps[F, A, B]

    Definition Classes
    ToProChoiceOps
  118. implicit def ToProChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[ProChoice, FA]): ProChoiceOps[M, A, B]

    Definition Classes
    ToProChoiceOps0
  119. implicit def ToProChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: ProChoice[[α, β]F[G, α, β]]): ProChoiceOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToProChoiceOps
  120. implicit def ToProfunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Profunctor[F]): ProfunctorOps[F, A, B]

    Definition Classes
    ToProfunctorOps
  121. implicit def ToProfunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Profunctor, FA]): ProfunctorOps[M, A, B]

    Definition Classes
    ToProfunctorOps0
  122. implicit def ToProfunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Profunctor[[α, β]F[G, α, β]]): ProfunctorOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToProfunctorOps
  123. implicit def ToReducerOps[A](a: A): ReducerOps[A]

    Definition Classes
    ToReducerOps
  124. final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]

    Definition Classes
    OrderingFunctions
  125. implicit def ToSemigroupOps[F](v: F)(implicit F0: Semigroup[F]): SemigroupOps[F]

    Definition Classes
    ToSemigroupOps
  126. implicit def ToShowOps[F](v: F)(implicit F0: Show[F]): ShowOps[F]

    Definition Classes
    ToShowOps
  127. implicit def ToSplitOps[F[_, _], A, B](v: F[A, B])(implicit F0: Split[F]): SplitOps[F, A, B]

    Definition Classes
    ToSplitOps
  128. implicit def ToSplitOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Split, FA]): SplitOps[M, A, B]

    Definition Classes
    ToSplitOps0
  129. implicit def ToSplitVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Split[[α, β]F[G, α, β]]): SplitOps[[α, β]F[G, α, β], A, B]

    Definition Classes
    ToSplitOps
  130. implicit def ToStateOps[A](a: A): StateOps[A]

    Definition Classes
    ToStateOps
  131. implicit def ToStreamOpsFromStream[A](a: Stream[A]): StreamOps[A]

    Definition Classes
    ToStreamOps
  132. implicit def ToStringOpsFromString(a: String): StringOps

    Definition Classes
    ToStringOps
  133. implicit def ToTheseOps[A](a: A): TheseOps[A]

    Definition Classes
    ToTheseOps
  134. implicit def ToThesePairOps[A, B](a: (A, B)): ThesePairOps[A, B]

    Definition Classes
    ToTheseOps
  135. implicit def ToTraverse1Ops[F[_], A](v: F[A])(implicit F0: Traverse1[F]): Traverse1Ops[F, A]

    Definition Classes
    ToTraverse1Ops
  136. implicit def ToTraverse1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse1, FA]): Traverse1Ops[M, A]

    Definition Classes
    ToTraverse1Ops0
  137. implicit def ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]

    Definition Classes
    ToTraverseOps
  138. implicit def ToTraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse, FA]): TraverseOps[M, A]

    Definition Classes
    ToTraverseOps0
  139. implicit def ToTreeOps[A](a: A): TreeOps[A]

    Definition Classes
    ToTreeOps
  140. 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
  141. 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
  142. 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
  143. implicit def ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]

    Definition Classes
    ToTupleOps
  144. implicit def ToTuple3Ops[A, B, C](t: (A, B, C)): Tuple3Ops[A, B, C]

    Definition Classes
    ToTupleOps
  145. implicit def ToTuple4Ops[A, B, C, D](t: (A, B, C, D)): Tuple4Ops[A, B, C, D]

    Definition Classes
    ToTupleOps
  146. implicit def ToTuple5Ops[A, B, C, D, E](t: (A, B, C, D, E)): Tuple5Ops[A, B, C, D, E]

    Definition Classes
    ToTupleOps
  147. 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
  148. 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
  149. 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
  150. 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
  151. implicit def ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]

    Definition Classes
    ToUnzipOps
  152. implicit def ToUnzipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Unzip, FA]): UnzipOps[M, A]

    Definition Classes
    ToUnzipOps0
  153. implicit def ToUnzipPairOps[F[_], A, B](v: F[(A, B)])(implicit F0: Unzip[F]): UnzipPairOps[F, A, B]

    Definition Classes
    ToUnzipOps
  154. implicit def ToValidationOps[A](a: A): ValidationOps[A]

    Definition Classes
    ToValidationOps
  155. implicit def ToVectorOpsFromVector[A](a: Vector[A]): IndexedSeqOps[Vector, A]

    Definition Classes
    ToVectorOps
  156. implicit def ToWriterOps[A](a: A): WriterOps[A]

    Definition Classes
    ToWriterOps
  157. implicit def ToZipOps[F[_], A](v: F[A])(implicit F0: Zip[F]): ZipOps[F, A]

    Definition Classes
    ToZipOps
  158. implicit def ToZipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Zip, FA]): ZipOps[M, A]

    Definition Classes
    ToZipOps0
  159. def ^[F[_], A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C)(implicit F: Apply[F]): F[C]

    Definition Classes
    ToApplyOps
  160. 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
    ToApplyOps
  161. 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
    ToApplyOps
  162. 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
    ToApplyOps
  163. 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
    ToApplyOps
  164. 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
    ToApplyOps
  165. final def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    How MapLike#updated might be typed in a sane world.

    How MapLike#updated might be typed in a sane world. A world that embraced higher kinds, instead of shunning them.

    Attributes
    protected
    Definition Classes
    MapSubMapMapSub
  166. final def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    As with ab_+, but with MapLike#-.

    As with ab_+, but with MapLike#-.

    Attributes
    protected
    Definition Classes
    MapSubMapMapSub
  167. 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
  168. 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
  169. final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Vary the value of m get k.

    Vary the value of m get k.

    Definition Classes
    MapSubFunctions
  170. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  171. implicit val bigDecimalInstance: Monoid[BigDecimal] with Enum[BigDecimal] with Show[BigDecimal]

    Definition Classes
    BigDecimalInstances
  172. implicit val bigIntInstance: Monoid[BigInt] with Enum[BigInt] with Show[BigInt]

    Definition Classes
    BigInts
  173. implicit val bigIntMultiplication: Monoid[@@[BigInt, Multiplication]] with Order[@@[BigInt, Multiplication]] with Show[@@[BigInt, Multiplication]]

    Definition Classes
    BigInts
  174. implicit val bigIntegerInstance: Monoid[BigInteger] with Enum[BigInteger] with Show[BigInteger]

    Definition Classes
    BigIntegerInstances
  175. implicit val bigIntegerMultiplication: Monoid[@@[BigInteger, Multiplication]] with Order[@@[BigInteger, Multiplication]] with Show[@@[BigInteger, Multiplication]]

    Definition Classes
    BigIntegerInstances
  176. implicit val booleanConjunctionNewTypeInstance: Monoid[@@[Boolean, Conjunction]] with Enum[@@[Boolean, Conjunction]]

    Definition Classes
    AnyValInstances
  177. implicit val booleanDisjunctionNewTypeInstance: Monoid[@@[Boolean, Tags.Disjunction]] with Enum[@@[Boolean, Tags.Disjunction]]

    Definition Classes
    AnyValInstances
  178. implicit object booleanInstance extends Enum[Boolean] with Show[Boolean]

    Definition Classes
    AnyValInstances
  179. 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
  180. final def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

    Attributes
    protected
    Definition Classes
    MapSubMapMapSub
  181. implicit val byteInstance: Monoid[Byte] with Enum[Byte] with Show[Byte]

    Definition Classes
    AnyValInstances
  182. implicit val byteMultiplicationNewType: Monoid[@@[Byte, Multiplication]] with Enum[@@[Byte, Multiplication]]

    Definition Classes
    AnyValInstances
  183. implicit val callableMonad: Monad[Callable]

    Definition Classes
    CallableInstances
  184. implicit def callableOrder[A](implicit arg0: Order[A]): Order[Callable[A]]

    Definition Classes
    CallableInstances
  185. 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
  186. implicit val char: Monoid[Char] with Enum[Char] with Show[Char]

    Definition Classes
    AnyValInstances
  187. implicit val charMultiplicationNewType: Monoid[@@[Char, Multiplication]] with Enum[@@[Char, Multiplication]]

    Definition Classes
    AnyValInstances
  188. 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
  189. def charsNel(s: String): Option[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
  190. def charsNelErr(s: String, message: ⇒ String): NonEmptyList[Char]

    Definition Classes
    StringFunctions
  191. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  192. 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
  193. 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
  194. def constantIndexedState[S1, S2, A](a: A, s: ⇒ S2): IndexedState[S1, S2, A]

    Definition Classes
    IndexedStateFunctions
  195. def constantState[S, A](a: A, s: ⇒ S): State[S, A]

    Definition Classes
    StateFunctions
  196. 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
  197. implicit val doubleInstance: Order[Double] with Show[Double]

    Definition Classes
    AnyValInstances
  198. implicit def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]

    Definition Classes
    EitherInstances0
  199. implicit def eitherFirstLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], First]]

    Definition Classes
    EitherInstances0
  200. implicit val eitherFirstLeftInstance: IsomorphismBifunctor[[a, b]AnyRef { ... /* 2 definitions in type refinement */ }, Either]

    Definition Classes
    EitherInstances
  201. implicit def eitherFirstLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], First]]

    Definition Classes
    EitherInstances
  202. implicit def eitherFirstLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], First]]

    Definition Classes
    EitherInstances
  203. implicit def eitherFirstLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    EitherInstances
  204. implicit def eitherFirstLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], First]]

    Definition Classes
    EitherInstances0
  205. implicit def eitherFirstRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], First]]

    Definition Classes
    EitherInstances0
  206. implicit def eitherFirstRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    EitherInstances
  207. implicit def eitherFirstRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], First]]

    Definition Classes
    EitherInstances
  208. implicit def eitherFirstRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], First]]

    Definition Classes
    EitherInstances
  209. implicit def eitherFirstRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], First]]

    Definition Classes
    EitherInstances0
  210. implicit val eitherInstance: Bitraverse[Either]

    Definition Classes
    EitherInstances
  211. implicit def eitherLastLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], Last]]

    Definition Classes
    EitherInstances0
  212. implicit def eitherLastLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], Last]]

    Definition Classes
    EitherInstances
  213. implicit def eitherLastLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], Last]]

    Definition Classes
    EitherInstances
  214. implicit def eitherLastLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    EitherInstances
  215. implicit def eitherLastLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], Last]]

    Definition Classes
    EitherInstances0
  216. implicit def eitherLastRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], Last]]

    Definition Classes
    EitherInstances0
  217. implicit def eitherLastRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    Definition Classes
    EitherInstances
  218. implicit def eitherLastRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], Last]]

    Definition Classes
    EitherInstances
  219. implicit def eitherLastRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], Last]]

    Definition Classes
    EitherInstances
  220. implicit def eitherLastRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], Last]]

    Definition Classes
    EitherInstances0
  221. implicit def eitherLeftEqual[A, X](implicit A0: Equal[A]): Equal[LeftProjection[A, X]]

    Definition Classes
    EitherInstances0
  222. implicit val eitherLeftInstance: IsomorphismBifunctor[LeftProjection, Either]

    Definition Classes
    EitherInstances
  223. implicit def eitherLeftMonoid[A, X](implicit MonoidA: Monoid[A], MonoidX: Monoid[X]): Monoid[LeftProjection[A, X]]

    Definition Classes
    EitherInstances
  224. implicit def eitherLeftOrder[A, X](implicit OrderA: Order[A]): Order[LeftProjection[A, X]]

    Definition Classes
    EitherInstances
  225. implicit def eitherLeftRInstance[R]: Monad[[α]LeftProjection[α, R]] { def point[A](a: => A): scala.util.Either.LeftProjection[A,Nothing] }

    Definition Classes
    EitherInstances
  226. implicit def eitherLeftSemigroup[A, X](implicit SemigroupA: Semigroup[A], MonoidX: Monoid[X]): Semigroup[LeftProjection[A, X]]

    Definition Classes
    EitherInstances0
  227. implicit def eitherMonad[L]: Traverse[[a]Either[L, a]] with Monad[[a]Either[L, a]] with Cozip[[a]Either[L, a]] { def point[A](a: => A): scala.util.Right[Nothing,A] }

    Right biased monad

    Right biased monad

    Definition Classes
    EitherInstances
  228. implicit def eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]

    Definition Classes
    EitherInstances
  229. implicit def eitherRightEqual[X, A](implicit A0: Equal[A]): Equal[RightProjection[X, A]]

    Definition Classes
    EitherInstances0
  230. implicit val eitherRightInstance: IsomorphismBifunctor[RightProjection, Either]

    Definition Classes
    EitherInstances
  231. implicit def eitherRightLInstance[L]: Monad[[α]RightProjection[L, α]] { def point[A](a: => A): scala.util.Either.RightProjection[Nothing,A] }

    Definition Classes
    EitherInstances
  232. implicit def eitherRightMonoid[X, A](implicit MonoidX: Monoid[X], MonoidA: Monoid[A]): Monoid[RightProjection[X, A]]

    Definition Classes
    EitherInstances
  233. implicit def eitherRightOrder[X, A](implicit OrderA: Order[A]): Order[RightProjection[X, A]]

    Definition Classes
    EitherInstances
  234. implicit def eitherRightSemigroup[X, A](implicit MonoidX: Monoid[X], SemigroupA: Semigroup[A]): Semigroup[RightProjection[X, A]]

    Definition Classes
    EitherInstances0
  235. final def emptyOrPure[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
  236. final def emptyOrPureNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]

    Definition Classes
    BooleanFunctions
  237. def encode(s: String)(implicit c: CharSet): Array[Byte]

    Encode s according to a Java character set identifier.

    Encode s according to a Java character set identifier.

    Definition Classes
    StringFunctions
  238. implicit def enumInstance[E <: java.lang.Enum[E]]: Equal[E]

    Definition Classes
    EnumInstances
  239. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  241. final def filterM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]

    Definition Classes
    ListFunctions
  242. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  243. final def findM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]

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

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

    Definition Classes
    ListFunctions
  244. 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

  245. implicit val floatInstance: Order[Float] with Show[Float]

    Definition Classes
    AnyValInstances
  246. final def fold[A](cond: Boolean, t: ⇒ A, f: ⇒ A): A

    returns

    t if cond is true, f otherwise

    Definition Classes
    BooleanFunctions
  247. final def fold[A, X](oa: Option[A])(some: (A) ⇒ X, none: ⇒ X): X

    Alias for cata

    Alias for cata

    Definition Classes
    OptionFunctions
  248. 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
  249. 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
  250. implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() ⇒ R]

    Definition Classes
    FunctionInstances
  251. implicit val function0Instance: Traverse[Function0] with Monad[Function0] with Comonad[Function0] with Distributive[Function0]

    Definition Classes
    FunctionInstances
  252. implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[α](A) ⇒ α]

    Definition Classes
    FunctionInstances1
  253. implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[α](A) ⇒ α]

    Definition Classes
    FunctionInstances0
  254. implicit def function1Contravariant[R]: Contravariant[[a](a) ⇒ R]

    Definition Classes
    FunctionInstances
  255. implicit def function1Covariant[T]: Monad[[a](T) ⇒ a] with Zip[[a](T) ⇒ a] with Unzip[[a](T) ⇒ a] with Distributive[[a](T) ⇒ a]

    Definition Classes
    FunctionInstances
  256. implicit def function1CovariantByName[T]: Monad[[a](⇒ T) ⇒ a] with Zip[[a](⇒ T) ⇒ a] with Unzip[[a](⇒ T) ⇒ a] with Distributive[[a](⇒ T) ⇒ a]

    Definition Classes
    FunctionInstances0
  257. implicit val function1Instance: Arrow[Function1] with Category[Function1] with Choice[Function1]

    Definition Classes
    FunctionInstances
  258. implicit def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[(A) ⇒ R]

    Definition Classes
    FunctionInstances0
  259. implicit def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[(A) ⇒ R]

    Definition Classes
    FunctionInstances1
  260. implicit def function2Instance[T1, T2]: Monad[[a](T1, T2) ⇒ a]

    Definition Classes
    FunctionInstances
  261. implicit def function3Instance[T1, T2, T3]: Monad[[a](T1, T2, T3) ⇒ a]

    Definition Classes
    FunctionInstances
  262. implicit def function4Instance[T1, T2, T3, T4]: Monad[[a](T1, T2, T3, T4) ⇒ a]

    Definition Classes
    FunctionInstances
  263. implicit def function5Instance[T1, T2, T3, T4, T5]: Monad[[a](T1, T2, T3, T4, T5) ⇒ a]

    Definition Classes
    FunctionInstances
  264. implicit def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[a](T1, T2, T3, T4, T5, T6) ⇒ a]

    Definition Classes
    FunctionInstances
  265. implicit def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[a](T1, T2, T3, T4, T5, T6, T7) ⇒ a]

    Definition Classes
    FunctionInstances
  266. implicit def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[a](T1, T2, T3, T4, T5, T6, T7, T8) ⇒ a]

    Definition Classes
    FunctionInstances
  267. def futureComonad(duration: Duration)(implicit executionContext: ExecutionContext): Comonad[Future]

    Requires explicit usage as the use of Await.result.

    Requires explicit usage as the use of Await.result. Can throw an exception, which is inherently bad.

    Definition Classes
    FutureInstances
  268. implicit def futureInstance(implicit ec: ExecutionContext): Monad[Future] with Cobind[Future]

    Definition Classes
    FutureInstances1
  269. implicit def futureMonoid[A](implicit g: Monoid[A], ec: ExecutionContext): Monoid[Future[A]]

    Definition Classes
    FutureInstances
  270. implicit def futureSemigroup[A](implicit m: Semigroup[A], ec: ExecutionContext): Semigroup[Future[A]]

    Definition Classes
    FutureInstances1
  271. object generic extends IndexedSeqSubVector with IndexedSeqSubInstances

    Definition Classes
    VectorInstances
  272. def get[S]: State[S, S]

    Definition Classes
    StateFunctions
  273. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  274. final def getOrAdd[F[_], K, A](m: XMap[K, A], k: K)(fa: ⇒ F[A])(implicit F: Applicative[F], K: BuildKeyConstraint[K]): F[(XMap[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
    MapSubFunctions
  275. def gets[S, T](f: (S) ⇒ T): State[S, T]

    Definition Classes
    StateFunctions
  276. 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
  277. 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
  278. 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
  279. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  280. final def heads[A](as: Stream[A]): Stream[Stream[A]]

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

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

    Definition Classes
    StreamFunctions
  281. def iModify[S1, S2](f: (S1) ⇒ S2): IndexedState[S1, S2, Unit]

    Definition Classes
    IndexedStateFunctions
  282. def iPut[S1, S2](s: S2): IndexedState[S1, S2, Unit]

    Definition Classes
    IndexedStateFunctions
  283. val id: Traverse1[Id] with Each[Id] with Monad[Id] with Comonad[Id] with Distributive[Id] with Zip[Id] with Unzip[Id] with Align[Id] with Cozip[Id]

    Definition Classes
    IdInstances
  284. def init[S]: State[S, S]

    Definition Classes
    StateFunctions
  285. 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
  286. final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[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
    MapSubFunctions
  287. implicit val intInstance: Monoid[Int] with Enum[Int] with Show[Int]

    Definition Classes
    AnyValInstances
  288. implicit val intMultiplicationNewType: Monoid[@@[Int, Multiplication]] with Enum[@@[Int, Multiplication]]

    Definition Classes
    AnyValInstances
  289. final def interleave[A](s1: Stream[A], s2: Stream[A]): Stream[A]

    Definition Classes
    StreamFunctions
  290. final def intersectWith[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[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
    MapSubFunctions
  291. final def intersectWithKey[K, A, B, C](m1: XMap[K, A], m2: XMap[K, B])(f: (K, A, B) ⇒ C)(implicit arg0: BuildKeyConstraint[K]): XMap[K, C]

    Like intersectWith, but tell f about the key.

    Like intersectWith, but tell f about the key.

    Definition Classes
    MapSubFunctions
  292. final def intersperse[A](as: Stream[A], a: A): Stream[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
    StreamFunctions
  293. 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
  294. 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
  295. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  296. implicit def lift2[F[_], A, B, C](f: (A, B) ⇒ C)(implicit F: Apply[F]): (F[A], F[B]) ⇒ F[C]

    Definition Classes
    ToApplyOps
  297. implicit def lift3[F[_], A, B, C, D](f: (A, B, C) ⇒ D)(implicit F: Apply[F]): (F[A], F[B], F[C]) ⇒ F[D]

    Definition Classes
    ToApplyOps
  298. implicit def lift4[F[_], A, B, C, D, E](f: (A, B, C, D) ⇒ E)(implicit F: Apply[F]): (F[A], F[B], F[C], F[D]) ⇒ F[E]

    Definition Classes
    ToApplyOps
  299. implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]

    Definition Classes
    ListInstances0
  300. implicit val listInstance: Traverse[List] with MonadPlus[List] with Each[List] with Index[List] with Length[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List] { def empty[A]: scala.collection.immutable.Nil.type }

    Definition Classes
    ListInstances
  301. implicit def listMonoid[A]: Monoid[List[A]]

    Definition Classes
    ListInstances
  302. implicit def listOrder[A](implicit A0: Order[A]): Order[List[A]]

    Definition Classes
    ListInstances
  303. implicit def listShow[A](implicit arg0: Show[A]): Show[List[A]]

    Definition Classes
    ListInstances
  304. implicit val longInstance: Monoid[Long] with Enum[Long] with Show[Long]

    Definition Classes
    AnyValInstances
  305. implicit val longMultiplicationNewType: Monoid[@@[Long, Multiplication]] with Enum[@@[Long, Multiplication]]

    Definition Classes
    AnyValInstances
  306. 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
  307. 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
  308. implicit val mapEntryBitraverse: Bitraverse[Entry]

    Definition Classes
    MapInstances
  309. implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[XMap[K, V]]

    Definition Classes
    MapSubInstances0
  310. implicit def mapFoldable[K]: Foldable[[V]XMap[K, V]]

    Definition Classes
    MapSubInstances0
  311. implicit def mapInstance[K](implicit arg0: BuildKeyConstraint[K]): Traverse[[V]XMap[K, V]] with IsEmpty[[V]XMap[K, V]] with Bind[[V]XMap[K, V]] with Align[[V]XMap[K, V]]

    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
    MapSubInstances
  312. final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[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
    MapSubFunctions
  313. implicit def mapMonoid[K, V](implicit arg0: BuildKeyConstraint[K], arg1: Semigroup[V]): Monoid[XMap[K, V]]

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

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

    Definition Classes
    MapSubInstances
  314. implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[XMap[K, V]]

    Definition Classes
    MapSubInstances
  315. implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[XMap[K, V]]

    Definition Classes
    MapSubInstances
  316. def mempty[F[_], A](implicit F: PlusEmpty[F]): F[A]

    Definition Classes
    ToPlusEmptyOps
  317. def modify[S](f: (S) ⇒ S): State[S, Unit]

    Definition Classes
    StateFunctions
  318. def mzero[F](implicit F: Monoid[F]): F

    Definition Classes
    ToMonoidOps
  319. 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
  320. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  321. 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
  322. 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
  323. 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
  324. implicit val nodeSeqInstance: Monoid[NodeSeq] with Show[NodeSeq] with Equal[NodeSeq]

    Definition Classes
    NodeSeqInstances
  325. 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
  326. 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
  327. final def notify(): Unit

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

    Definition Classes
    AnyRef
  329. 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
  330. implicit def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]

    Definition Classes
    OptionInstances0
  331. implicit def optionFirst[A]: Monoid[FirstOption[A]]

    Definition Classes
    OptionInstances
  332. implicit def optionFirstMonad: Monad[FirstOption]

    Definition Classes
    OptionInstances
  333. implicit def optionFirstOrder[A](implicit arg0: Order[A]): Order[FirstOption[A]]

    Definition Classes
    OptionInstances
  334. implicit def optionFirstShow[A](implicit arg0: Show[A]): Show[FirstOption[A]]

    Definition Classes
    OptionInstances
  335. implicit val optionInstance: Traverse[Option] with MonadPlus[Option] with Each[Option] with Index[Option] with Length[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with Align[Option] with IsEmpty[Option] with Cobind[Option] with Optional[Option] { ... /* 2 definitions in type refinement */ }

    Definition Classes
    OptionInstances
  336. implicit def optionLast[A]: Monoid[LastOption[A]]

    Definition Classes
    OptionInstances
  337. implicit def optionLastMonad: Monad[LastOption]

    Definition Classes
    OptionInstances
  338. implicit def optionLastOrder[A](implicit arg0: Order[A]): Order[LastOption[A]]

    Definition Classes
    OptionInstances
  339. implicit def optionLastShow[A](implicit arg0: Show[A]): Show[LastOption[A]]

    Definition Classes
    OptionInstances
  340. implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]]

    Definition Classes
    OptionInstances
  341. implicit def optionMaxMonad: Monad[MaxOption]

    Definition Classes
    OptionInstances
  342. implicit def optionMaxOrder[A](implicit arg0: Order[A]): Order[MaxOption[A]]

    Definition Classes
    OptionInstances
  343. implicit def optionMaxShow[A](implicit arg0: Show[A]): Show[MaxOption[A]]

    Definition Classes
    OptionInstances
  344. implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]]

    Definition Classes
    OptionInstances
  345. implicit def optionMinMonad: Monad[MinOption]

    Definition Classes
    OptionInstances
  346. implicit def optionMinOrder[A](implicit arg0: Order[A]): Order[MinOption[A]]

    Definition Classes
    OptionInstances
  347. implicit def optionMinShow[A](implicit arg0: Show[A]): Show[MinOption[A]]

    Definition Classes
    OptionInstances
  348. implicit def optionMonoid[A](implicit arg0: Semigroup[A]): Monoid[Option[A]]

    Definition Classes
    OptionInstances
  349. 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
  350. implicit def optionShow[A](implicit arg0: Show[A]): Show[Option[A]]

    Definition Classes
    OptionInstances
  351. 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
  352. def orderingMonoid[A]: Monoid[scala.math.Ordering[A]]

    Definition Classes
    OrderingInstances
  353. def parseBoolean(s: String): Validation[IllegalArgumentException, Boolean]

    Definition Classes
    StringFunctions
  354. def parseByte(s: String): Validation[NumberFormatException, Byte]

    Definition Classes
    StringFunctions
  355. def parseDouble(s: String): Validation[NumberFormatException, Double]

    Definition Classes
    StringFunctions
  356. def parseFloat(s: String): Validation[NumberFormatException, Float]

    Definition Classes
    StringFunctions
  357. def parseInt(s: String): Validation[NumberFormatException, Int]

    Definition Classes
    StringFunctions
  358. def parseLong(s: String): Validation[NumberFormatException, Long]

    Definition Classes
    StringFunctions
  359. def parseShort(s: String): Validation[NumberFormatException, Short]

    Definition Classes
    StringFunctions
  360. def parserMonad[P <: Parsers](p: P): Monad[[A]std.util.parsing.combinator.Parsers.parserMonad.P.Parser[A]] forSome {val _2025: ParsersW[P]}

    Definition Classes
    Parsers
  361. implicit val partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]

    Definition Classes
    PartialFunctionInstances
  362. 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
  363. 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
  364. 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
  365. final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]

    Definition Classes
    BooleanFunctions
  366. final def powerset[A](as: List[A]): List[List[A]]

    Definition Classes
    ListFunctions
  367. def put[S](s: S): State[S, Unit]

    Definition Classes
    StateFunctions
  368. implicit val setInstance: Foldable[Set] with IsEmpty[Set] with Length[Set]

    Definition Classes
    SetInstances
  369. implicit def setMonoid[A]: Monoid[Set[A]]

    Definition Classes
    SetInstances
  370. 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
  371. implicit def setShow[A](implicit arg0: Show[A]): Show[Set[A]]

    Definition Classes
    SetInstances
  372. implicit val shortInstance: Monoid[Short] with Enum[Short] with Show[Short]

    Definition Classes
    AnyValInstances
  373. implicit val shortMultiplicationNewType: Monoid[@@[Short, Multiplication]] with Enum[@@[Short, Multiplication]]

    Definition Classes
    AnyValInstances
  374. 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
  375. 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
  376. def state[S, A](a: A): State[S, A]

    Definition Classes
    StateFunctions
  377. implicit def streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]

    Definition Classes
    StreamInstances
  378. implicit val streamInstance: Traverse[Stream] with MonadPlus[Stream] with Each[Stream] with Index[Stream] with Length[Stream] with Zip[Stream] with Unzip[Stream] with Align[Stream] with IsEmpty[Stream] with Cobind[Stream]

    Definition Classes
    StreamInstances
  379. implicit def streamMonoid[A]: Monoid[Stream[A]]

    Definition Classes
    StreamInstances
  380. implicit def streamShow[A](implicit A0: Show[A]): Show[Stream[A]]

    Definition Classes
    StreamInstances
  381. implicit val streamZipApplicative: Applicative[[α]AnyRef { ... /* 2 definitions in type refinement */ }]

    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
  382. implicit object stringInstance extends Monoid[String] with Show[String] with Equal[String] with Order[String] with IsEmpty[[α]String]

    Definition Classes
    StringInstances
  383. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  384. final def tailOption[A](as: List[A]): Option[List[A]]

    Definition Classes
    ListFunctions
  385. final def tails[A](as: Stream[A]): Stream[Stream[A]]

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

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

    Definition Classes
    StreamFunctions
  386. 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
  387. 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
  388. 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
  389. 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
  390. final def toFailure[A, B](oa: Option[A])(b: ⇒ B): Validation[A, B]

    Definition Classes
    OptionFunctions
  391. final def toLeft[A, B](oa: Option[A])(b: ⇒ B): \/[A, B]

    Definition Classes
    OptionFunctions
  392. final def toMaybe[A](oa: Option[A]): Maybe[A]

    Definition Classes
    OptionFunctions
  393. final def toNel[A](as: List[A]): Option[NonEmptyList[A]]

    Definition Classes
    ListFunctions
  394. final def toRight[A, E](oa: Option[A])(e: ⇒ E): \/[E, A]

    Definition Classes
    OptionFunctions
  395. def toString(): String

    Definition Classes
    AnyRef → Any
  396. final def toSuccess[A, E](oa: Option[A])(e: ⇒ E): Validation[E, A]

    Definition Classes
    OptionFunctions
  397. final def toZipper[A](as: Stream[A]): Option[Zipper[A]]

    Definition Classes
    StreamFunctions
  398. final def toZipper[A](as: List[A]): Option[Zipper[A]]

    Definition Classes
    ListFunctions
  399. implicit val tuple1Cozip: Cozip[Tuple1]

    Definition Classes
    TupleInstances1
  400. implicit def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]

    Definition Classes
    TupleInstances0
  401. 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
    TupleInstances0
  402. implicit def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]

    Definition Classes
    TupleInstances1
  403. implicit def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]

    Definition Classes
    TupleInstances1
  404. implicit def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]

    Definition Classes
    TupleInstances0
  405. implicit def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]

    Definition Classes
    TupleInstances1
  406. implicit val tuple2Bitraverse: Bitraverse[Tuple2]

    Definition Classes
    TupleInstances0
  407. implicit def tuple2Cozip[A1]: Cozip[[x](A1, x)]

    Definition Classes
    TupleInstances1
  408. implicit def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]

    Definition Classes
    TupleInstances0
  409. implicit def tuple2Instance[A1]: Traverse[[x](A1, x)] with Comonad[[x](A1, x)]

    Product functor and comonad

    Product functor and comonad

    Definition Classes
    TupleInstances0
  410. implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[x](A1, x)]

    Definition Classes
    TupleInstances1
  411. implicit def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]

    Definition Classes
    TupleInstances1
  412. implicit def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]

    Definition Classes
    TupleInstances1
  413. implicit def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]

    Definition Classes
    TupleInstances0
  414. implicit def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]

    Definition Classes
    TupleInstances1
  415. implicit def tuple3Cozip[A1, A2]: Cozip[[x](A1, A2, x)]

    Definition Classes
    TupleInstances1
  416. implicit def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]

    Definition Classes
    TupleInstances0
  417. implicit def tuple3Functor[A1, A2]: Traverse[[x](A1, A2, x)]

    Definition Classes
    TupleInstances0
  418. implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[x](A1, A2, x)]

    Definition Classes
    TupleInstances1
  419. implicit def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]

    Definition Classes
    TupleInstances1
  420. implicit def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]

    Definition Classes
    TupleInstances1
  421. implicit def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]

    Definition Classes
    TupleInstances0
  422. implicit def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]

    Definition Classes
    TupleInstances1
  423. implicit def tuple4Cozip[A1, A2, A3]: Cozip[[x](A1, A2, A3, x)]

    Definition Classes
    TupleInstances1
  424. 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
    TupleInstances0
  425. implicit def tuple4Functor[A1, A2, A3]: Traverse[[x](A1, A2, A3, x)]

    Definition Classes
    TupleInstances0
  426. implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[x](A1, A2, A3, x)]

    Definition Classes
    TupleInstances1
  427. 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
  428. 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
    TupleInstances1
  429. 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
  430. 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
    TupleInstances1
  431. implicit def tuple5Cozip[A1, A2, A3, A4]: Cozip[[x](A1, A2, A3, A4, x)]

    Definition Classes
    TupleInstances1
  432. 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
    TupleInstances0
  433. implicit def tuple5Functor[A1, A2, A3, A4]: Traverse[[x](A1, A2, A3, A4, x)]

    Definition Classes
    TupleInstances0
  434. implicit def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[x](A1, A2, A3, A4, x)]

    Definition Classes
    TupleInstances1
  435. 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
  436. 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
    TupleInstances1
  437. 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
  438. 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
    TupleInstances1
  439. implicit def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[x](A1, A2, A3, A4, A5, x)]

    Definition Classes
    TupleInstances1
  440. 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
    TupleInstances0
  441. implicit def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[x](A1, A2, A3, A4, A5, x)]

    Definition Classes
    TupleInstances0
  442. 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[[x](A1, A2, A3, A4, A5, x)]

    Definition Classes
    TupleInstances1
  443. 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
  444. 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
    TupleInstances1
  445. 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
  446. 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
    TupleInstances1
  447. implicit def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[x](A1, A2, A3, A4, A5, A6, x)]

    Definition Classes
    TupleInstances1
  448. 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
    TupleInstances0
  449. implicit def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[x](A1, A2, A3, A4, A5, A6, x)]

    Definition Classes
    TupleInstances0
  450. 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[[x](A1, A2, A3, A4, A5, A6, x)]

    Definition Classes
    TupleInstances1
  451. 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
  452. 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
    TupleInstances1
  453. 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
  454. 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
    TupleInstances1
  455. implicit def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[x](A1, A2, A3, A4, A5, A6, A7, x)]

    Definition Classes
    TupleInstances1
  456. 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
    TupleInstances0
  457. implicit def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[x](A1, A2, A3, A4, A5, A6, A7, x)]

    Definition Classes
    TupleInstances0
  458. 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[[x](A1, A2, A3, A4, A5, A6, A7, x)]

    Definition Classes
    TupleInstances1
  459. 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
  460. 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
    TupleInstances1
  461. 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
  462. 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
    TupleInstances1
  463. def unfold[A, B](seed: A)(f: (A) ⇒ Option[(B, A)]): Stream[B]

    Definition Classes
    StreamFunctions
  464. final def unfoldForest[A, B](as: Stream[A])(f: (A) ⇒ (B, () ⇒ Stream[A])): Stream[Tree[B]]

    Definition Classes
    StreamFunctions
  465. final def unfoldForestM[A, B, M[_]](as: Stream[A])(f: (A) ⇒ M[(B, Stream[A])])(implicit arg0: Monad[M]): M[Stream[Tree[B]]]

    Definition Classes
    StreamFunctions
  466. final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[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
    MapSubFunctions
    Note

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

  467. final def unionWithKey[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (K, A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Like unionWith, but telling f about the key.

    Like unionWith, but telling f about the key.

    Definition Classes
    MapSubFunctions
  468. implicit val unitInstance: Monoid[Unit] with Enum[Unit] with Show[Unit]

    Definition Classes
    AnyValInstances
  469. 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
  470. 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
  471. def unsafeCharsNel(s: String): NonEmptyList[Char]

    Definition Classes
    StringFunctions
  472. 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
  473. implicit def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]

    Definition Classes
    VectorInstances0
  474. implicit val vectorInstance: Traverse[std.VectorInstances.generic.IxSq] with MonadPlus[std.VectorInstances.generic.IxSq] with Each[std.VectorInstances.generic.IxSq] with Index[std.VectorInstances.generic.IxSq] with Length[std.VectorInstances.generic.IxSq] with Zip[std.VectorInstances.generic.IxSq] with Unzip[std.VectorInstances.generic.IxSq] with IsEmpty[std.VectorInstances.generic.IxSq] with Align[std.VectorInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.Scalaz.generic.IxSq[A]): scalaz.Scalaz.generic.IxSq[A] }

    Definition Classes
    VectorInstances
  475. implicit def vectorMonoid[A]: Monoid[Vector[A]]

    Definition Classes
    VectorInstances
  476. implicit def vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]

    Definition Classes
    VectorInstances
  477. implicit def vectorShow[A](implicit arg0: Show[A]): Show[Vector[A]]

    Definition Classes
    VectorInstances
  478. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  481. 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
  482. 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
  483. final def zapp[A, B, C](a: Stream[A])(f: Stream[(A) ⇒ (B) ⇒ C]): Stream[(B) ⇒ C]

    Definition Classes
    StreamFunctions
  484. 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
  485. final def zipperEnd[A](as: Stream[A]): Option[Zipper[A]]

    Definition Classes
    StreamFunctions
  486. final def zipperEnd[A](as: List[A]): Option[Zipper[A]]

    Definition Classes
    ListFunctions
  487. def [F](implicit F: Monoid[F]): F

    Definition Classes
    ToMonoidOps

Deprecated Value Members

  1. final def groupByM[A, M[_]](as: List[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]

    Definition Classes
    ListFunctions
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) use groupWhenM

  2. implicit val intMetricSpace: MetricSpace[Int]

    Warning: the triangle inequality will not hold if b - a overflows.

    Warning: the triangle inequality will not hold if b - a overflows.

    Definition Classes
    AnyValInstances
    Annotations
    @deprecated
    Deprecated

    (Since version 7.0.1) MetricSpace is deprecated

  3. final def merge[A](s1: Stream[A], s2: Stream[A]): Stream[A]

    Definition Classes
    StreamFunctions
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) renamed to interleave for consistency and to avoid collision with Align#merge

Inherited from IdInstances

Inherited from ToAllStdOps

Inherited from ToEitherOps

Inherited from ToMapOps

Inherited from ToTupleOps

Inherited from ToStringOps

Inherited from ToFunction1Ops

Inherited from ToFunction2Ops

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 BooleanFunctions

Inherited from StreamFunctions

Inherited from OptionFunctions

Inherited from ListFunctions

Inherited from AllInstances

Inherited from NodeSeqInstances

Inherited from CallableInstances

Inherited from EnumInstances

Inherited from BigIntegerInstances

Inherited from Parsers

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 TupleInstances1

Inherited from TupleInstances0

Inherited from StreamInstances

Inherited from StringInstances

Inherited from SetInstances

Inherited from OptionInstances

Inherited from OptionInstances0

Inherited from std.MapInstances

Inherited from MapSubMap

Inherited from MapSubInstances

Inherited from MapSubFunctions

Inherited from MapSubInstances0

Inherited from MapSub

Inherited from ListInstances

Inherited from ListInstances0

Inherited from FunctionInstances

Inherited from FunctionInstances0

Inherited from FunctionInstances1

Inherited from AnyValInstances

Inherited from ToDataOps

Inherited from ToMaybeOps

Inherited from ToTheseOps

Inherited from ToNelOps

Inherited from ToEitherOps

Inherited from ToKleisliOps

Inherited from ToKleisliOps0

Inherited from ToValidationOps

Inherited from ToStateOps

Inherited from ToWriterOps

Inherited from ToReducerOps

Inherited from ToTreeOps

Inherited from ToIdOps

Inherited from ToTypeClassOps

Inherited from ToProChoiceOps

Inherited from ToProChoiceOps0

Inherited from ToAlignOps

Inherited from ToAlignOps0

Inherited from ToCatchableOps

Inherited from ToCatchableOps0

Inherited from ToOptionalOps

Inherited from ToOptionalOps0

Inherited from ToTraverse1Ops

Inherited from ToTraverse1Ops0

Inherited from ToFoldable1Ops

Inherited from ToFoldable1Ops0

Inherited from ToMonadErrorOps

Inherited from ToMonadListenOps

Inherited from ToMonadListenOps0

Inherited from ToMonadTellOps

Inherited from ToMonadTellOps0

Inherited from ToUnzipOps

Inherited from ToUnzipOps0

Inherited from ToZipOps

Inherited from ToZipOps0

Inherited from ToChoiceOps

Inherited from ToChoiceOps0

Inherited from ToArrowOps

Inherited from ToProfunctorOps

Inherited from ToProfunctorOps0

Inherited from ToSplitOps

Inherited from ToSplitOps0

Inherited from ToArrowOps0

Inherited from ToCategoryOps

Inherited from ToCategoryOps0

Inherited from ToComposeOps

Inherited from ToComposeOps0

Inherited from ToBitraverseOps

Inherited from ToBitraverseOps0

Inherited from ToAssociativeOps

Inherited from ToAssociativeOps0

Inherited from ToBifunctorOps

Inherited from ToBifunctorOps0

Inherited from ToTraverseOps

Inherited from ToFoldableOps

Inherited from ToFoldableOps0

Inherited from ToTraverseOps0

Inherited from ToMonadPlusOps

Inherited from ToMonadPlusOps0

Inherited from ToApplicativePlusOps

Inherited from ToApplicativePlusOps0

Inherited from ToCozipOps

Inherited from ToCozipOps0

Inherited from ToBifoldableOps

Inherited from ToBifoldableOps0

Inherited from ToComonadOps

Inherited from ToCobindOps

Inherited from ToCobindOps0

Inherited from ToComonadOps0

Inherited from ToMonadOps

Inherited from ToMonadOps0

Inherited from ToBindOps

Inherited from ToBindOps0

Inherited from ToApplicativeOps

Inherited from ToApplicativeOps0

Inherited from ToApplyOps

Inherited from ToApplyOps0

Inherited from ToContravariantOps

Inherited from ToContravariantOps0

Inherited from ToFunctorOps

Inherited from ToInvariantFunctorOps

Inherited from ToInvariantFunctorOps0

Inherited from ToFunctorOps0

Inherited from ToIndexOps

Inherited from ToIndexOps0

Inherited from ToEachOps

Inherited from ToEachOps0

Inherited from ToPlusEmptyOps

Inherited from ToPlusOps

Inherited from ToPlusOps0

Inherited from ToPlusEmptyOps0

Inherited from ToMetricSpaceOps

Inherited from ToEnumOps

Inherited from ToOrderOps

Inherited from ToShowOps

Inherited from ToLengthOps

Inherited from ToLengthOps0

Inherited from ToEqualOps

Inherited from ToMonoidOps

Inherited from ToSemigroupOps

Inherited from StateFunctions

Inherited from IndexedStateFunctions

Inherited from AnyRef

Inherited from Any

Ungrouped