Packages

o

scalaz

Scalaz

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

Source
Scalaz.scala
Linear Supertypes
IdInstances, ToAllStdOps, ToTryOps, ToEitherOps, ToMapOps, ToTupleOps, ToStringOps, ToFunction1Ops, ToFunction2Ops, ToVectorOps, ToStreamOps, ToListOps, ToOptionIdOps, ToOptionOps, ToBooleanOps, AllFunctions, FunctionFunctions, StringFunctions, OrderingFunctions, BooleanFunctions, StreamFunctions, OptionFunctions, ListFunctions, AllInstances, CallableInstances, EnumInstances, BigIntegerInstances, std.java.util.MapInstances, std.math.OrderingInstances, BigInts, BigDecimalInstances, TypeConstraintInstances, PartialFunctionInstances, EitherInstances, EitherInstances0, FutureInstances, FutureInstances1, VectorInstances, VectorInstances0, TupleInstances, TupleInstances2, 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, ToAlignOps, ToAlignOps0, ToCatchableOps, ToCatchableOps0, ToOptionalOps, ToOptionalOps0, ToTraverse1Ops, ToTraverse1Ops0, ToFoldable1Ops, ToFoldable1Ops0, ToMonadErrorOps, ToMonadListenOps, ToMonadTellOps, ToUnzipOps, ToUnzipOps0, ToZipOps, ToZipOps0, ToChoiceOps, ToChoiceOps0, ToArrowOps, ToStrongOps, ToProfunctorOps, ToProfunctorOps0, ToStrongOps0, 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, ToPlusEmptyOps, ToPlusOps, ToPlusOps0, ToPlusEmptyOps0, ToEnumOps, ToOrderOps, ToShowOps, ToEqualOps, ToMonoidOps, ToSemigroupOps, StateFunctions, IndexedStateFunctions, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Scalaz
  2. IdInstances
  3. ToAllStdOps
  4. ToTryOps
  5. ToEitherOps
  6. ToMapOps
  7. ToTupleOps
  8. ToStringOps
  9. ToFunction1Ops
  10. ToFunction2Ops
  11. ToVectorOps
  12. ToStreamOps
  13. ToListOps
  14. ToOptionIdOps
  15. ToOptionOps
  16. ToBooleanOps
  17. AllFunctions
  18. FunctionFunctions
  19. StringFunctions
  20. OrderingFunctions
  21. BooleanFunctions
  22. StreamFunctions
  23. OptionFunctions
  24. ListFunctions
  25. AllInstances
  26. CallableInstances
  27. EnumInstances
  28. BigIntegerInstances
  29. MapInstances
  30. OrderingInstances
  31. BigInts
  32. BigDecimalInstances
  33. TypeConstraintInstances
  34. PartialFunctionInstances
  35. EitherInstances
  36. EitherInstances0
  37. FutureInstances
  38. FutureInstances1
  39. VectorInstances
  40. VectorInstances0
  41. TupleInstances
  42. TupleInstances2
  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. ToAlignOps
  77. ToAlignOps0
  78. ToCatchableOps
  79. ToCatchableOps0
  80. ToOptionalOps
  81. ToOptionalOps0
  82. ToTraverse1Ops
  83. ToTraverse1Ops0
  84. ToFoldable1Ops
  85. ToFoldable1Ops0
  86. ToMonadErrorOps
  87. ToMonadListenOps
  88. ToMonadTellOps
  89. ToUnzipOps
  90. ToUnzipOps0
  91. ToZipOps
  92. ToZipOps0
  93. ToChoiceOps
  94. ToChoiceOps0
  95. ToArrowOps
  96. ToStrongOps
  97. ToProfunctorOps
  98. ToProfunctorOps0
  99. ToStrongOps0
  100. ToSplitOps
  101. ToSplitOps0
  102. ToArrowOps0
  103. ToCategoryOps
  104. ToCategoryOps0
  105. ToComposeOps
  106. ToComposeOps0
  107. ToBitraverseOps
  108. ToBitraverseOps0
  109. ToAssociativeOps
  110. ToAssociativeOps0
  111. ToBifunctorOps
  112. ToBifunctorOps0
  113. ToTraverseOps
  114. ToFoldableOps
  115. ToFoldableOps0
  116. ToTraverseOps0
  117. ToMonadPlusOps
  118. ToMonadPlusOps0
  119. ToApplicativePlusOps
  120. ToApplicativePlusOps0
  121. ToCozipOps
  122. ToCozipOps0
  123. ToBifoldableOps
  124. ToBifoldableOps0
  125. ToComonadOps
  126. ToCobindOps
  127. ToCobindOps0
  128. ToComonadOps0
  129. ToMonadOps
  130. ToMonadOps0
  131. ToBindOps
  132. ToBindOps0
  133. ToApplicativeOps
  134. ToApplicativeOps0
  135. ToApplyOps
  136. ToApplyOps0
  137. ToContravariantOps
  138. ToContravariantOps0
  139. ToFunctorOps
  140. ToInvariantFunctorOps
  141. ToInvariantFunctorOps0
  142. ToFunctorOps0
  143. ToPlusEmptyOps
  144. ToPlusOps
  145. ToPlusOps0
  146. ToPlusEmptyOps0
  147. ToEnumOps
  148. ToOrderOps
  149. ToShowOps
  150. ToEqualOps
  151. ToMonoidOps
  152. ToSemigroupOps
  153. StateFunctions
  154. IndexedStateFunctions
  155. AnyRef
  156. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type BuildKeyConstraint[K] = DummyImplicit

    Evidence on key needed to construct new maps.

    Evidence on key needed to construct new maps.

    Definition Classes
    MapSubMapMapSub
  2. 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
  3. type Identity[+X] = Need[X]
    Definition Classes
    IdInstances
  4. type XMap[K, +V] = Map[K, V]
    Definition Classes
    MapSubMapMapSub
  5. trait MapMonoid[K, V] extends Monoid[XMap[K, V]]
    Attributes
    protected[this]
    Definition Classes
    MapSub
  6. trait ApplicativeIdV[A] extends Ops[A]
    Definition Classes
    ToApplicativeOps
  7. trait FunctorIdV[A] extends Ops[A]
    Definition Classes
    ToFunctorOps
  8. trait LiftV[F[_], A, B] extends Ops[(A) ⇒ B]
    Definition Classes
    ToFunctorOps
  9. final class UnzipPairOps[F[_], A, B] extends AnyRef
    Definition Classes
    ToUnzipOps

Value Members

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

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

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

    Definition Classes
    ListFunctions
  5. val =:=: Category[=:=]
    Definition Classes
    TypeConstraintInstances
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. implicit def ApplicativeIdV[A](v: ⇒ A): ApplicativeIdV[A]
    Definition Classes
    ToApplicativeOps
  8. implicit val BigDecimalMultiplicationNewType: Monoid[@@[BigDecimal, Multiplication]]
    Definition Classes
    BigDecimalInstances
  9. def FirstLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [β$10$]Either[E, β$10$]]

    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. 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. def FirstRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α$14$]Either[α$14$, 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. 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. def LastLeftProjectionEIso2[E]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [β$11$]Either[E, β$11$]]

    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. 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. def LastRightProjectionAIso2[A]: Isomorphism.<~>[[α]AnyRef { ... /* 2 definitions in type refinement */ }, [α$15$]Either[α$15$, 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. 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. def LeftProjectionEIso2[E]: Isomorphism.<~>[[β$8$]LeftProjection[E, β$8$], [β$9$]Either[E, β$9$]]

    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. 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. def RightProjectionAIso2[A]: Isomorphism.<~>[[α$12$]RightProjection[α$12$, A], [α$13$]Either[α$13$, 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. 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ArrowOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$2$, γ$3$]F[G, β$2$, γ$3$]]): AssociativeOps[[β$4$, γ$5$]F[G, β$4$, γ$5$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BifoldableOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BifunctorOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): BitraverseOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): CategoryOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ChoiceOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ComposeOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], 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 ToEitherOps[A](a: A): EitherOps[A]
    Definition Classes
    ToEitherOps
  67. implicit def ToEitherOpsFromEither[A, B](e: Either[A, B]): EitherOps[A, B]
    Definition Classes
    ToEitherOps
  68. implicit def ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]
    Definition Classes
    ToEnumOps
  69. implicit def ToEqualOps[F](v: F)(implicit F0: Equal[F]): EqualOps[F]
    Definition Classes
    ToEqualOps
  70. implicit def ToFoldable1Ops[F[_], A](v: F[A])(implicit F0: Foldable1[F]): Foldable1Ops[F, A]
    Definition Classes
    ToFoldable1Ops
  71. implicit def ToFoldable1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable1, FA]): Foldable1Ops[M, A]
    Definition Classes
    ToFoldable1Ops0
  72. implicit def ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]
    Definition Classes
    ToFoldableOps
  73. implicit def ToFoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable, FA]): FoldableOps[M, A]
    Definition Classes
    ToFoldableOps0
  74. implicit def ToFunction1OpsFromBoolean[A, B](f: (A) ⇒ B): Function1Ops[A, B]
    Definition Classes
    ToFunction1Ops
  75. implicit def ToFunction2Ops[T1, T2, R](f: (T1, T2) ⇒ R): Function2Ops[T1, T2, R]
    Definition Classes
    ToFunction2Ops
  76. implicit def ToFunctorIdV[A](v: A): FunctorIdV[A]
    Definition Classes
    ToFunctorOps
  77. implicit def ToFunctorOps[F[_], A](v: F[A])(implicit F0: Functor[F]): FunctorOps[F, A]
    Definition Classes
    ToFunctorOps
  78. implicit def ToFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[Functor, FA]): FunctorOps[M, A]
    Definition Classes
    ToFunctorOps0
  79. implicit def ToIdOps[A](a: A): IdOps[A]
    Definition Classes
    ToIdOps
  80. implicit def ToInvariantFunctorOps[F[_], A](v: F[A])(implicit F0: InvariantFunctor[F]): InvariantFunctorOps[F, A]
    Definition Classes
    ToInvariantFunctorOps
  81. implicit def ToInvariantFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[InvariantFunctor, FA]): InvariantFunctorOps[M, A]
    Definition Classes
    ToInvariantFunctorOps0
  82. implicit def ToKleisliFAOps[F[_], A](fa: F[A]): KleisliFAOps[F, A]
    Definition Classes
    ToKleisliOps
  83. implicit def ToKleisliIdOps[A](a: A): KleisliIdOps[A]
    Definition Classes
    ToKleisliOps
  84. implicit def ToKleisliOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): KleisliFAOps[M, A]
    Definition Classes
    ToKleisliOps0
  85. implicit def ToLiftV[F[_], A, B](v: (A) ⇒ B): LiftV[F, A, B]
    Definition Classes
    ToFunctorOps
  86. implicit def ToListOpsFromList[A](a: List[A]): ListOps[A]
    Definition Classes
    ToListOps
  87. implicit def ToMapOpsFromMap[K, V](m: Map[K, V]): MapOps[Map, std.map.BuildKeyConstraint, K, V]
    Definition Classes
    ToMapOps
  88. implicit def ToMaybeOps[A](a: A): MaybeOps[A]
    Definition Classes
    ToMaybeOps
  89. implicit def ToMonadErrorIdOps[E](v: E): MonadErrorIdOps[E]
    Definition Classes
    ToMonadErrorOps
  90. implicit def ToMonadErrorOps[F[_], S, A](v: F[A])(implicit F0: MonadError[F, S]): MonadErrorOps[F, S, A]
    Definition Classes
    ToMonadErrorOps
  91. implicit def ToMonadListenOps[F[_], A, W](v: F[A])(implicit F0: MonadListen[F, W]): MonadListenOps[F, W, A]
    Definition Classes
    ToMonadListenOps
  92. implicit def ToMonadOps[F[_], A](v: F[A])(implicit F0: Monad[F]): MonadOps[F, A]
    Definition Classes
    ToMonadOps
  93. implicit def ToMonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): MonadOps[M, A]
    Definition Classes
    ToMonadOps0
  94. implicit def ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]
    Definition Classes
    ToMonadPlusOps
  95. implicit def ToMonadPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[MonadPlus, FA]): MonadPlusOps[M, A]
    Definition Classes
    ToMonadPlusOps0
  96. implicit def ToMonadTellOps[F[_], S, A](v: F[A])(implicit F0: MonadTell[F, S]): MonadTellOps[F, S, A]
    Definition Classes
    ToMonadTellOps
  97. implicit def ToMonoidOps[F](v: F)(implicit F0: Monoid[F]): MonoidOps[F]
    Definition Classes
    ToMonoidOps
  98. implicit def ToNelOps[A](a: A): NelOps[A]
    Definition Classes
    ToNelOps
  99. implicit def ToOptionIdOps[A](a: A): OptionIdOps[A]
    Definition Classes
    ToOptionIdOps
  100. implicit def ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]
    Definition Classes
    ToOptionOps
  101. implicit def ToOptionalOps[F[_], A](v: F[A])(implicit F0: Optional[F]): OptionalOps[F, A]
    Definition Classes
    ToOptionalOps
  102. implicit def ToOptionalOpsUnapply[FA](v: FA)(implicit F0: Unapply[Optional, FA]): OptionalOps[M, A]
    Definition Classes
    ToOptionalOps0
  103. implicit def ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]
    Definition Classes
    ToOrderOps
  104. implicit def ToPlusEmptyOps[F[_], A](v: F[A])(implicit F0: PlusEmpty[F]): PlusEmptyOps[F, A]
    Definition Classes
    ToPlusEmptyOps
  105. implicit def ToPlusEmptyOpsUnapply[FA](v: FA)(implicit F0: Unapply[PlusEmpty, FA]): PlusEmptyOps[M, A]
    Definition Classes
    ToPlusEmptyOps0
  106. implicit def ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]
    Definition Classes
    ToPlusOps
  107. implicit def ToPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[Plus, FA]): PlusOps[M, A]
    Definition Classes
    ToPlusOps0
  108. implicit def ToProfunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Profunctor[F]): ProfunctorOps[F, A, B]
    Definition Classes
    ToProfunctorOps
  109. implicit def ToProfunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Profunctor, FA]): ProfunctorOps[M, A, B]
    Definition Classes
    ToProfunctorOps0
  110. implicit def ToProfunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Profunctor[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): ProfunctorOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToProfunctorOps
  111. implicit def ToReducerOps[A](a: A): ReducerOps[A]
    Definition Classes
    ToReducerOps
  112. final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
    Definition Classes
    OrderingFunctions
  113. implicit def ToSemigroupOps[F](v: F)(implicit F0: Semigroup[F]): SemigroupOps[F]
    Definition Classes
    ToSemigroupOps
  114. implicit def ToShowOps[F](v: F)(implicit F0: Show[F]): ShowOps[F]
    Definition Classes
    ToShowOps
  115. implicit def ToSplitOps[F[_, _], A, B](v: F[A, B])(implicit F0: Split[F]): SplitOps[F, A, B]
    Definition Classes
    ToSplitOps
  116. implicit def ToSplitOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Split, FA]): SplitOps[M, A, B]
    Definition Classes
    ToSplitOps0
  117. implicit def ToSplitVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Split[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): SplitOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToSplitOps
  118. implicit def ToStateOps[A](a: A): StateOps[A]
    Definition Classes
    ToStateOps
  119. implicit def ToStreamOpsFromStream[A](a: Stream[A]): StreamOps[A]
    Definition Classes
    ToStreamOps
  120. implicit def ToStringOpsFromString(a: String): StringOps
    Definition Classes
    ToStringOps
  121. implicit def ToStrongOps[F[_, _], A, B](v: F[A, B])(implicit F0: Strong[F]): StrongOps[F, A, B]
    Definition Classes
    ToStrongOps
  122. implicit def ToStrongOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Strong, FA]): StrongOps[M, A, B]
    Definition Classes
    ToStrongOps0
  123. implicit def ToStrongVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Strong[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): StrongOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]
    Definition Classes
    ToStrongOps
  124. implicit def ToTheseOps[A](a: A): TheseOps[A]
    Definition Classes
    ToTheseOps
  125. implicit def ToThesePairOps[A, B](a: (A, B)): ThesePairOps[A, B]
    Definition Classes
    ToTheseOps
  126. implicit def ToTraverse1Ops[F[_], A](v: F[A])(implicit F0: Traverse1[F]): Traverse1Ops[F, A]
    Definition Classes
    ToTraverse1Ops
  127. implicit def ToTraverse1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse1, FA]): Traverse1Ops[M, A]
    Definition Classes
    ToTraverse1Ops0
  128. implicit def ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]
    Definition Classes
    ToTraverseOps
  129. implicit def ToTraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse, FA]): TraverseOps[M, A]
    Definition Classes
    ToTraverseOps0
  130. implicit def ToTreeOps[A](a: A): TreeOps[A]
    Definition Classes
    ToTreeOps
  131. implicit def ToTryOpsFromTry[A](a: Try[A]): TryOps[A]
    Definition Classes
    ToTryOps
  132. 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
  133. 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
  134. 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
  135. implicit def ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]
    Definition Classes
    ToTupleOps
  136. implicit def ToTuple3Ops[A, B, C](t: (A, B, C)): Tuple3Ops[A, B, C]
    Definition Classes
    ToTupleOps
  137. implicit def ToTuple4Ops[A, B, C, D](t: (A, B, C, D)): Tuple4Ops[A, B, C, D]
    Definition Classes
    ToTupleOps
  138. implicit def ToTuple5Ops[A, B, C, D, E](t: (A, B, C, D, E)): Tuple5Ops[A, B, C, D, E]
    Definition Classes
    ToTupleOps
  139. 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
  140. 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
  141. 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
  142. 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
  143. implicit def ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]
    Definition Classes
    ToUnzipOps
  144. implicit def ToUnzipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Unzip, FA]): UnzipOps[M, A]
    Definition Classes
    ToUnzipOps0
  145. implicit def ToUnzipPairOps[F[_], A, B](v: F[(A, B)])(implicit F0: Unzip[F]): UnzipPairOps[F, A, B]
    Definition Classes
    ToUnzipOps
  146. implicit def ToValidationOps[A](a: A): ValidationOps[A]
    Definition Classes
    ToValidationOps
  147. implicit def ToVectorOpsFromVector[A](a: Vector[A]): VectorOps[A]
    Definition Classes
    ToVectorOps
  148. implicit def ToWriterOps[A](a: A): WriterOps[A]
    Definition Classes
    ToWriterOps
  149. implicit def ToZipOps[F[_], A](v: F[A])(implicit F0: Zip[F]): ZipOps[F, A]
    Definition Classes
    ToZipOps
  150. implicit def ToZipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Zip, FA]): ZipOps[M, A]
    Definition Classes
    ToZipOps0
  151. def ^[F[_], A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C)(implicit F: Apply[F]): F[C]
    Definition Classes
    ToApplyOps
  152. 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
  153. 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
  154. 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
  155. 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
  156. 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
  157. 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
  158. 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
  159. 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
  160. 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
  161. 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
  162. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  163. implicit val bigDecimalInstance: Monoid[BigDecimal] with Enum[BigDecimal] with Show[BigDecimal]
    Definition Classes
    BigDecimalInstances
  164. implicit val bigIntInstance: Monoid[BigInt] with Enum[BigInt] with Show[BigInt]
    Definition Classes
    BigInts
  165. implicit val bigIntMultiplication: Monoid[@@[BigInt, Multiplication]] with Order[@@[BigInt, Multiplication]] with Show[@@[BigInt, Multiplication]]
    Definition Classes
    BigInts
  166. implicit val bigIntegerInstance: Monoid[BigInteger] with Enum[BigInteger] with Show[BigInteger]
    Definition Classes
    BigIntegerInstances
  167. implicit val bigIntegerMultiplication: Monoid[@@[BigInteger, Multiplication]] with Order[@@[BigInteger, Multiplication]] with Show[@@[BigInteger, Multiplication]]
    Definition Classes
    BigIntegerInstances
  168. implicit val booleanConjunctionNewTypeInstance: Monoid[@@[Boolean, Conjunction]] with Enum[@@[Boolean, Conjunction]] with Band[@@[Boolean, Conjunction]]
    Definition Classes
    AnyValInstances
  169. implicit val booleanDisjunctionNewTypeInstance: Monoid[@@[Boolean, Tags.Disjunction]] with Enum[@@[Boolean, Tags.Disjunction]] with Band[@@[Boolean, Tags.Disjunction]]
    Definition Classes
    AnyValInstances
  170. 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
  171. 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
  172. implicit val byteInstance: Monoid[Byte] with Enum[Byte] with Show[Byte]
    Definition Classes
    AnyValInstances
  173. implicit val byteMultiplicationNewType: Monoid[@@[Byte, Multiplication]] with Enum[@@[Byte, Multiplication]]
    Definition Classes
    AnyValInstances
  174. implicit val callableMonad: Monad[Callable]
    Definition Classes
    CallableInstances
  175. implicit def callableOrder[A](implicit arg0: Order[A]): Order[Callable[A]]
    Definition Classes
    CallableInstances
  176. 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
  177. implicit val char: Monoid[Char] with Enum[Char] with Show[Char]
    Definition Classes
    AnyValInstances
  178. implicit val charMultiplicationNewType: Monoid[@@[Char, Multiplication]] with Enum[@@[Char, Multiplication]]
    Definition Classes
    AnyValInstances
  179. 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
  180. 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
  181. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  182. 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
  183. 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
  184. def constantIndexedState[S1, S2, A](a: A, s: ⇒ S2): IndexedState[S1, S2, A]
    Definition Classes
    IndexedStateFunctions
  185. def constantState[S, A](a: A, s: ⇒ S): State[S, A]
    Definition Classes
    StateFunctions
  186. 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
  187. implicit val doubleInstance: Order[Double] with Show[Double]
    Definition Classes
    AnyValInstances
  188. implicit def eitherAssociative: Associative[Either]
    Definition Classes
    EitherInstances
  189. implicit def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]
    Definition Classes
    EitherInstances0
  190. implicit def eitherFirstLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], First]]
    Definition Classes
    EitherInstances0
  191. val eitherFirstLeftInstance: IsomorphismBifunctor[[α, β]AnyRef { ... /* 2 definitions in type refinement */ }, Either]
    Definition Classes
    EitherInstances
  192. implicit def eitherFirstLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], First]]
    Definition Classes
    EitherInstances
  193. implicit def eitherFirstLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], First]]
    Definition Classes
    EitherInstances
  194. implicit def eitherFirstLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
    Definition Classes
    EitherInstances
  195. implicit def eitherFirstLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], First]]
    Definition Classes
    EitherInstances0
  196. implicit def eitherFirstRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], First]]
    Definition Classes
    EitherInstances0
  197. implicit def eitherFirstRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
    Definition Classes
    EitherInstances
  198. implicit def eitherFirstRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], First]]
    Definition Classes
    EitherInstances
  199. implicit def eitherFirstRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], First]]
    Definition Classes
    EitherInstances
  200. implicit def eitherFirstRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], First]]
    Definition Classes
    EitherInstances0
  201. implicit val eitherInstance: Bitraverse[Either]
    Definition Classes
    EitherInstances
  202. implicit def eitherLastLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], Last]]
    Definition Classes
    EitherInstances0
  203. implicit def eitherLastLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], Last]]
    Definition Classes
    EitherInstances
  204. implicit def eitherLastLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], Last]]
    Definition Classes
    EitherInstances
  205. implicit def eitherLastLeftRInstance[R]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
    Definition Classes
    EitherInstances
  206. implicit def eitherLastLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], Last]]
    Definition Classes
    EitherInstances0
  207. implicit def eitherLastRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], Last]]
    Definition Classes
    EitherInstances0
  208. implicit def eitherLastRightLInstance[L]: Monad[[α]AnyRef { ... /* 2 definitions in type refinement */ }]
    Definition Classes
    EitherInstances
  209. implicit def eitherLastRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], Last]]
    Definition Classes
    EitherInstances
  210. implicit def eitherLastRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], Last]]
    Definition Classes
    EitherInstances
  211. implicit def eitherLastRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], Last]]
    Definition Classes
    EitherInstances0
  212. implicit def eitherLeftEqual[A, X](implicit A0: Equal[A]): Equal[LeftProjection[A, X]]
    Definition Classes
    EitherInstances0
  213. val eitherLeftInstance: IsomorphismBifunctor[LeftProjection, Either]
    Definition Classes
    EitherInstances
  214. implicit def eitherLeftMonoid[A, X](implicit MonoidA: Monoid[A], MonoidX: Monoid[X]): Monoid[LeftProjection[A, X]]
    Definition Classes
    EitherInstances
  215. implicit def eitherLeftOrder[A, X](implicit OrderA: Order[A]): Order[LeftProjection[A, X]]
    Definition Classes
    EitherInstances
  216. implicit def eitherLeftRInstance[R]: Monad[[α$21$]LeftProjection[α$21$, R]] { def point[A](a: => A): scala.util.Either.LeftProjection[A,Nothing] }
    Definition Classes
    EitherInstances
  217. implicit def eitherLeftSemigroup[A, X](implicit SemigroupA: Semigroup[A], MonoidX: Monoid[X]): Semigroup[LeftProjection[A, X]]
    Definition Classes
    EitherInstances0
  218. implicit def eitherMonad[L]: Traverse[[β$0$]Either[L, β$0$]] with MonadError[[β$1$]Either[L, β$1$], L] with BindRec[[β$2$]Either[L, β$2$]] with Cozip[[β$3$]Either[L, β$3$]]

    Right biased monad

    Right biased monad

    Definition Classes
    EitherInstances
  219. implicit def eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]
    Definition Classes
    EitherInstances
  220. implicit def eitherRightEqual[X, A](implicit A0: Equal[A]): Equal[RightProjection[X, A]]
    Definition Classes
    EitherInstances0
  221. val eitherRightInstance: IsomorphismBifunctor[RightProjection, Either]
    Definition Classes
    EitherInstances
  222. implicit def eitherRightLInstance[L]: Monad[[β$16$]RightProjection[L, β$16$]] { def point[A](a: => A): scala.util.Either.RightProjection[Nothing,A] }
    Definition Classes
    EitherInstances
  223. implicit def eitherRightMonoid[X, A](implicit MonoidX: Monoid[X], MonoidA: Monoid[A]): Monoid[RightProjection[X, A]]
    Definition Classes
    EitherInstances
  224. implicit def eitherRightOrder[X, A](implicit OrderA: Order[A]): Order[RightProjection[X, A]]
    Definition Classes
    EitherInstances
  225. implicit def eitherRightSemigroup[X, A](implicit MonoidX: Monoid[X], SemigroupA: Semigroup[A]): Semigroup[RightProjection[X, A]]
    Definition Classes
    EitherInstances0
  226. implicit def eitherShow[A, B](implicit SA: Show[A], SB: Show[B]): Show[Either[A, B]]
    Definition Classes
    EitherInstances
  227. 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
  228. final def emptyOrPureNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
    Definition Classes
    BooleanFunctions
  229. implicit def enumInstance[E <: java.lang.Enum[E]]: Equal[E]
    Definition Classes
    EnumInstances
  230. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  231. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  232. final def filterM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]
    Definition Classes
    ListFunctions
  233. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  234. 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
  235. 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

  236. implicit val floatInstance: Order[Float] with Show[Float]
    Definition Classes
    AnyValInstances
  237. final def fold[A](cond: Boolean, t: ⇒ A, f: ⇒ A): A

    returns

    t if cond is true, f otherwise

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

    Alias for cata

    Alias for cata

    Definition Classes
    OptionFunctions
  239. 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
  240. 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
  241. implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() ⇒ R]
    Definition Classes
    FunctionInstances
  242. implicit val function0Instance: Traverse[Function0] with Monad[Function0] with BindRec[Function0] with Comonad[Function0] with Distributive[Function0]
    Definition Classes
    FunctionInstances
  243. implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[β$0$](A) ⇒ β$0$]
    Definition Classes
    FunctionInstances1
  244. implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[β$1$](A) ⇒ β$1$]
    Definition Classes
    FunctionInstances0
  245. implicit def function1Contravariant[R]: Contravariant[[α$22$](α$22$) ⇒ R]
    Definition Classes
    FunctionInstances
  246. implicit def function1Covariant[T]: Monad[[β$12$](T) ⇒ β$12$] with BindRec[[β$13$](T) ⇒ β$13$] with Zip[[β$14$](T) ⇒ β$14$] with Unzip[[β$15$](T) ⇒ β$15$] with Distributive[[β$16$](T) ⇒ β$16$]
    Definition Classes
    FunctionInstances
  247. implicit def function1CovariantByName[T]: Monad[[β$2$](⇒ T) ⇒ β$2$] with BindRec[[β$3$](⇒ T) ⇒ β$3$] with Zip[[β$4$](⇒ T) ⇒ β$4$] with Unzip[[β$5$](⇒ T) ⇒ β$5$] with Distributive[[β$6$](⇒ T) ⇒ β$6$]
    Definition Classes
    FunctionInstances0
  248. implicit val function1Instance: Arrow[Function1] with Choice[Function1] with ProChoice[Function1]
    Definition Classes
    FunctionInstances
  249. implicit def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[(A) ⇒ R]
    Definition Classes
    FunctionInstances0
  250. implicit def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[(A) ⇒ R]
    Definition Classes
    FunctionInstances1
  251. implicit def function2Instance[T1, T2]: Monad[[γ$24$](T1, T2) ⇒ γ$24$] with BindRec[[γ$25$](T1, T2) ⇒ γ$25$]
    Definition Classes
    FunctionInstances
  252. implicit def function3Instance[T1, T2, T3]: Monad[[δ$28$](T1, T2, T3) ⇒ δ$28$] with BindRec[[δ$29$](T1, T2, T3) ⇒ δ$29$]
    Definition Classes
    FunctionInstances
  253. implicit def function4Instance[T1, T2, T3, T4]: Monad[[ε$32$](T1, T2, T3, T4) ⇒ ε$32$] with BindRec[[ε$33$](T1, T2, T3, T4) ⇒ ε$33$]
    Definition Classes
    FunctionInstances
  254. implicit def function5Instance[T1, T2, T3, T4, T5]: Monad[[ζ$36$](T1, T2, T3, T4, T5) ⇒ ζ$36$] with BindRec[[ζ$37$](T1, T2, T3, T4, T5) ⇒ ζ$37$]
    Definition Classes
    FunctionInstances
  255. implicit def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[η$40$](T1, T2, T3, T4, T5, T6) ⇒ η$40$] with BindRec[[η$41$](T1, T2, T3, T4, T5, T6) ⇒ η$41$]
    Definition Classes
    FunctionInstances
  256. implicit def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[θ$44$](T1, T2, T3, T4, T5, T6, T7) ⇒ θ$44$] with BindRec[[θ$45$](T1, T2, T3, T4, T5, T6, T7) ⇒ θ$45$]
    Definition Classes
    FunctionInstances
  257. implicit def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[ι$48$](T1, T2, T3, T4, T5, T6, T7, T8) ⇒ ι$48$] with BindRec[[ι$49$](T1, T2, T3, T4, T5, T6, T7, T8) ⇒ ι$49$]
    Definition Classes
    FunctionInstances
  258. 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
  259. implicit def futureInstance(implicit ec: ExecutionContext): Nondeterminism[Future] with Cobind[Future] with MonadError[Future, Throwable] with Catchable[Future]
    Definition Classes
    FutureInstances1
  260. implicit def futureMonoid[A](implicit g: Monoid[A], ec: ExecutionContext): Monoid[Future[A]]
    Definition Classes
    FutureInstances
  261. implicit def futureSemigroup[A](implicit m: Semigroup[A], ec: ExecutionContext): Semigroup[Future[A]]
    Definition Classes
    FutureInstances1
  262. def get[S]: State[S, S]
    Definition Classes
    StateFunctions
  263. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  264. 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
  265. def gets[S, T](f: (S) ⇒ T): State[S, T]
    Definition Classes
    StateFunctions
  266. 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
  267. 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
  268. 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
  269. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  270. 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
  271. def iModify[S1, S2](f: (S1) ⇒ S2): IndexedState[S1, S2, Unit]
    Definition Classes
    IndexedStateFunctions
  272. def iPut[S1, S2](s: S2): IndexedState[S1, S2, Unit]
    Definition Classes
    IndexedStateFunctions
  273. val id: Traverse1[Id] with Monad[Id] with BindRec[Id] with Comonad[Id] with Distributive[Id] with Zip[Id] with Unzip[Id] with Align[Id] with Cozip[Id] with Optional[Id]
    Definition Classes
    IdInstances
  274. def init[S]: State[S, S]
    Definition Classes
    StateFunctions
  275. 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
  276. 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
  277. implicit val intInstance: Monoid[Int] with Enum[Int] with Show[Int]
    Definition Classes
    AnyValInstances
  278. implicit val intMultiplicationNewType: Monoid[@@[Int, Multiplication]] with Enum[@@[Int, Multiplication]]
    Definition Classes
    AnyValInstances
  279. final def interleave[A](s1: Stream[A], s2: Stream[A]): Stream[A]
    Definition Classes
    StreamFunctions
  280. 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
  281. 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
  282. 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
  283. 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
  284. 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
  285. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  286. implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]
    Definition Classes
    ListInstances0
  287. implicit val listInstance: Traverse[List] with MonadPlus[List] with BindRec[List] with Zip[List] with Unzip[List] with Align[List] with IsEmpty[List] with Cobind[List]
    Definition Classes
    ListInstances
  288. implicit def listMonoid[A]: Monoid[List[A]]
    Definition Classes
    ListInstances
  289. implicit def listOrder[A](implicit A0: Order[A]): Order[List[A]]
    Definition Classes
    ListInstances
  290. implicit def listShow[A](implicit arg0: Show[A]): Show[List[A]]
    Definition Classes
    ListInstances
  291. implicit val longInstance: Monoid[Long] with Enum[Long] with Show[Long]
    Definition Classes
    AnyValInstances
  292. implicit val longMultiplicationNewType: Monoid[@@[Long, Multiplication]] with Enum[@@[Long, Multiplication]]
    Definition Classes
    AnyValInstances
  293. 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
  294. 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
  295. implicit val mapEntryBitraverse: Bitraverse[Entry]
    Definition Classes
    MapInstances
  296. implicit def mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[XMap[K, V]]
    Definition Classes
    MapSubInstances0
  297. implicit def mapFoldable[K]: Foldable[[β$1$]XMap[K, β$1$]]
    Definition Classes
    MapSubInstances0
  298. implicit def mapInstance[K](implicit arg0: BuildKeyConstraint[K]): Traverse[[β$2$]XMap[K, β$2$]] with IsEmpty[[β$3$]XMap[K, β$3$]] with Bind[[β$4$]XMap[K, β$4$]] with Align[[β$5$]XMap[K, β$5$]]

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

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

    Definition Classes
    MapSubInstances
  299. 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
  300. 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
  301. implicit def mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[XMap[K, V]]
    Definition Classes
    MapSubInstances
  302. implicit def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[XMap[K, V]]
    Definition Classes
    MapSubInstances
  303. def mempty[F[_], A](implicit F: PlusEmpty[F]): F[A]
    Definition Classes
    ToPlusEmptyOps
  304. def modify[S](f: (S) ⇒ S): State[S, Unit]
    Definition Classes
    StateFunctions
  305. def mzero[F](implicit F: Monoid[F]): F
    Definition Classes
    ToMonoidOps
  306. 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
  307. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  308. 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
  309. 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
  310. 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
  311. 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
  312. 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
  313. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  314. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  315. 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
  316. implicit def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]
    Definition Classes
    OptionInstances0
  317. implicit def optionFirst[A]: Monoid[FirstOption[A]] with Band[FirstOption[A]]
    Definition Classes
    OptionInstances
  318. implicit def optionFirstMonad: Monad[FirstOption]
    Definition Classes
    OptionInstances
  319. implicit def optionFirstOrder[A](implicit arg0: Order[A]): Order[FirstOption[A]]
    Definition Classes
    OptionInstances
  320. implicit def optionFirstShow[A](implicit arg0: Show[A]): Show[FirstOption[A]]
    Definition Classes
    OptionInstances
  321. implicit val optionInstance: Traverse[Option] with MonadPlus[Option] with BindRec[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with Align[Option] with IsEmpty[Option] with Cobind[Option] with Optional[Option]
    Definition Classes
    OptionInstances
  322. implicit def optionLast[A]: Monoid[LastOption[A]] with Band[LastOption[A]]
    Definition Classes
    OptionInstances
  323. implicit def optionLastMonad: Monad[LastOption]
    Definition Classes
    OptionInstances
  324. implicit def optionLastOrder[A](implicit arg0: Order[A]): Order[LastOption[A]]
    Definition Classes
    OptionInstances
  325. implicit def optionLastShow[A](implicit arg0: Show[A]): Show[LastOption[A]]
    Definition Classes
    OptionInstances
  326. implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]] with Band[MaxOption[A]]
    Definition Classes
    OptionInstances
  327. implicit def optionMaxMonad: Monad[MaxOption]
    Definition Classes
    OptionInstances
  328. implicit def optionMaxOrder[A](implicit arg0: Order[A]): Order[MaxOption[A]]
    Definition Classes
    OptionInstances
  329. implicit def optionMaxShow[A](implicit arg0: Show[A]): Show[MaxOption[A]]
    Definition Classes
    OptionInstances
  330. implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]] with Band[MinOption[A]]
    Definition Classes
    OptionInstances
  331. implicit def optionMinMonad: Monad[MinOption]
    Definition Classes
    OptionInstances
  332. implicit def optionMinOrder[A](implicit arg0: Order[A]): Order[MinOption[A]]
    Definition Classes
    OptionInstances
  333. implicit def optionMinShow[A](implicit arg0: Show[A]): Show[MinOption[A]]
    Definition Classes
    OptionInstances
  334. implicit def optionMonoid[A](implicit arg0: Semigroup[A]): Monoid[Option[A]]
    Definition Classes
    OptionInstances
  335. 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
  336. implicit def optionShow[A](implicit arg0: Show[A]): Show[Option[A]]
    Definition Classes
    OptionInstances
  337. 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
  338. def orderingMonoid[A]: Monoid[scala.math.Ordering[A]]
    Definition Classes
    OrderingInstances
  339. def parseBoolean(s: String): Validation[IllegalArgumentException, Boolean]
    Definition Classes
    StringFunctions
  340. def parseByte(s: String): Validation[NumberFormatException, Byte]
    Definition Classes
    StringFunctions
  341. def parseDouble(s: String): Validation[NumberFormatException, Double]
    Definition Classes
    StringFunctions
  342. def parseFloat(s: String): Validation[NumberFormatException, Float]
    Definition Classes
    StringFunctions
  343. def parseInt(s: String): Validation[NumberFormatException, Int]
    Definition Classes
    StringFunctions
  344. def parseLong(s: String): Validation[NumberFormatException, Long]
    Definition Classes
    StringFunctions
  345. def parseShort(s: String): Validation[NumberFormatException, Short]
    Definition Classes
    StringFunctions
  346. implicit val partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]
    Definition Classes
    PartialFunctionInstances
  347. 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
  348. 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
  349. 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
  350. final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
    Definition Classes
    BooleanFunctions
  351. final def powerset[A](as: List[A]): List[List[A]]
    Definition Classes
    ListFunctions
  352. def put[S](s: S): State[S, Unit]
    Definition Classes
    StateFunctions
  353. implicit val setInstance: Foldable[Set] with IsEmpty[Set]
    Definition Classes
    SetInstances
  354. implicit def setMonoid[A]: Monoid[Set[A]] with SemiLattice[Set[A]]
    Definition Classes
    SetInstances
  355. 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
  356. implicit def setShow[A](implicit arg0: Show[A]): Show[Set[A]]
    Definition Classes
    SetInstances
  357. implicit val shortInstance: Monoid[Short] with Enum[Short] with Show[Short]
    Definition Classes
    AnyValInstances
  358. implicit val shortMultiplicationNewType: Monoid[@@[Short, Multiplication]] with Enum[@@[Short, Multiplication]]
    Definition Classes
    AnyValInstances
  359. 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
  360. 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
  361. def state[S, A](a: A): State[S, A]
    Definition Classes
    StateFunctions
  362. implicit def streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]
    Definition Classes
    StreamInstances
  363. implicit val streamInstance: Traverse[Stream] with MonadPlus[Stream] with BindRec[Stream] with Zip[Stream] with Unzip[Stream] with Align[Stream] with IsEmpty[Stream] with Cobind[Stream]
    Definition Classes
    StreamInstances
  364. implicit def streamMonoid[A]: Monoid[Stream[A]]
    Definition Classes
    StreamInstances
  365. implicit def streamOrder[A](implicit A0: Order[A]): Order[Stream[A]]
    Definition Classes
    StreamInstances
  366. implicit def streamShow[A](implicit A0: Show[A]): Show[Stream[A]]
    Definition Classes
    StreamInstances
  367. 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
  368. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  369. final def tailOption[A](as: List[A]): Option[List[A]]
    Definition Classes
    ListFunctions
  370. 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
  371. 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
  372. 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
  373. 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
  374. 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
  375. final def toFailure[A, B](oa: Option[A])(b: ⇒ B): Validation[A, B]
    Definition Classes
    OptionFunctions
  376. final def toFailureNel[A, B](oa: Option[A])(b: ⇒ B): ValidationNel[A, B]
    Definition Classes
    OptionFunctions
  377. final def toLeft[A, B](oa: Option[A])(b: ⇒ B): \/[A, B]
    Definition Classes
    OptionFunctions
  378. final def toMaybe[A](oa: Option[A]): Maybe[A]
    Definition Classes
    OptionFunctions
  379. final def toNel[A](as: List[A]): Option[NonEmptyList[A]]
    Definition Classes
    ListFunctions
  380. final def toRight[A, E](oa: Option[A])(e: ⇒ E): \/[E, A]
    Definition Classes
    OptionFunctions
  381. def toString(): String
    Definition Classes
    AnyRef → Any
  382. final def toSuccess[A, E](oa: Option[A])(e: ⇒ E): Validation[E, A]
    Definition Classes
    OptionFunctions
  383. final def toSuccessNel[A, E](oa: Option[A])(e: ⇒ E): ValidationNel[E, A]
    Definition Classes
    OptionFunctions
  384. final def toZipper[A](as: Stream[A]): Option[Zipper[A]]
    Definition Classes
    StreamFunctions
  385. final def toZipper[A](as: List[A]): Option[Zipper[A]]
    Definition Classes
    ListFunctions
  386. implicit val tuple1Cozip: Cozip[Tuple1]
    Definition Classes
    TupleInstances2
  387. implicit def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]
    Definition Classes
    TupleInstances1
  388. 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
    TupleInstances1
  389. implicit def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]
    Definition Classes
    TupleInstances2
  390. implicit def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]
    Definition Classes
    TupleInstances2
  391. implicit def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]
    Definition Classes
    TupleInstances1
  392. implicit def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]
    Definition Classes
    TupleInstances2
  393. implicit val tuple2Associative: Associative[Tuple2]
    Definition Classes
    TupleInstances1
  394. implicit def tuple2BindRec[A1](implicit arg0: Semigroup[A1]): BindRec[[β$9$](A1, β$9$)]

    Product BindRec

    Product BindRec

    Definition Classes
    TupleInstances1
  395. implicit val tuple2Bitraverse: Bitraverse[Tuple2]
    Definition Classes
    TupleInstances1
  396. implicit def tuple2Cozip[A1]: Cozip[[β$16$](A1, β$16$)]
    Definition Classes
    TupleInstances2
  397. implicit def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]
    Definition Classes
    TupleInstances1
  398. implicit def tuple2Instance[A1]: Traverse[[β$0$](A1, β$0$)] with Comonad[[β$1$](A1, β$1$)]

    Product functor and comonad

    Product functor and comonad

    Definition Classes
    TupleInstances0
  399. implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[β$23$](A1, β$23$)]
    Definition Classes
    TupleInstances2
  400. implicit def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]
    Definition Classes
    TupleInstances2
  401. implicit def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]
    Definition Classes
    TupleInstances2
  402. implicit def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]
    Definition Classes
    TupleInstances1
  403. implicit def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]
    Definition Classes
    TupleInstances2
  404. implicit def tuple3BindRec[A1, A2](implicit arg0: Semigroup[A1], arg1: Semigroup[A2]): BindRec[[γ$10$](A1, A2, γ$10$)]
    Definition Classes
    TupleInstances1
  405. implicit def tuple3Cozip[A1, A2]: Cozip[[γ$17$](A1, A2, γ$17$)]
    Definition Classes
    TupleInstances2
  406. implicit def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]
    Definition Classes
    TupleInstances1
  407. implicit def tuple3Functor[A1, A2]: Traverse[[γ$3$](A1, A2, γ$3$)]
    Definition Classes
    TupleInstances0
  408. implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[γ$24$](A1, A2, γ$24$)]
    Definition Classes
    TupleInstances2
  409. implicit def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]
    Definition Classes
    TupleInstances2
  410. implicit def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]
    Definition Classes
    TupleInstances2
  411. implicit def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]
    Definition Classes
    TupleInstances1
  412. implicit def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]
    Definition Classes
    TupleInstances2
  413. implicit def tuple4BindRec[A1, A2, A3](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3]): BindRec[[δ$11$](A1, A2, A3, δ$11$)]
    Definition Classes
    TupleInstances1
  414. implicit def tuple4Cozip[A1, A2, A3]: Cozip[[δ$18$](A1, A2, A3, δ$18$)]
    Definition Classes
    TupleInstances2
  415. 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
    TupleInstances1
  416. implicit def tuple4Functor[A1, A2, A3]: Traverse[[δ$4$](A1, A2, A3, δ$4$)]
    Definition Classes
    TupleInstances0
  417. implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[δ$25$](A1, A2, A3, δ$25$)]
    Definition Classes
    TupleInstances2
  418. 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
    TupleInstances2
  419. 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
    TupleInstances2
  420. 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
    TupleInstances1
  421. 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
    TupleInstances2
  422. implicit def tuple5BindRec[A1, A2, A3, A4](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4]): BindRec[[ε$12$](A1, A2, A3, A4, ε$12$)]