Object

scalaz

Scalaz

Related Doc: package scalaz

Permalink

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

Type Members

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

    Permalink
    Definition Classes
    ToApplicativeOps0
  2. type BuildKeyConstraint[K] = DummyImplicit

    Permalink

    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]

    Permalink
    Definition Classes
    ToFunctorOps0
  4. type Id[X] = X

    Permalink

    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]

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

    Permalink
    Definition Classes
    ToFunctorOps0
  7. final class UnzipPairOps[F[_], A, B] extends AnyRef

    Permalink
    Definition Classes
    ToUnzipOps0
  8. type XMap[K, +V] = Map[K, V]

    Permalink
    Definition Classes
    MapSubMapMapSub

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. val <:<: Category[<:<]

    Permalink
    Definition Classes
    TypeConstraintInstances
  4. final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B

    Permalink

    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[=:=]

    Permalink
    Definition Classes
    TypeConstraintInstances
  6. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  7. implicit def ApplicativeIdV[A](v: ⇒ A): ApplicativeIdV[A]

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

    Permalink
    Definition Classes
    BigDecimalInstances
  9. implicit def MonadTransGFGA[F[_[_], _], G[_], A](gfga: G[F[G, A]]): MonadTransGFGA[F, G, A]

    Permalink
    Definition Classes
    ToMonadTransOps
  10. implicit def ToAlignOps[F[_], A](v: F[A])(implicit F0: Align[F]): AlignOps[F, A]

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

    Permalink
    Definition Classes
    ToAlignOpsU
  12. implicit def ToApplicativeOps[F[_], A](v: F[A])(implicit F0: Applicative[F]): ApplicativeOps[F, A]

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

    Permalink
    Definition Classes
    ToApplicativeOpsU
  14. implicit def ToApplicativePlusOps[F[_], A](v: F[A])(implicit F0: ApplicativePlus[F]): ApplicativePlusOps[F, A]

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

    Permalink
    Definition Classes
    ToApplicativePlusOpsU
  16. implicit def ToApplyOps[F[_], A](v: F[A])(implicit F0: Apply[F]): ApplyOps[F, A]

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

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

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

    Permalink
    Definition Classes
    ToArrowOpsU
  20. 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]

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

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

    Permalink
    Definition Classes
    ToAssociativeOpsU
  23. implicit def ToAssociativeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Associative[[β$0$, γ$1$]F[G, β$0$, γ$1$]]): AssociativeOps[[β$2$, γ$3$]F[G, β$2$, γ$3$], A, B]

    Permalink
    Definition Classes
    ToAssociativeOps0
  24. implicit def ToBandOps[F](v: F)(implicit F0: Band[F]): BandOps[F]

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

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

    Permalink
    Definition Classes
    ToBifoldableOpsU
  27. 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]

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

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

    Permalink
    Definition Classes
    ToBifunctorOpsU
  30. 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]

    Permalink
    Definition Classes
    ToBifunctorOps0
  31. implicit def ToBindOps[F[_], A](v: F[A])(implicit F0: Bind[F]): BindOps[F, A]

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

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

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

    Permalink
    Definition Classes
    ToBitraverseOpsU
  35. 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]

    Permalink
    Definition Classes
    ToBitraverseOps0
  36. implicit def ToBooleanOps2FromBoolean(a: Boolean): BooleanOps2

    Permalink
    Definition Classes
    ToBooleanOps
  37. implicit def ToBooleanOpsFromBoolean(a: Boolean): BooleanOps

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

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

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

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

    Permalink
    Definition Classes
    ToCategoryOpsU
  42. 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]

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

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

    Permalink
    Definition Classes
    ToChoiceOpsU
  45. 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]

    Permalink
    Definition Classes
    ToChoiceOps0
  46. implicit def ToComonadOps[F[_], A](v: F[A])(implicit F0: Comonad[F]): ComonadOps[F, A]

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

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

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

    Permalink
    Definition Classes
    ToComposeOpsU
  50. 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]

    Permalink
    Definition Classes
    ToComposeOps0
  51. implicit def ToContTOps[M[_], A](ma: M[A]): ContTOps[M, A]

    Permalink
    Definition Classes
    ToContTOps
  52. implicit def ToContravariantOps[F[_], A](v: F[A])(implicit F0: Contravariant[F]): ContravariantOps[F, A]

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

    Permalink
    Definition Classes
    ToContravariantOpsU
  54. implicit def ToCozipOps[F[_], A](v: F[A])(implicit F0: Cozip[F]): CozipOps[F, A]

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

    Permalink
    Definition Classes
    ToCozipOpsU
  56. implicit def ToEitherOps[A](a: A): EitherOps[A]

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

    Permalink
    Definition Classes
    ToEitherOps
  58. implicit def ToEitherTOps[A](a: A): EitherTOps[A]

    Permalink
    Definition Classes
    ToEitherTOps
  59. implicit def ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]

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

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

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

    Permalink
    Definition Classes
    ToFoldable1OpsU
  63. implicit def ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]

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

    Permalink
    Definition Classes
    ToFoldableOpsU
  65. implicit def ToFunction1OpsFromBoolean[A, B](f: (A) ⇒ B): Function1Ops[A, B]

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

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

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

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

    Permalink
    Definition Classes
    ToFunctorOpsU
  70. implicit def ToIdOps[A](a: A): IdOps[A]

    Permalink
    Definition Classes
    ToIdOps
  71. implicit def ToKleisliFAOps[F[_], A](fa: F[A]): KleisliFAOps[F, A]

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

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

    Permalink
    Definition Classes
    ToKleisliOps0
  74. implicit def ToLiftV[F[_], A, B](v: (A) ⇒ B): LiftV[F, A, B]

    Permalink
    Definition Classes
    ToFunctorOps0
  75. implicit def ToListOpsFromList[A](a: List[A]): ListOps[A]

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

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

    Permalink
    Definition Classes
    ToMaybeOps
  78. implicit def ToMonadErrorIdOps[E](v: E): MonadErrorIdOps[E]

    Permalink
    Definition Classes
    ToMonadErrorOps0
  79. implicit def ToMonadErrorOps[F[_], S, A](v: F[A])(implicit F0: MonadError[F, S]): MonadErrorOps[F, S, A]

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

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

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

    Permalink
    Definition Classes
    ToMonadOpsU
  83. implicit def ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]

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

    Permalink
    Definition Classes
    ToMonadPlusOpsU
  85. implicit def ToMonadTellOps[F[_], S, A](v: F[A])(implicit F0: MonadTell[F, S]): MonadTellOps[F, S, A]

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

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

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

    Permalink
    Definition Classes
    ToOptionIdOps
  89. implicit def ToOptionOps2FromOption[A](a: Option[A]): OptionOps2[A]

    Permalink
    Definition Classes
    ToOptionOps
  90. implicit def ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]

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

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

    Permalink
    Definition Classes
    ToOptionalOpsU
  93. implicit def ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]

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

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

    Permalink
    Definition Classes
    ToPlusEmptyOpsU
  96. implicit def ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]

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

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

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

    Permalink
    Definition Classes
    ToProfunctorOpsU
  100. 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]

    Permalink
    Definition Classes
    ToProfunctorOps0
  101. implicit def ToReducerOps[A](a: A): ReducerOps[A]

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

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

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

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

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

    Permalink
    Definition Classes
    ToSplitOpsU
  107. 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]

    Permalink
    Definition Classes
    ToSplitOps0
  108. implicit def ToStateOps[A](a: A): StateOps[A]

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

    Permalink
    Definition Classes
    ToStreamOps
  110. implicit def ToStrictTreeOps[A](a: A): StrictTreeOps[A]

    Permalink
    Definition Classes
    ToStrictTreeOps
  111. implicit def ToStringOpsFromString(a: String): StringOps

    Permalink
    Definition Classes
    ToStringOps
  112. implicit def ToStrongOps[F[_, _], A, B](v: F[A, B])(implicit F0: Strong[F]): StrongOps[F, A, B]

    Permalink
    Definition Classes
    ToStrongOps0
  113. implicit def ToStrongOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Strong, FA]): StrongOps[M, A, B]

    Permalink
    Definition Classes
    ToStrongOpsU
  114. 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]

    Permalink
    Definition Classes
    ToStrongOps0
  115. implicit def ToTheseOps[A](a: A): TheseOps[A]

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

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

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

    Permalink
    Definition Classes
    ToTraverse1OpsU
  119. implicit def ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]

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

    Permalink
    Definition Classes
    ToTraverseOpsU
  121. implicit def ToTreeOps[A](a: A): TreeOps[A]

    Permalink
    Definition Classes
    ToTreeOps
  122. implicit def ToTryOpsFromTry[A](a: Try[A]): TryOps[A]

    Permalink
    Definition Classes
    ToTryOps
  123. 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]

    Permalink
    Definition Classes
    ToTupleOps
  124. 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]

    Permalink
    Definition Classes
    ToTupleOps
  125. 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]

    Permalink
    Definition Classes
    ToTupleOps
  126. implicit def ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]

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

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

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

    Permalink
    Definition Classes
    ToTupleOps
  130. implicit def ToTuple6Ops[A, B, C, D, E, F](t: (A, B, C, D, E, F)): Tuple6Ops[A, B, C, D, E, F]

    Permalink
    Definition Classes
    ToTupleOps
  131. 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]

    Permalink
    Definition Classes
    ToTupleOps
  132. 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]

    Permalink
    Definition Classes
    ToTupleOps
  133. 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]

    Permalink
    Definition Classes
    ToTupleOps
  134. implicit def ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]

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

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

    Permalink
    Definition Classes
    ToUnzipOps0
  137. implicit def ToValidationOps[A](a: A): ValidationOps[A]

    Permalink
    Definition Classes
    ToValidationOps
  138. implicit def ToVectorOpsFromVector[A](a: Vector[A]): VectorOps[A]

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

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

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

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

    Permalink
    Definition Classes
    ToApplyOps0
  143. 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]

    Permalink
    Definition Classes
    ToApplyOps0
  144. 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]

    Permalink
    Definition Classes
    ToApplyOps0
  145. 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]

    Permalink
    Definition Classes
    ToApplyOps0
  146. 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]

    Permalink
    Definition Classes
    ToApplyOps0
  147. 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]

    Permalink
    Definition Classes
    ToApplyOps0
  148. final def ab_+[K, V](m: XMap[K, V], k: K, v: V)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    Permalink

    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
  149. final def ab_-[K, V](m: XMap[K, V], k: K)(implicit arg0: BuildKeyConstraint[K]): XMap[K, V]

    Permalink

    As with ab_+, but with MapLike#-.

    As with ab_+, but with MapLike#-.

    Attributes
    protected
    Definition Classes
    MapSubMapMapSub
  150. final def adjacentPairs[A](as: List[A]): List[(A, A)]

    Permalink

    [(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
  151. final def allPairs[A](as: List[A]): List[(A, A)]

    Permalink

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

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

    Definition Classes
    ListFunctions
  152. final def alter[K, A](m: XMap[K, A], k: K)(f: (Option[A]) ⇒ Option[A])(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    Vary the value of m get k.

    Vary the value of m get k.

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyValInstances
  162. final def breakM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    Permalink

    spanM with p's complement.

    spanM with p's complement.

    Definition Classes
    ListFunctions
  163. final def buildXMap[K, V, K2, V2](implicit arg0: BuildKeyConstraint[K2]): CanBuildFrom[XMap[K, V], (K2, V2), XMap[K2, V2]]

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

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

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

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

    Permalink
    Definition Classes
    CallableInstances
  168. final def cata[A, X](oa: Option[A])(some: (A) ⇒ X, none: ⇒ X): X

    Permalink

    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
  169. implicit val char: Monoid[Char] with Enum[Char] with Show[Char]

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

    Permalink
    Definition Classes
    AnyValInstances
  171. def charsNel(s: String, e: ⇒ NonEmptyList[Char]): NonEmptyList[Char]

    Permalink

    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
  172. def charsNel(s: String): Option[NonEmptyList[Char]]

    Permalink

    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
  173. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  174. final def conditional(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    Conditional.

    Conditional.

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

    Permalink

    Conjunction.

    Conjunction. (AND)

    p q  p ∧ q
    0 0  0
    0 1  0
    1 0  0
    1 1  1
    Definition Classes
    BooleanFunctions
  176. def constantIndexedState[S1, S2, A](a: A, s: ⇒ S2): IndexedState[S1, S2, A]

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

    Permalink
    Definition Classes
    StateFunctions
  178. implicit val dayOfWeekInstance: Enum[DayOfWeek]

    Permalink
    Definition Classes
    TimeInstances0
  179. final def disjunction(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    Disjunction.

    Disjunction. (OR)

    p q  p ∨ q
    0 0  0
    0 1  1
    1 0  1
    1 1  1
    Definition Classes
    BooleanFunctions
  180. implicit val doubleInstance: Order[Double] with Show[Double]

    Permalink
    Definition Classes
    AnyValInstances
  181. implicit val durationInstance: Monoid[Duration] with Order[Duration]

    Permalink
    Definition Classes
    TimeInstances
  182. implicit def eitherAssociative: Associative[Either]

    Permalink
    Definition Classes
    EitherInstances
  183. implicit def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]

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

    Permalink
    Definition Classes
    EitherInstances
  185. 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$]]

    Permalink

    Right biased monad

    Right biased monad

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

    Permalink
    Definition Classes
    EitherInstances
  187. implicit def eitherShow[A, B](implicit SA: Show[A], SB: Show[B]): Show[Either[A, B]]

    Permalink
    Definition Classes
    EitherInstances
  188. final def emptyOrPure[M[_], A](cond: Boolean)(a: ⇒ A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

    Permalink

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

    Permalink
    Definition Classes
    BooleanFunctions
  190. implicit def enumInstance[E <: java.lang.Enum[E]](implicit arg0: ClassTag[E]): Enum[E]

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

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

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

    Permalink
    Definition Classes
    ListFunctions
  194. def finalize(): Unit

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

    Permalink

    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
  196. final def fix[A](f: (⇒ A) ⇒ A): A

    Permalink

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

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

    Definition Classes
    FunctionFunctions
    Since

    7.0.1

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

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

    Permalink

    returns

    t if cond is true, f otherwise

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

    Permalink

    Alias for cata

    Alias for cata

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

    Permalink

    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
  201. final def foldLiftOpt[A, B](oa: Option[A])(b: ⇒ B, k: (Option[A]) ⇒ B): B

    Permalink

    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
  202. implicit def function0Equal[R](implicit arg0: Equal[R]): Equal[() ⇒ R]

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

    Permalink
    Definition Classes
    FunctionInstances
  204. implicit def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[β$0$](A) ⇒ β$0$]

    Permalink
    Definition Classes
    FunctionInstances1
  205. implicit def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[β$1$](A) ⇒ β$1$]

    Permalink
    Definition Classes
    FunctionInstances0
  206. implicit def function1Contravariant[R]: Contravariant[[α$22$](α$22$) ⇒ R]

    Permalink
    Definition Classes
    FunctionInstances
  207. 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$]

    Permalink
    Definition Classes
    FunctionInstances
  208. 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$]

    Permalink
    Definition Classes
    FunctionInstances0
  209. implicit val function1Instance: Arrow[Function1] with Choice[Function1] with ProChoice[Function1]

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

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

    Permalink
    Definition Classes
    FunctionInstances1
  212. implicit def function2Instance[T1, T2]: Monad[[γ$24$](T1, T2) ⇒ γ$24$] with BindRec[[γ$25$](T1, T2) ⇒ γ$25$]

    Permalink
    Definition Classes
    FunctionInstances
  213. implicit def function3Instance[T1, T2, T3]: Monad[[δ$28$](T1, T2, T3) ⇒ δ$28$] with BindRec[[δ$29$](T1, T2, T3) ⇒ δ$29$]

    Permalink
    Definition Classes
    FunctionInstances
  214. implicit def function4Instance[T1, T2, T3, T4]: Monad[[ε$32$](T1, T2, T3, T4) ⇒ ε$32$] with BindRec[[ε$33$](T1, T2, T3, T4) ⇒ ε$33$]

    Permalink
    Definition Classes
    FunctionInstances
  215. 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$]

    Permalink
    Definition Classes
    FunctionInstances
  216. 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$]

    Permalink
    Definition Classes
    FunctionInstances
  217. 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$]

    Permalink
    Definition Classes
    FunctionInstances
  218. 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$]

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

    Permalink

    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
  220. implicit def futureInstance(implicit ec: ExecutionContext): Nondeterminism[Future] with Cobind[Future] with MonadError[Future, Throwable] with Catchable[Future]

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

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

    Permalink
    Definition Classes
    FutureInstances1
  223. def get[S]: State[S, S]

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

    Permalink
    Definition Classes
    AnyRef → Any
  225. final def getOrAdd[F[_], K, A](m: XMap[K, A], k: K)(fa: ⇒ F[A])(implicit arg0: BuildKeyConstraint[K], F: Applicative[F]): F[(XMap[K, A], A)]

    Permalink

    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
  226. final def getOrElseF[A, F[_]](oa: Option[A])(fa: ⇒ F[A])(implicit arg0: Applicative[F]): F[A]

    Permalink

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

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

    Definition Classes
    OptionFunctions
  227. def gets[S, T](f: (S) ⇒ T): State[S, T]

    Permalink
    Definition Classes
    StateFunctions
  228. final def groupBy1[A, B](as: List[A])(f: (A) ⇒ B): Map[B, NonEmptyList[A]]

    Permalink

    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
  229. final def groupWhen[A](as: List[A])(p: (A, A) ⇒ Boolean): List[NonEmptyList[A]]

    Permalink

    groupWhenM specialized to scalaz.Id.Id.

    groupWhenM specialized to scalaz.Id.Id.

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

    Permalink

    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
  231. def hashCode(): Int

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

    Permalink

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

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

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

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

    Permalink
    Definition Classes
    IndexedStateFunctions
  235. 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]

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

    Permalink
    Definition Classes
    StateFunctions
  237. final def initz[A](as: List[A]): List[List[A]]

    Permalink

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

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

    Definition Classes
    ListFunctions
  238. final def insertWith[K, A](m1: XMap[K, A], k: K, v: A)(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    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
  239. implicit val instantInstance: Order[Instant]

    Permalink
    Definition Classes
    TimeInstances
  240. implicit val intInstance: Monoid[Int] with Enum[Int] with Show[Int]

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

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

    Permalink
    Definition Classes
    StreamFunctions
  243. 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]

    Permalink

    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
  244. 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]

    Permalink

    Like intersectWith, but tell f about the key.

    Like intersectWith, but tell f about the key.

    Definition Classes
    MapSubFunctions
  245. final def intersperse[A](as: Stream[A], a: A): Stream[A]

    Permalink

    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
  246. final def intersperse[A](as: List[A], a: A): List[A]

    Permalink

    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
  247. final def inverseConditional(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    Inverse Conditional.

    Inverse Conditional.

    p q  p <-- q
    0 0  1
    0 1  0
    1 0  1
    1 1  1
    Definition Classes
    BooleanFunctions
  248. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  249. implicit val javaBigDecimalInstance: Show[BigDecimal] with Equal[BigDecimal]

    Permalink
    Definition Classes
    BigDecimalInstances
  250. implicit def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]

    Permalink
    Definition Classes
    ListInstances0
  251. 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]

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

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

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

    Permalink
    Definition Classes
    ListInstances
  255. implicit val localDateInstance: Enum[LocalDate]

    Permalink
    Definition Classes
    TimeInstances
  256. implicit val localDateTimeInstance: Order[LocalDateTime]

    Permalink
    Definition Classes
    TimeInstances0
  257. implicit val localTimeInstance: Order[LocalTime]

    Permalink
    Definition Classes
    TimeInstances
  258. implicit val longInstance: Monoid[Long] with Enum[Long] with Show[Long]

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

    Permalink
    Definition Classes
    AnyValInstances
  260. final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    Permalink

    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
  261. final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])

    Permalink

    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
  262. implicit def mapBand[K, V](implicit B: BuildKeyConstraint[K], S: Band[V]): Band[XMap[K, V]]

    Permalink
    Definition Classes
    MapSubInstances0
  263. implicit val mapEntryBitraverse: Bitraverse[Entry]

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

    Permalink
    Definition Classes
    MapSubInstances0
  265. implicit def mapFoldable[K]: Foldable[[β$1$]XMap[K, β$1$]]

    Permalink
    Definition Classes
    MapSubInstances0
  266. 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$]]

    Permalink

    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
  267. final def mapKeys[K, K2, A](m: XMap[K, A])(f: (K) ⇒ K2)(implicit arg0: BuildKeyConstraint[K2]): XMap[K2, A]

    Permalink

    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
  268. implicit def mapMonoid[K, V](implicit S: Semigroup[V], B: BuildKeyConstraint[K]): Monoid[XMap[K, V]]

    Permalink

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

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

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

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

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

    Permalink
    Definition Classes
    ToPlusEmptyOps0
  272. def modify[S](f: (S) ⇒ S): State[S, Unit]

    Permalink
    Definition Classes
    StateFunctions
  273. implicit val monthDayInstance: Order[MonthDay]

    Permalink
    Definition Classes
    TimeInstances
  274. implicit val monthInstance: Enum[Month]

    Permalink
    Definition Classes
    TimeInstances
  275. def mzero[F](implicit F: Monoid[F]): F

    Permalink
    Definition Classes
    ToMonoidOps
  276. final def nand(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    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
  277. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  278. final def negConditional(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    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
  279. final def negInverseConditional(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    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
  280. final def nil[A]: List[A]

    Permalink

    scala.Nil with a sometimes more convenient type

    scala.Nil with a sometimes more convenient type

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

    Permalink

    scala.None with a sometimes more convenient type.

    scala.None with a sometimes more convenient type.

    Definition Classes
    OptionFunctions
  282. final def nor(p: Boolean, q: ⇒ Boolean): Boolean

    Permalink

    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
  283. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  284. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  285. implicit val offsetDateTimeInstance: Order[OffsetDateTime]

    Permalink
    Definition Classes
    TimeInstances0
  286. implicit val offsetTimeInstance: Order[OffsetTime]

    Permalink
    Definition Classes
    TimeInstances0
  287. final def option[A](cond: Boolean, a: ⇒ A): Option[A]

    Permalink

    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
  288. implicit def optionBand[A](implicit arg0: Band[A]): Band[Option[A]]

    Permalink
    Definition Classes
    OptionInstances1
  289. implicit def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]

    Permalink
    Definition Classes
    OptionInstances0
  290. implicit def optionFirst[A]: Monoid[FirstOption[A]] with Band[FirstOption[A]]

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

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

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

    Permalink
    Definition Classes
    OptionInstances
  294. 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]

    Permalink
    Definition Classes
    OptionInstances
  295. implicit def optionLast[A]: Monoid[LastOption[A]] with Band[LastOption[A]]

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

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

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

    Permalink
    Definition Classes
    OptionInstances
  299. implicit def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]] with Band[MaxOption[A]]

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

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

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

    Permalink
    Definition Classes
    OptionInstances
  303. implicit def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]] with Band[MinOption[A]]

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

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

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

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

    Permalink
    Definition Classes
    OptionInstances
  308. implicit def optionOrder[A](implicit A0: Order[A]): Order[Option[A]]

    Permalink

    Add None as an element less than all As.

    Add None as an element less than all As.

    Definition Classes
    OptionInstances
  309. implicit def optionSemiLattice[A](implicit arg0: SemiLattice[A]): SemiLattice[Option[A]]

    Permalink
    Definition Classes
    OptionInstances0
  310. implicit def optionShow[A](implicit arg0: Show[A]): Show[Option[A]]

    Permalink
    Definition Classes
    OptionInstances
  311. final def orEmpty[A, M[_]](oa: Option[A])(implicit arg0: Applicative[M], arg1: PlusEmpty[M]): M[A]

    Permalink

    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
  312. def orderingMonoid[A]: Monoid[scala.math.Ordering[A]]

    Permalink
    Definition Classes
    OrderingInstances
  313. def parseBigDecimal(s: String): Validation[String, BigDecimal]

    Permalink
    Definition Classes
    StringFunctions
  314. def parseBigInt(s: String): Validation[String, BigInteger]

    Permalink
    Definition Classes
    StringFunctions
  315. def parseBoolean(s: String): Validation[String, Boolean]

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

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

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

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

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

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

    Permalink
    Definition Classes
    StringFunctions
  322. implicit val partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]

    Permalink
    Definition Classes
    PartialFunctionInstances
  323. final def partitionM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]

    Permalink

    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
  324. implicit val periodInstance: Monoid[Period] with Equal[Period]

    Permalink
    Definition Classes
    TimeInstances
  325. def plural(s: String, n: Long): String

    Permalink

    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
  326. final def pointOrEmpty[M[_], A](cond: Boolean)(a: ⇒ A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

    Permalink

    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
  327. final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]

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

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

    Permalink
    Definition Classes
    StateFunctions
  330. implicit val setInstance: Foldable[Set] with IsEmpty[Set]

    Permalink
    Definition Classes
    SetInstances
  331. implicit def setMonoid[A]: Monoid[Set[A]] with SemiLattice[Set[A]]

    Permalink
    Definition Classes
    SetInstances
  332. implicit def setOrder[A](implicit arg0: Order[A]): Order[Set[A]]

    Permalink

    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
  333. implicit def setShow[A](implicit arg0: Show[A]): Show[Set[A]]

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

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

    Permalink
    Definition Classes
    AnyValInstances
  336. implicit final def showInterpolator(sc: StringContext): ShowInterpolator

    Permalink
    Definition Classes
    ToShowOps
  337. final def some[A](a: A): Option[A]

    Permalink

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

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

    Definition Classes
    OptionFunctions
  338. final def spanM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]

    Permalink

    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
  339. def state[S, A](a: A): State[S, A]

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

    Permalink
    Definition Classes
    StreamInstances
  341. 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]

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

    Permalink
    Definition Classes
    StreamInstances
  343. implicit def streamOrder[A](implicit A0: Order[A]): Order[Stream[A]]

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

    Permalink
    Definition Classes
    StreamInstances
  345. implicit val streamZipApplicative: Applicative[[α]TagKind.@@[Stream[α], Tags.Zip]]

    Permalink

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

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

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

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

    Permalink

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

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

    Definition Classes
    StreamFunctions
  350. final def tailz[A](as: List[A]): List[List[A]]

    Permalink

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

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

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

    Permalink

    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
  352. final def takeWhileM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]

    Permalink

    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
  353. def test(p: Boolean): Int

    Permalink

    Returns 1 if p is true, or 0 otherwise.

    Returns 1 if p is true, or 0 otherwise.

    Definition Classes
    BooleanFunctions
  354. final def toFailure[A, B](oa: Option[A])(b: ⇒ B): Validation[A, B]

    Permalink
    Definition Classes
    OptionFunctions
  355. final def toFailureNel[A, B](oa: Option[A])(b: ⇒ B): ValidationNel[A, B]

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

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

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

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

    Permalink
    Definition Classes
    OptionFunctions
  360. def toString(): String

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

    Permalink
    Definition Classes
    OptionFunctions
  362. final def toSuccessNel[A, E](oa: Option[A])(e: ⇒ E): ValidationNel[E, A]

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

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

    Permalink
    Definition Classes
    ListFunctions
  365. implicit def tuple1Band[A1](implicit A1: Band[A1]): Band[(A1)]

    Permalink
    Definition Classes
    TupleInstances0
  366. implicit val tuple1Cozip: Cozip[Tuple1]

    Permalink
    Definition Classes
    TupleInstances2
  367. implicit def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]

    Permalink
    Definition Classes
    TupleInstances1
  368. implicit val tuple1Instance: Traverse[Tuple1] with Monad[Tuple1] with Comonad[Tuple1]

    Permalink

    Tuple1[A] is isomorphic to Id[X]

    Tuple1[A] is isomorphic to Id[X]

    Definition Classes
    TupleInstances1
  369. implicit def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]

    Permalink
    Definition Classes
    TupleInstances2
  370. implicit def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]

    Permalink
    Definition Classes
    TupleInstances2
  371. implicit def tuple1SemiLattice[A1](implicit A1: SemiLattice[A1]): SemiLattice[(A1)]

    Permalink
    Definition Classes
    TupleInstances2
  372. implicit def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]

    Permalink
    Definition Classes
    TupleInstances1
  373. implicit def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]

    Permalink
    Definition Classes
    TupleInstances2
  374. implicit val tuple2Associative: Associative[Tuple2]

    Permalink
    Definition Classes
    TupleInstances1
  375. implicit def tuple2Band[A1, A2](implicit A1: Band[A1], A2: Band[A2]): Band[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances0
  376. implicit def tuple2BindRec[A1](implicit arg0: Semigroup[A1]): BindRec[[β$9$](A1, β$9$)]

    Permalink

    Product BindRec

    Product BindRec

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

    Permalink
    Definition Classes
    TupleInstances1
  378. implicit def tuple2Cozip[A1]: Cozip[[β$16$](A1, β$16$)]

    Permalink
    Definition Classes
    TupleInstances2
  379. implicit def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances1
  380. implicit def tuple2Instance[A1]: Traverse[[β$0$](A1, β$0$)] with Comonad[[β$1$](A1, β$1$)]

    Permalink

    Product functor and comonad

    Product functor and comonad

    Definition Classes
    TupleInstances0
  381. implicit def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[β$23$](A1, β$23$)]

    Permalink
    Definition Classes
    TupleInstances2
  382. implicit def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances2
  383. implicit def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances2
  384. implicit def tuple2SemiLattice[A1, A2](implicit A1: SemiLattice[A1], A2: SemiLattice[A2]): SemiLattice[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances2
  385. implicit def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances1
  386. implicit def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]

    Permalink
    Definition Classes
    TupleInstances2
  387. implicit def tuple3Band[A1, A2, A3](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3]): Band[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances0
  388. implicit def tuple3BindRec[A1, A2](implicit arg0: Semigroup[A1], arg1: Semigroup[A2]): BindRec[[γ$10$](A1, A2, γ$10$)]

    Permalink
    Definition Classes
    TupleInstances1
  389. implicit def tuple3Cozip[A1, A2]: Cozip[[γ$17$](A1, A2, γ$17$)]

    Permalink
    Definition Classes
    TupleInstances2
  390. implicit def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances1
  391. implicit def tuple3Functor[A1, A2]: Traverse[[γ$3$](A1, A2, γ$3$)]

    Permalink
    Definition Classes
    TupleInstances0
  392. implicit def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[γ$24$](A1, A2, γ$24$)]

    Permalink
    Definition Classes
    TupleInstances2
  393. implicit def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances2
  394. implicit def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances2
  395. implicit def tuple3SemiLattice[A1, A2, A3](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3]): SemiLattice[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances2
  396. implicit def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances1
  397. implicit def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]

    Permalink
    Definition Classes
    TupleInstances2
  398. implicit def tuple4Band[A1, A2, A3, A4](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4]): Band[(A1, A2, A3, A4)]

    Permalink
    Definition Classes
    TupleInstances0
  399. implicit def tuple4BindRec[A1, A2, A3](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3]): BindRec[[δ$11$](A1, A2, A3, δ$11$)]

    Permalink
    Definition Classes
    TupleInstances1
  400. implicit def tuple4Cozip[A1, A2, A3]: Cozip[[δ$18$](A1, A2, A3, δ$18$)]

    Permalink
    Definition Classes
    TupleInstances2
  401. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  402. implicit def tuple4Functor[A1, A2, A3]: Traverse[[δ$4$](A1, A2, A3, δ$4$)]

    Permalink
    Definition Classes
    TupleInstances0
  403. implicit def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[δ$25$](A1, A2, A3, δ$25$)]

    Permalink
    Definition Classes
    TupleInstances2
  404. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  405. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  406. implicit def tuple4SemiLattice[A1, A2, A3, A4](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4]): SemiLattice[(A1, A2, A3, A4)]

    Permalink
    Definition Classes
    TupleInstances2
  407. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  408. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  409. implicit def tuple5Band[A1, A2, A3, A4, A5](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5]): Band[(A1, A2, A3, A4, A5)]

    Permalink
    Definition Classes
    TupleInstances0
  410. 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$)]

    Permalink
    Definition Classes
    TupleInstances1
  411. implicit def tuple5Cozip[A1, A2, A3, A4]: Cozip[[ε$19$](A1, A2, A3, A4, ε$19$)]

    Permalink
    Definition Classes
    TupleInstances2
  412. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  413. implicit def tuple5Functor[A1, A2, A3, A4]: Traverse[[ε$5$](A1, A2, A3, A4, ε$5$)]

    Permalink
    Definition Classes
    TupleInstances0
  414. implicit def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[ε$26$](A1, A2, A3, A4, ε$26$)]

    Permalink
    Definition Classes
    TupleInstances2
  415. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  416. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  417. implicit def tuple5SemiLattice[A1, A2, A3, A4, A5](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5]): SemiLattice[(A1, A2, A3, A4, A5)]

    Permalink
    Definition Classes
    TupleInstances2
  418. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  419. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  420. implicit def tuple6Band[A1, A2, A3, A4, A5, A6](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6]): Band[(A1, A2, A3, A4, A5, A6)]

    Permalink
    Definition Classes
    TupleInstances0
  421. implicit def tuple6BindRec[A1, A2, A3, A4, A5](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5]): BindRec[[ζ$13$](A1, A2, A3, A4, A5, ζ$13$)]

    Permalink
    Definition Classes
    TupleInstances1
  422. implicit def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[ζ$20$](A1, A2, A3, A4, A5, ζ$20$)]

    Permalink
    Definition Classes
    TupleInstances2
  423. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  424. implicit def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[ζ$6$](A1, A2, A3, A4, A5, ζ$6$)]

    Permalink
    Definition Classes
    TupleInstances0
  425. implicit def tuple6Monad[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monad[[ζ$27$](A1, A2, A3, A4, A5, ζ$27$)]

    Permalink
    Definition Classes
    TupleInstances2
  426. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  427. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  428. implicit def tuple6SemiLattice[A1, A2, A3, A4, A5, A6](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6]): SemiLattice[(A1, A2, A3, A4, A5, A6)]

    Permalink
    Definition Classes
    TupleInstances2
  429. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  430. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  431. implicit def tuple7Band[A1, A2, A3, A4, A5, A6, A7](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6], A7: Band[A7]): Band[(A1, A2, A3, A4, A5, A6, A7)]

    Permalink
    Definition Classes
    TupleInstances0
  432. implicit def tuple7BindRec[A1, A2, A3, A4, A5, A6](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6]): BindRec[[η$14$](A1, A2, A3, A4, A5, A6, η$14$)]

    Permalink
    Definition Classes
    TupleInstances1
  433. implicit def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[η$21$](A1, A2, A3, A4, A5, A6, η$21$)]

    Permalink
    Definition Classes
    TupleInstances2
  434. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  435. implicit def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[η$7$](A1, A2, A3, A4, A5, A6, η$7$)]

    Permalink
    Definition Classes
    TupleInstances0
  436. implicit def tuple7Monad[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monad[[η$28$](A1, A2, A3, A4, A5, A6, η$28$)]

    Permalink
    Definition Classes
    TupleInstances2
  437. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  438. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  439. implicit def tuple7SemiLattice[A1, A2, A3, A4, A5, A6, A7](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6], A7: SemiLattice[A7]): SemiLattice[(A1, A2, A3, A4, A5, A6, A7)]

    Permalink
    Definition Classes
    TupleInstances2
  440. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  441. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  442. implicit def tuple8Band[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3], A4: Band[A4], A5: Band[A5], A6: Band[A6], A7: Band[A7], A8: Band[A8]): Band[(A1, A2, A3, A4, A5, A6, A7, A8)]

    Permalink
    Definition Classes
    TupleInstances0
  443. implicit def tuple8BindRec[A1, A2, A3, A4, A5, A6, A7](implicit arg0: Semigroup[A1], arg1: Semigroup[A2], arg2: Semigroup[A3], arg3: Semigroup[A4], arg4: Semigroup[A5], arg5: Semigroup[A6], arg6: Semigroup[A7]): BindRec[[θ$15$](A1, A2, A3, A4, A5, A6, A7, θ$15$)]

    Permalink
    Definition Classes
    TupleInstances1
  444. implicit def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[θ$22$](A1, A2, A3, A4, A5, A6, A7, θ$22$)]

    Permalink
    Definition Classes
    TupleInstances2
  445. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  446. implicit def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[θ$8$](A1, A2, A3, A4, A5, A6, A7, θ$8$)]

    Permalink
    Definition Classes
    TupleInstances0
  447. implicit def tuple8Monad[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monad[[θ$29$](A1, A2, A3, A4, A5, A6, A7, θ$29$)]

    Permalink
    Definition Classes
    TupleInstances2
  448. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  449. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  450. implicit def tuple8SemiLattice[A1, A2, A3, A4, A5, A6, A7, A8](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3], A4: SemiLattice[A4], A5: SemiLattice[A5], A6: SemiLattice[A6], A7: SemiLattice[A7], A8: SemiLattice[A8]): SemiLattice[(A1, A2, A3, A4, A5, A6, A7, A8)]

    Permalink
    Definition Classes
    TupleInstances2
  451. 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)]

    Permalink
    Definition Classes
    TupleInstances1
  452. 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)]

    Permalink
    Definition Classes
    TupleInstances2
  453. def unfold[A, B](seed: A)(f: (A) ⇒ Option[(B, A)]): Stream[B]

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

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

    Permalink
    Definition Classes
    StreamFunctions
  456. def unfoldm[A, B](seed: A)(f: (A) ⇒ Maybe[(B, A)]): Stream[B]

    Permalink
    Definition Classes
    StreamFunctions
  457. final def unionWith[K, A](m1: XMap[K, A], m2: XMap[K, A])(f: (A, A) ⇒ A)(implicit arg0: BuildKeyConstraint[K]): XMap[K, A]

    Permalink

    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).

  458. 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]

    Permalink

    Like unionWith, but telling f about the key.

    Like unionWith, but telling f about the key.

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

    Permalink
    Definition Classes
    AnyValInstances
  460. final def unless(cond: Boolean)(f: ⇒ Unit): Unit

    Permalink

    Executes the given side-effect if cond is false

    Executes the given side-effect if cond is false

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

    Permalink

    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
  462. final def unlessMU[MA](cond: Boolean)(f: ⇒ MA)(implicit M: Unapply[Applicative, MA]): M[Unit]

    Permalink

    A version of unlessM that infers the type constructor M.

    A version of unlessM that infers the type constructor M.

    Definition Classes
    BooleanFunctions
  463. final def valueOrZero[A](cond: Boolean)(value: ⇒ A)(implicit z: Monoid[A]): A

    Permalink

    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
  464. implicit def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]

    Permalink
    Definition Classes
    VectorInstances0
  465. implicit val vectorInstance: Traverse[Vector] with MonadPlus[Vector] with BindRec[Vector] with Zip[Vector] with Unzip[Vector] with IsEmpty[Vector] with Align[Vector]

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

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

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

    Permalink
    Definition Classes
    VectorInstances
  469. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  472. final def when(cond: Boolean)(f: ⇒ Unit): Unit

    Permalink

    Executes the given side-effect if cond is true

    Executes the given side-effect if cond is true

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

    Permalink

    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
  474. final def whenMU[MA](cond: Boolean)(f: ⇒ MA)(implicit M: Unapply[Applicative, MA]): M[Unit]

    Permalink

    A version of whenM that infers the type constructor M.

    A version of whenM that infers the type constructor M.

    Definition Classes
    BooleanFunctions
  475. implicit val yearInstance: Enum[Year]

    Permalink
    Definition Classes
    TimeInstances
  476. implicit val yearMonthInstance: Enum[YearMonth]

    Permalink
    Definition Classes
    TimeInstances
  477. final def zapp[A, B, C](a: Stream[A])(f: Stream[(A) ⇒ (B) ⇒ C]): Stream[(B) ⇒ C]

    Permalink
    Definition Classes
    StreamFunctions
  478. final def zeroOrValue[A](cond: Boolean)(value: ⇒ A)(implicit z: Monoid[A]): A

    Permalink

    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
  479. final def zipperEnd[A](as: Stream[A]): Option[Zipper[A]]

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

    Permalink
    Definition Classes
    ListFunctions
  481. implicit val zoneOffsetInstance: Order[ZoneOffset]

    Permalink
    Definition Classes
    TimeInstances0
  482. implicit val zonedDateTime: Order[ZonedDateTime]

    Permalink
    Definition Classes
    TimeInstances0
  483. def [F](implicit F: Monoid[F]): F

    Permalink
    Definition Classes
    ToMonoidOps

Inherited from IdInstances

Inherited from ToAllStdOps

Inherited from ToTryOps

Inherited from ToEitherOps

Inherited from ToMapOps

Inherited from ToTupleOps

Inherited from ToStringOps

Inherited from ToFunction1Ops

Inherited from ToFunction2Ops

Inherited from ToVectorOps

Inherited from ToStreamOps

Inherited from ToListOps

Inherited from ToOptionIdOps

Inherited from ToOptionOps

Inherited from ToBooleanOps

Inherited from AllFunctions

Inherited from FunctionFunctions

Inherited from StringFunctions

Inherited from OrderingFunctions

Inherited from BooleanFunctions

Inherited from StreamFunctions

Inherited from OptionFunctions

Inherited from ListFunctions

Inherited from AllInstances

Inherited from TimeInstances

Inherited from TimeInstances0

Inherited from CallableInstances

Inherited from EnumInstances

Inherited from BigIntegerInstances

Inherited from BigDecimalInstances

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 TupleInstances2

Inherited from TupleInstances1

Inherited from TupleInstances0

Inherited from StreamInstances

Inherited from StringInstances

Inherited from SetInstances

Inherited from OptionInstances

Inherited from OptionInstances0

Inherited from OptionInstances1

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 ToContTOps

Inherited from ToMaybeOps

Inherited from ToTheseOps

Inherited from ToNelOps

Inherited from ToEitherTOps

Inherited from ToEitherOps

Inherited from ToKleisliOps

Inherited from ToKleisliOps0

Inherited from ToValidationOps

Inherited from ToStateOps

Inherited from ToWriterOps

Inherited from ToReducerOps

Inherited from ToStrictTreeOps

Inherited from ToTreeOps

Inherited from ToIdOps

Inherited from ToTypeClassOps

Inherited from ToMonadTransOps

Inherited from ToAlignOps0[Align]

Inherited from ToAlignOpsU[Align]

Inherited from ToCatchableOps0[Catchable]

Inherited from ToCatchableOpsU[Catchable]

Inherited from ToOptionalOps0[Optional]

Inherited from ToOptionalOpsU[Optional]

Inherited from ToTraverse1Ops0[Traverse1]

Inherited from ToTraverse1OpsU[Traverse1]

Inherited from ToFoldable1Ops0[Foldable1]

Inherited from ToFoldable1OpsU[Foldable1]

Inherited from ToMonadErrorOps0[MonadError]

Inherited from ToMonadListenOps0[MonadListen]

Inherited from ToMonadTellOps0[MonadTell]

Inherited from ToUnzipOps0[Unzip]

Inherited from ToUnzipOpsU[Unzip]

Inherited from ToZipOps0[Zip]

Inherited from ToZipOpsU[Zip]

Inherited from ToSplitOps0[Split]

Inherited from ToSplitOpsU[Split]

Inherited from ToChoiceOps0[Choice]

Inherited from ToChoiceOpsU[Choice]

Inherited from ToFoldableOps0[Foldable]

Inherited from ToFoldableOpsU[Foldable]

Inherited from ToStrongOps0[Strong]

Inherited from ToStrongOpsU[Strong]

Inherited from ToProfunctorOps0[Profunctor]

Inherited from ToProfunctorOpsU[Profunctor]

Inherited from ToArrowOps0[Arrow]

Inherited from ToArrowOpsU[Arrow]

Inherited from ToCategoryOps0[Category]

Inherited from ToCategoryOpsU[Category]

Inherited from ToComposeOps0[Compose]

Inherited from ToComposeOpsU[Compose]

Inherited from ToBitraverseOps0[Bitraverse]

Inherited from ToBitraverseOpsU[Bitraverse]

Inherited from ToAssociativeOps0[Associative]

Inherited from ToAssociativeOpsU[Associative]

Inherited from ToBifunctorOps0[Bifunctor]

Inherited from ToBifunctorOpsU[Bifunctor]

Inherited from ToTraverseOps0[Traverse]

Inherited from ToTraverseOpsU[Traverse]

Inherited from ToMonadPlusOps0[MonadPlus]

Inherited from ToMonadPlusOpsU[MonadPlus]

Inherited from ToPlusOps0[Plus]

Inherited from ToPlusOpsU[Plus]

Inherited from ToCozipOps0[Cozip]

Inherited from ToCozipOpsU[Cozip]

Inherited from ToBifoldableOps0[Bifoldable]

Inherited from ToBifoldableOpsU[Bifoldable]

Inherited from ToComonadOps0[Comonad]

Inherited from ToComonadOpsU[Comonad]

Inherited from ToMonadOps0[Monad]

Inherited from ToMonadOpsU[Monad]

Inherited from ToBindOps0[Bind]

Inherited from ToBindOpsU[Bind]

Inherited from ToApplicativeOps0[Applicative]

Inherited from ToApplicativeOpsU[Applicative]

Inherited from ToApplyOps0[Apply]

Inherited from ToApplyOpsU[Apply]

Inherited from ToFunctorOps0[Functor]

Inherited from ToFunctorOpsU[Functor]

Inherited from ToPlusEmptyOps0[PlusEmpty]

Inherited from ToPlusEmptyOpsU[PlusEmpty]

Inherited from ToEnumOps

Inherited from ToOrderOps

Inherited from ToShowOps

Inherited from ToEqualOps

Inherited from ToBandOps

Inherited from ToMonoidOps

Inherited from ToSemigroupOps

Inherited from StateFunctions

Inherited from IndexedStateFunctions

Inherited from AnyRef

Inherited from Any

Ungrouped