object Scalaz extends StateFunctions with ToTypeClassOps with ToDataOps with AllInstances with AllFunctions with ToAllStdOps with IdInstances
- Source
- Scalaz.scala
- Alphabetic
- By Inheritance
- Scalaz
- IdInstances
- ToAllStdOps
- ToEitherOps
- ToMapOps
- ToTupleOps
- ToStringOps
- ToFunction1Ops
- ToFunction2Ops
- ToVectorOps
- ToStreamOps
- ToListOps
- ToOptionIdOps
- ToOptionOps
- ToBooleanOps
- AllFunctions
- StringFunctions
- OrderingFunctions
- StreamFunctions
- OptionFunctions
- ListFunctions
- AllInstances
- NodeSeqInstances
- CallableInstances
- BigIntegerInstances
- MapInstances
- Parsers
- OrderingInstances
- BigInts
- BigDecimalInstances
- TypeConstraintInstances
- PartialFunctionInstances
- EitherInstances
- EitherInstances0
- VectorInstances
- VectorInstances0
- TupleInstances
- TupleInstances1
- TupleInstances0
- StreamInstances
- StringInstances
- SetInstances
- OptionInstances
- OptionInstances0
- MapInstances
- MapInstances0
- ListInstances
- ListInstances0
- FunctionInstances
- FunctionInstances0
- FunctionInstances1
- AnyValInstances
- ToDataOps
- ToKleisliOps
- ToKleisliOps0
- ToReducerOps
- ToValidationOps
- ToWriterOps
- ToTreeOps
- ToIdOps
- ToTypeClassOps
- ToTraverse1Ops
- ToTraverse1Ops0
- ToFoldable1Ops
- ToFoldable1Ops0
- ToMonadListenOps
- ToMonadListenOps0
- ToMonadTellOps
- ToMonadTellOps0
- ToUnzipOps
- ToUnzipOps0
- ToZipOps
- ToZipOps0
- ToChoiceOps
- ToChoiceOps0
- ToArrowOps
- ToProfunctorOps
- ToProfunctorOps0
- ToSplitOps
- ToSplitOps0
- ToArrowOps0
- ToCategoryOps
- ToCategoryOps0
- ToComposeOps
- ToComposeOps0
- ToBitraverseOps
- ToBitraverseOps0
- ToBifunctorOps
- ToBifunctorOps0
- ToTraverseOps
- ToFoldableOps
- ToFoldableOps0
- ToTraverseOps0
- ToMonadPlusOps
- ToMonadPlusOps0
- ToApplicativePlusOps
- ToApplicativePlusOps0
- ToCozipOps
- ToCozipOps0
- ToBifoldableOps
- ToBifoldableOps0
- ToComonadOps
- ToCobindOps
- ToCobindOps0
- ToComonadOps0
- ToCojoinOps
- ToCojoinOps0
- ToMonadOps
- ToMonadOps0
- ToBindOps
- ToBindOps0
- ToApplicativeOps
- ToApplicativeOps0
- ToApplyOps
- ToApplyOps0
- ToContravariantOps
- ToContravariantOps0
- ToFunctorOps
- ToFunctorOps0
- ToIndexOps
- ToIndexOps0
- ToEachOps
- ToEachOps0
- ToPlusEmptyOps
- ToPlusOps
- ToPlusOps0
- ToPlusEmptyOps0
- ToMetricSpaceOps
- ToEnumOps
- ToOrderOps
- ToShowOps
- ToLengthOps
- ToLengthOps0
- ToEqualOps
- ToMonoidOps
- ToSemigroupOps
- StateFunctions
- IndexedStateFunctions
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
type
Id[+X] = X
The strict identity type constructor.
The strict identity type constructor. Can be thought of as
Tuple1
, but with no runtime representation.- Definition Classes
- IdInstances
-
type
Identity[+X] = Need[X]
- Definition Classes
- IdInstances
-
class
ParsersW
[P <: scala.util.parsing.combinator.Parsers] extends AnyRef
- Definition Classes
- Parsers
-
trait
ApplicativeIdV
[A] extends Ops[A]
- Definition Classes
- ToApplicativeOps
-
trait
FunctorIdV
[A] extends Ops[A]
- Definition Classes
- ToFunctorOps
-
trait
LiftV
[F[_], A, B] extends Ops[(A) ⇒ B]
- Definition Classes
- ToFunctorOps
-
trait
UnzipPairOps
[F[_], A, B] extends Ops[F[(A, B)]]
- Definition Classes
- ToUnzipOps
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
val
<:<: Category[<:<]
- Definition Classes
- TypeConstraintInstances
-
final
def
<^>[A, B](as: List[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B
Returns
f
applied to the contents ofas
if non-empty, otherwise, the zero element of theMonoid
for the typeB
.Returns
f
applied to the contents ofas
if non-empty, otherwise, the zero element of theMonoid
for the typeB
.- Definition Classes
- ListFunctions
-
val
=:=: Category[=:=]
- Definition Classes
- TypeConstraintInstances
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
implicit
def
ApplicativeIdV[A](v: ⇒ A): ApplicativeIdV[A] { lazy val self: A }
- Definition Classes
- ToApplicativeOps
-
implicit
val
BigDecimalMultiplicationNewType: Monoid[@@[BigDecimal, Multiplication]]
- Definition Classes
- BigDecimalInstances
-
implicit
def
FirstLeftProjectionEIso2[E]: Isomorphism.IsoFunctorTemplate[[α]LeftProjection[E, α] with AnyRef { type Tag = scalaz.Tags.First }, [α]Either[E, α]]
scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
FirstLeftProjectionIso2: Isomorphism.IsoBifunctorTemplate[[α, β]LeftProjection[α, β] with AnyRef { type Tag = scalaz.Tags.First }, Either]
scala.Either.LeftProjection is isomorphic to scala.Either
scala.Either.LeftProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
FirstRightProjectionAIso2[A]: Isomorphism.IsoFunctorTemplate[[α]RightProjection[α, A] with AnyRef { type Tag = scalaz.Tags.First }, [α]Either[α, A]]
scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
FirstRightProjectionIso2: Isomorphism.IsoBifunctorTemplate[[α, β]RightProjection[α, β] with AnyRef { type Tag = scalaz.Tags.First }, Either]
scala.Either.RightProjection is isomorphic to scala.Either
scala.Either.RightProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
LastLeftProjectionEIso2[E]: Isomorphism.IsoFunctorTemplate[[α]LeftProjection[E, α] with AnyRef { type Tag = scalaz.Tags.Last }, [α]Either[E, α]]
scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
LastLeftProjectionIso2: Isomorphism.IsoBifunctorTemplate[[α, β]LeftProjection[α, β] with AnyRef { type Tag = scalaz.Tags.Last }, Either]
scala.Either.LeftProjection is isomorphic to scala.Either
scala.Either.LeftProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
LastRightProjectionAIso2[A]: Isomorphism.IsoFunctorTemplate[[α]RightProjection[α, A] with AnyRef { type Tag = scalaz.Tags.Last }, [α]Either[α, A]]
scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
LastRightProjectionIso2: Isomorphism.IsoBifunctorTemplate[[α, β]RightProjection[α, β] with AnyRef { type Tag = scalaz.Tags.Last }, Either]
scala.Either.RightProjection is isomorphic to scala.Either
scala.Either.RightProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
LeftProjectionEIso2[E]: Isomorphism.IsoFunctorTemplate[[α]LeftProjection[E, α], [α]Either[E, α]]
scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.scala.Either.LeftProjection is isomorphic to scala.Either, when the type parameter
E
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
LeftProjectionIso2: Isomorphism.IsoBifunctorTemplate[LeftProjection, Either]
scala.Either.LeftProjection is isomorphic to scala.Either
scala.Either.LeftProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
RightProjectionAIso2[A]: Isomorphism.IsoFunctorTemplate[[α]RightProjection[α, A], [α]Either[α, A]]
scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.scala.Either.RightProjection is isomorphic to scala.Either, when the type parameter
A
is partially applied.- Definition Classes
- EitherInstances
-
implicit
def
RightProjectionIso2: Isomorphism.IsoBifunctorTemplate[RightProjection, Either]
scala.Either.RightProjection is isomorphic to scala.Either
scala.Either.RightProjection is isomorphic to scala.Either
- Definition Classes
- EitherInstances
-
implicit
def
ToApplicativeOps[F[_], A](v: F[A])(implicit F0: Applicative[F]): ApplicativeOps[F, A]
- Definition Classes
- ToApplicativeOps
-
implicit
def
ToApplicativeOpsUnapply[FA](v: FA)(implicit F0: Unapply[Applicative, FA]): ApplicativeOps[M, A]
- Definition Classes
- ToApplicativeOps0
-
implicit
def
ToApplicativePlusOps[F[_], A](v: F[A])(implicit F0: ApplicativePlus[F]): ApplicativePlusOps[F, A]
- Definition Classes
- ToApplicativePlusOps
-
implicit
def
ToApplicativePlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[ApplicativePlus, FA]): ApplicativePlusOps[M, A]
- Definition Classes
- ToApplicativePlusOps0
-
implicit
def
ToApplyOps[F[_], A](v: F[A])(implicit F0: Apply[F]): ApplyOps[F, A]
- Definition Classes
- ToApplyOps
-
implicit
def
ToApplyOpsUnapply[FA](v: FA)(implicit F0: Unapply[Apply, FA]): ApplyOps[M, A]
- Definition Classes
- ToApplyOps0
-
implicit
def
ToArrowOps[F[_, _], A, B](v: F[A, B])(implicit F0: Arrow[F]): ArrowOps[F, A, B]
- Definition Classes
- ToArrowOps
-
implicit
def
ToArrowOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Arrow, FA]): ArrowOps[M, A, B]
- Definition Classes
- ToArrowOps0
-
implicit
def
ToBifoldableOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifoldable[F]): BifoldableOps[F, A, B]
- Definition Classes
- ToBifoldableOps
-
implicit
def
ToBifoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifoldable, FA]): BifoldableOps[M, A, B]
- Definition Classes
- ToBifoldableOps0
-
implicit
def
ToBifunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifunctor[F]): BifunctorOps[F, A, B]
- Definition Classes
- ToBifunctorOps
-
implicit
def
ToBifunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bifunctor, FA]): BifunctorOps[M, A, B]
- Definition Classes
- ToBifunctorOps0
-
implicit
def
ToBindOps[F[_], A](v: F[A])(implicit F0: Bind[F]): BindOps[F, A]
- Definition Classes
- ToBindOps
-
implicit
def
ToBindOpsUnapply[FA](v: FA)(implicit F0: Unapply[Bind, FA]): BindOps[M, A]
- Definition Classes
- ToBindOps0
-
implicit
def
ToBitraverseOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bitraverse[F]): BitraverseOps[F, A, B]
- Definition Classes
- ToBitraverseOps
-
implicit
def
ToBitraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Bitraverse, FA]): BitraverseOps[M, A, B]
- Definition Classes
- ToBitraverseOps0
-
implicit
def
ToBooleanOpsFromBoolean(a: Boolean): BooleanOps
- Definition Classes
- ToBooleanOps
-
implicit
def
ToCategoryOps[F[_, _], A, B](v: F[A, B])(implicit F0: Category[F]): CategoryOps[F, A, B]
- Definition Classes
- ToCategoryOps
-
implicit
def
ToCategoryOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Category, FA]): CategoryOps[M, A, B]
- Definition Classes
- ToCategoryOps0
-
implicit
def
ToCategoryVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Category[[α, β]F[G, α, β]]): CategoryOps[[α, β]F[G, α, β], A, B]
- Definition Classes
- ToCategoryOps
-
implicit
def
ToChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: Choice[F]): ChoiceOps[F, A, B]
- Definition Classes
- ToChoiceOps
-
implicit
def
ToChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Choice, FA]): ChoiceOps[M, A, B]
- Definition Classes
- ToChoiceOps0
-
implicit
def
ToCobindOps[F[_], A](v: F[A])(implicit F0: Cobind[F]): CobindOps[F, A]
- Definition Classes
- ToCobindOps
-
implicit
def
ToCobindOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cobind, FA]): CobindOps[M, A]
- Definition Classes
- ToCobindOps0
-
implicit
def
ToCojoinOps[F[_], A](v: F[A])(implicit F0: Cojoin[F]): CojoinOps[F, A]
- Definition Classes
- ToCojoinOps
-
implicit
def
ToCojoinOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cojoin, FA]): CojoinOps[M, A]
- Definition Classes
- ToCojoinOps0
-
implicit
def
ToComonadOps[F[_], A](v: F[A])(implicit F0: Comonad[F]): ComonadOps[F, A]
- Definition Classes
- ToComonadOps
-
implicit
def
ToComonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Comonad, FA]): ComonadOps[M, A]
- Definition Classes
- ToComonadOps0
-
implicit
def
ToComposeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Compose[F]): ComposeOps[F, A, B]
- Definition Classes
- ToComposeOps
-
implicit
def
ToComposeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Compose, FA]): ComposeOps[M, A, B]
- Definition Classes
- ToComposeOps0
-
implicit
def
ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Choice[[α, β]F[G, α, β]]): ChoiceOps[[α, β]F[G, α, β], A, B]
- Definition Classes
- ToChoiceOps
-
implicit
def
ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Split[[α, β]F[G, α, β]]): SplitOps[[α, β]F[G, α, β], A, B]
- Definition Classes
- ToSplitOps
-
implicit
def
ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Compose[[α, β]F[G, α, β]]): ComposeOps[[α, β]F[G, α, β], A, B]
- Definition Classes
- ToComposeOps
-
implicit
def
ToContravariantOps[F[_], A](v: F[A])(implicit F0: Contravariant[F]): ContravariantOps[F, A]
- Definition Classes
- ToContravariantOps
-
implicit
def
ToContravariantOpsUnapply[FA](v: FA)(implicit F0: Unapply[Contravariant, FA]): ContravariantOps[M, A]
- Definition Classes
- ToContravariantOps0
-
implicit
def
ToCozipOps[F[_], A](v: F[A])(implicit F0: Cozip[F]): CozipOps[F, A]
- Definition Classes
- ToCozipOps
-
implicit
def
ToCozipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Cozip, FA]): CozipOps[M, A]
- Definition Classes
- ToCozipOps0
-
implicit
def
ToEachOps[F[_], A](v: F[A])(implicit F0: Each[F]): EachOps[F, A]
- Definition Classes
- ToEachOps
-
implicit
def
ToEachOpsUnapply[FA](v: FA)(implicit F0: Unapply[Each, FA]): EachOps[M, A]
- Definition Classes
- ToEachOps0
-
implicit
def
ToEitherOpsFromEither[A, B](e: Either[A, B]): EitherOps[A, B]
- Definition Classes
- ToEitherOps
-
implicit
def
ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]
- Definition Classes
- ToEnumOps
-
implicit
def
ToEqualOps[F](v: F)(implicit F0: Equal[F]): EqualOps[F]
- Definition Classes
- ToEqualOps
-
implicit
def
ToFoldable1Ops[F[_], A](v: F[A])(implicit F0: Foldable1[F]): Foldable1Ops[F, A]
- Definition Classes
- ToFoldable1Ops
-
implicit
def
ToFoldable1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable1, FA]): Foldable1Ops[M, A]
- Definition Classes
- ToFoldable1Ops0
-
implicit
def
ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]
- Definition Classes
- ToFoldableOps
-
implicit
def
ToFoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply[Foldable, FA]): FoldableOps[M, A]
- Definition Classes
- ToFoldableOps0
-
implicit
def
ToFunction1OpsFromBoolean[A, B](f: (A) ⇒ B): Function1Ops[A, B]
- Definition Classes
- ToFunction1Ops
-
implicit
def
ToFunction2Ops[T1, T2, R](f: (T1, T2) ⇒ R): Function2Ops[T1, T2, R] { val self: (T1, T2) => R }
- Definition Classes
- ToFunction2Ops
-
implicit
def
ToFunctorIdV[A](v: A): FunctorIdV[A]
- Definition Classes
- ToFunctorOps
-
implicit
def
ToFunctorOps[F[_], A](v: F[A])(implicit F0: Functor[F]): FunctorOps[F, A]
- Definition Classes
- ToFunctorOps
-
implicit
def
ToFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[Functor, FA]): FunctorOps[M, A]
- Definition Classes
- ToFunctorOps0
-
implicit
def
ToIdOps[A](a: A): IdOps[A]
- Definition Classes
- ToIdOps
-
implicit
def
ToIndexOps[F[_], A](v: F[A])(implicit F0: Index[F]): IndexOps[F, A]
- Definition Classes
- ToIndexOps
-
implicit
def
ToIndexOpsUnapply[FA](v: FA)(implicit F0: Unapply[Index, FA]): IndexOps[M, A]
- Definition Classes
- ToIndexOps0
-
implicit
def
ToKleisliFAOps[F[+_], A](fa: F[A]): KleisliFAOps[F, A]
- Definition Classes
- ToKleisliOps
-
implicit
def
ToKleisliIdOps[A](a: A): KleisliIdOps[A]
- Definition Classes
- ToKleisliOps
-
implicit
def
ToKleisliOpsUnapply[FA](v: FA)(implicit F0: UnapplyCo[Monad, FA]): KleisliFAOps[M, A]
- Definition Classes
- ToKleisliOps0
-
implicit
def
ToLengthOps[F[_], A](v: F[A])(implicit F0: Length[F]): LengthOps[F, A]
- Definition Classes
- ToLengthOps
-
implicit
def
ToLengthOpsUnapply[FA](v: FA)(implicit F0: Unapply[Length, FA]): LengthOps[M, A]
- Definition Classes
- ToLengthOps0
-
implicit
def
ToLiftV[F[_], A, B](v: (A) ⇒ B): LiftV[F, A, B]
- Definition Classes
- ToFunctorOps
-
implicit
def
ToListOpsFromList[A](a: List[A]): ListOps[A]
- Definition Classes
- ToListOps
-
implicit
def
ToMapOpsFromMap[K, V](m: Map[K, V]): MapOps[K, V]
- Definition Classes
- ToMapOps
-
implicit
def
ToMetricSpaceOps[F](v: F)(implicit F0: MetricSpace[F]): MetricSpaceOps[F]
- Definition Classes
- ToMetricSpaceOps
-
implicit
def
ToMonadListenOps[F[_, _], A, W](v: F[W, A])(implicit F0: MonadListen[F, W]): MonadListenOps[F, W, A]
- Definition Classes
- ToMonadListenOps
-
implicit
def
ToMonadListenOpsUnapply[FA](v: FA)(implicit F0: Unapply21[MonadListen, FA]): MonadListenOps[M, A, B]
- Definition Classes
- ToMonadListenOps0
-
implicit
def
ToMonadOps[F[_], A](v: F[A])(implicit F0: Monad[F]): MonadOps[F, A]
- Definition Classes
- ToMonadOps
-
implicit
def
ToMonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[Monad, FA]): MonadOps[M, A]
- Definition Classes
- ToMonadOps0
-
implicit
def
ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]
- Definition Classes
- ToMonadPlusOps
-
implicit
def
ToMonadPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[MonadPlus, FA]): MonadPlusOps[M, A]
- Definition Classes
- ToMonadPlusOps0
-
implicit
def
ToMonadTellOps[F[_, _], A, W](v: F[W, A])(implicit F0: MonadTell[F, W]): MonadTellOps[F, W, A]
- Definition Classes
- ToMonadTellOps
-
implicit
def
ToMonadTellOpsUnapply[FA](v: FA)(implicit F0: Unapply21[MonadTell, FA]): MonadTellOps[M, A, B]
- Definition Classes
- ToMonadTellOps0
-
implicit
def
ToMonoidOps[F](v: F)(implicit F0: Monoid[F]): MonoidOps[F]
- Definition Classes
- ToMonoidOps
-
implicit
def
ToOptionIdOps[A](a: A): OptionIdOps[A]
- Definition Classes
- ToOptionIdOps
-
implicit
def
ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]
- Definition Classes
- ToOptionOps
-
implicit
def
ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]
- Definition Classes
- ToOrderOps
-
implicit
def
ToPlusEmptyOps[F[_], A](v: F[A])(implicit F0: PlusEmpty[F]): PlusEmptyOps[F, A]
- Definition Classes
- ToPlusEmptyOps
-
implicit
def
ToPlusEmptyOpsUnapply[FA](v: FA)(implicit F0: Unapply[PlusEmpty, FA]): PlusEmptyOps[M, A]
- Definition Classes
- ToPlusEmptyOps0
-
implicit
def
ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]
- Definition Classes
- ToPlusOps
-
implicit
def
ToPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[Plus, FA]): PlusOps[M, A]
- Definition Classes
- ToPlusOps0
-
implicit
def
ToProfunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Profunctor[F]): ProfunctorOps[F, A, B]
- Definition Classes
- ToProfunctorOps
-
implicit
def
ToProfunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Profunctor, FA]): ProfunctorOps[M, A, B]
- Definition Classes
- ToProfunctorOps0
-
implicit
def
ToReducerOps[A](a: A): ReducerOps[A]
- Definition Classes
- ToReducerOps
-
final
def
ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
- Definition Classes
- OrderingFunctions
-
implicit
def
ToSemigroupOps[F](v: F)(implicit F0: Semigroup[F]): SemigroupOps[F]
- Definition Classes
- ToSemigroupOps
-
implicit
def
ToShowOps[F](v: F)(implicit F0: Show[F]): ShowOps[F]
- Definition Classes
- ToShowOps
-
implicit
def
ToSplitOps[F[_, _], A, B](v: F[A, B])(implicit F0: Split[F]): SplitOps[F, A, B]
- Definition Classes
- ToSplitOps
-
implicit
def
ToSplitOpsUnapply[FA](v: FA)(implicit F0: Unapply2[Split, FA]): SplitOps[M, A, B]
- Definition Classes
- ToSplitOps0
-
implicit
def
ToStreamOpsFromStream[A](a: Stream[A]): StreamOps[A]
- Definition Classes
- ToStreamOps
-
implicit
def
ToStringOpsFromString(a: String): StringOps
- Definition Classes
- ToStringOps
-
implicit
def
ToTraverse1Ops[F[_], A](v: F[A])(implicit F0: Traverse1[F]): Traverse1Ops[F, A]
- Definition Classes
- ToTraverse1Ops
-
implicit
def
ToTraverse1OpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse1, FA]): Traverse1Ops[M, A]
- Definition Classes
- ToTraverse1Ops0
-
implicit
def
ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]
- Definition Classes
- ToTraverseOps
-
implicit
def
ToTraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply[Traverse, FA]): TraverseOps[M, A]
- Definition Classes
- ToTraverseOps0
-
implicit
def
ToTreeOps[A](a: A): TreeOps[A]
- Definition Classes
- ToTreeOps
-
implicit
def
ToTuple10Ops[A, B, C, D, E, F, G, H, I, J](t: (A, B, C, D, E, F, G, H, I, J)): Tuple10Ops[A, B, C, D, E, F, G, H, I, J]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple11Ops[A, B, C, D, E, F, G, H, I, J, K](t: (A, B, C, D, E, F, G, H, I, J, K)): Tuple11Ops[A, B, C, D, E, F, G, H, I, J, K]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple12Ops[A, B, C, D, E, F, G, H, I, J, K, L](t: (A, B, C, D, E, F, G, H, I, J, K, L)): Tuple12Ops[A, B, C, D, E, F, G, H, I, J, K, L]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple3Ops[A, B, C](t: (A, B, C)): Tuple3Ops[A, B, C]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple4Ops[A, B, C, D](t: (A, B, C, D)): Tuple4Ops[A, B, C, D]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple5Ops[A, B, C, D, E](t: (A, B, C, D, E)): Tuple5Ops[A, B, C, D, E]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple6Ops[A, B, C, D, E, F](t: (A, B, C, D, E, F)): Tuple6Ops[A, B, C, D, E, F]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple7Ops[A, B, C, D, E, F, G](t: (A, B, C, D, E, F, G)): Tuple7Ops[A, B, C, D, E, F, G]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple8Ops[A, B, C, D, E, F, G, H](t: (A, B, C, D, E, F, G, H)): Tuple8Ops[A, B, C, D, E, F, G, H]
- Definition Classes
- ToTupleOps
-
implicit
def
ToTuple9Ops[A, B, C, D, E, F, G, H, I](t: (A, B, C, D, E, F, G, H, I)): Tuple9Ops[A, B, C, D, E, F, G, H, I]
- Definition Classes
- ToTupleOps
-
implicit
def
ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]
- Definition Classes
- ToUnzipOps
-
implicit
def
ToUnzipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Unzip, FA]): UnzipOps[M, A]
- Definition Classes
- ToUnzipOps0
-
implicit
def
ToUnzipPairOps[F[_], A, B](v: F[(A, B)])(implicit F0: Unzip[F]): UnzipPairOps[F, A, B]
- Definition Classes
- ToUnzipOps
-
implicit
def
ToValidationV[A](a: A): ValidationV[A]
- Definition Classes
- ToValidationOps
-
implicit
def
ToVectorOpsFromVector[A](a: Vector[A]): IndexedSeqOps[Vector, A]
- Definition Classes
- ToVectorOps
-
implicit
def
ToWriterOps[A](a: A): WriterOps[A]
- Definition Classes
- ToWriterOps
-
implicit
def
ToZipOps[F[_], A](v: F[A])(implicit F0: Zip[F]): ZipOps[F, A]
- Definition Classes
- ToZipOps
-
implicit
def
ToZipOpsUnapply[FA](v: FA)(implicit F0: Unapply[Zip, FA]): ZipOps[M, A]
- Definition Classes
- ToZipOps0
-
def
^[F[_], A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C)(implicit F: Apply[F]): F[C]
- Definition Classes
- ToApplyOps
-
def
^^[F[_], A, B, C, D](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C])(f: (A, B, C) ⇒ D)(implicit F: Apply[F]): F[D]
- Definition Classes
- ToApplyOps
-
def
^^^[F[_], A, B, C, D, E](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D])(f: (A, B, C, D) ⇒ E)(implicit F: Apply[F]): F[E]
- Definition Classes
- ToApplyOps
-
def
^^^^[F[_], A, B, C, D, E, I](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E])(f: (A, B, C, D, E) ⇒ I)(implicit F: Apply[F]): F[I]
- Definition Classes
- ToApplyOps
-
def
^^^^^[F[_], A, B, C, D, E, I, J](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], fi: ⇒ F[I])(f: (A, B, C, D, E, I) ⇒ J)(implicit F: Apply[F]): F[J]
- Definition Classes
- ToApplyOps
-
def
^^^^^^[F[_], A, B, C, D, E, I, J, K](fa: ⇒ F[A], fb: ⇒ F[B], fc: ⇒ F[C], fd: ⇒ F[D], fe: ⇒ F[E], fi: ⇒ F[I], fj: ⇒ F[J])(f: (A, B, C, D, E, I, J) ⇒ K)(implicit F: Apply[F]): F[K]
- Definition Classes
- ToApplyOps
-
final
def
adjacentPairs[A](as: List[A]): List[(A, A)]
[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]
[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]
- Definition Classes
- ListFunctions
-
final
def
allPairs[A](as: List[A]): List[(A, A)]
Combinations of
as
andas
, excluding same-element pairs.Combinations of
as
andas
, excluding same-element pairs.- Definition Classes
- ListFunctions
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
implicit
val
bigDecimalInstance: Monoid[BigDecimal] with Enum[BigDecimal] with Show[BigDecimal]
- Definition Classes
- BigDecimalInstances
-
implicit
val
bigIntInstance: Monoid[BigInt] with Enum[BigInt] with Show[BigInt]
- Definition Classes
- BigInts
-
implicit
val
bigIntMultiplication: Monoid[@@[BigInt, Multiplication]] with Order[@@[BigInt, Multiplication]] with Show[@@[BigInt, Multiplication]]
- Definition Classes
- BigInts
-
implicit
val
bigIntegerInstance: Monoid[BigInteger] with Enum[BigInteger] with Show[BigInteger]
- Definition Classes
- BigIntegerInstances
-
implicit
val
bigIntegerMultiplication: Monoid[@@[BigInteger, Multiplication]] with Order[@@[BigInteger, Multiplication]] with Show[@@[BigInteger, Multiplication]]
- Definition Classes
- BigIntegerInstances
-
implicit
val
booleanConjunctionNewTypeInstance: Monoid[@@[Boolean, Conjunction]] with Enum[@@[Boolean, Conjunction]]
- Definition Classes
- AnyValInstances
-
implicit
val
booleanDisjunctionNewTypeInstance: Monoid[@@[Boolean, Tags.Disjunction]] with Enum[@@[Boolean, Tags.Disjunction]]
- Definition Classes
- AnyValInstances
-
final
def
breakM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
spanM
withp
's complement.spanM
withp
's complement.- Definition Classes
- ListFunctions
-
implicit
val
byteInstance: Monoid[Byte] with Enum[Byte] with Show[Byte]
- Definition Classes
- AnyValInstances
-
implicit
val
byteMultiplicationNewType: Monoid[@@[Byte, Multiplication]] with Enum[@@[Byte, Multiplication]]
- Definition Classes
- AnyValInstances
-
implicit
def
callableMonad: Monad[Callable]
- Definition Classes
- CallableInstances
-
implicit
def
callableOrder[A](implicit arg0: Order[A]): Order[Callable[A]]
- Definition Classes
- CallableInstances
-
final
def
cata[A, X](oa: Option[A])(some: (A) ⇒ X, none: ⇒ X): X
Catamorphism over the option.
Catamorphism over the option. Returns the provided function
some
applied to item contained in the Option if it is defined, otherwise, the provided valuenone
.- Definition Classes
- OptionFunctions
-
implicit
val
char: Monoid[Char] with Enum[Char] with Show[Char]
- Definition Classes
- AnyValInstances
-
implicit
val
charMultiplicationNewType: Monoid[@@[Char, Multiplication]] with Enum[@@[Char, Multiplication]]
- Definition Classes
- AnyValInstances
-
def
charsNel(s: String, e: ⇒ NonEmptyList[Char]): NonEmptyList[Char]
Constructs a non-empty list with the given string if it is not empty, otherwise, returns the second argument.
Constructs a non-empty list with the given string if it is not empty, otherwise, returns the second argument.
- Definition Classes
- StringFunctions
-
def
charsNel(s: String): Option[NonEmptyList[Char]]
Constructs a non-empty list with the value if it is not empty, otherwise, throws an error.
Constructs a non-empty list with the value if it is not empty, otherwise, throws an error.
- Definition Classes
- StringFunctions
-
def
charsNelErr(s: String, message: ⇒ String): NonEmptyList[Char]
- Definition Classes
- StringFunctions
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
constantIndexedState[S1, S2, A](a: A, s: ⇒ S2): IndexedState[S1, S2, A]
- Definition Classes
- IndexedStateFunctions
-
def
constantState[S, A](a: A, s: ⇒ S): State[S, A]
- Definition Classes
- StateFunctions
-
implicit
val
doubleInstance: Monoid[Double] with Order[Double] with Show[Double]
- Definition Classes
- AnyValInstances
-
implicit
val
doubleMultiplicationNewType: Semigroup[@@[Double, Multiplication]]
- Definition Classes
- AnyValInstances
-
implicit
def
eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherFirstLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], First]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherFirstLeftInstance: IsomorphismBifunctor[[a, b]LeftProjection[a, b] with AnyRef { type Tag = scalaz.Tags.First }, Either] { def iso: scalaz.Isomorphism.IsoBifunctorTemplate[[α, β]Either.LeftProjection[α,β] with Object{type Tag = scalaz.Tags.First},Either] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], First]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], First]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstLeftRInstance[R]: Monad[[α]LeftProjection[α, R] with AnyRef { type Tag = scalaz.Tags.First }] { def point[A](a: => A): scalaz.@@[scala.util.Either.LeftProjection[A,Nothing],scalaz.Tags.First] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], First]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherFirstRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], First]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherFirstRightLInstance[L]: Monad[[α]RightProjection[L, α] with AnyRef { type Tag = scalaz.Tags.First }] { def point[A](a: => A): scalaz.@@[scala.util.Either.RightProjection[Nothing,A],scalaz.Tags.First] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], First]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], First]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherFirstRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], First]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherInstance: Bitraverse[Either]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastLeftEqual[A, X](implicit A0: Equal[A]): Equal[@@[LeftProjection[A, X], Last]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherLastLeftMonoid[A, X](implicit MonoidX: Monoid[X]): Monoid[@@[LeftProjection[A, X], Last]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastLeftOrder[A, X](implicit OrderA: Order[A]): Order[@@[LeftProjection[A, X], Last]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastLeftRInstance[R]: Monad[[α]LeftProjection[α, R] with AnyRef { type Tag = scalaz.Tags.Last }] { def point[A](a: => A): scalaz.@@[scala.util.Either.LeftProjection[A,Nothing],scalaz.Tags.Last] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastLeftSemigroup[A, X](implicit arg0: Semigroup[A]): Semigroup[@@[LeftProjection[A, X], Last]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherLastRightEqual[X, A](implicit A0: Equal[A]): Equal[@@[RightProjection[X, A], Last]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherLastRightLInstance[L]: Monad[[α]RightProjection[L, α] with AnyRef { type Tag = scalaz.Tags.Last }] { def point[A](a: => A): scalaz.@@[scala.util.Either.RightProjection[Nothing,A],scalaz.Tags.Last] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastRightMonoid[X, A](implicit MonoidX: Monoid[X]): Monoid[@@[RightProjection[X, A], Last]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastRightOrder[X, A](implicit OrderA: Order[A]): Order[@@[RightProjection[X, A], Last]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLastRightSemigroup[X, A](implicit arg0: Semigroup[A]): Semigroup[@@[RightProjection[X, A], Last]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherLeftEqual[A, X](implicit A0: Equal[A]): Equal[LeftProjection[A, X]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherLeftInstance: IsomorphismBifunctor[LeftProjection, Either] { def iso: scalaz.Isomorphism.IsoBifunctorTemplate[Either.LeftProjection,Either] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherLeftMonoid[A, X](implicit MonoidA: Monoid[A], MonoidX: Monoid[X]): Monoid[LeftProjection[A, X]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLeftOrder[A, X](implicit OrderA: Order[A]): Order[LeftProjection[A, X]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherLeftRInstance[R]: Monad[[α]LeftProjection[α, R]] { def point[A](a: => A): scala.util.Either.LeftProjection[A,Nothing] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherLeftSemigroup[A, X](implicit SemigroupA: Semigroup[A], MonoidX: Monoid[X]): Semigroup[LeftProjection[A, X]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherMonad[L]: Traverse[[a]Either[L, a]] with Monad[[a]Either[L, a]] with Cozip[[a]Either[L, a]] { def point[A](a: => A): scala.util.Right[Nothing,A] }
Right biased monad
Right biased monad
- Definition Classes
- EitherInstances
-
implicit
def
eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherRightEqual[X, A](implicit A0: Equal[A]): Equal[RightProjection[X, A]]
- Definition Classes
- EitherInstances0
-
implicit
def
eitherRightInstance: IsomorphismBifunctor[RightProjection, Either] { def iso: scalaz.Isomorphism.IsoBifunctorTemplate[Either.RightProjection,Either] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherRightLInstance[L]: Monad[[α]RightProjection[L, α]] { def point[A](a: => A): scala.util.Either.RightProjection[Nothing,A] }
- Definition Classes
- EitherInstances
-
implicit
def
eitherRightMonoid[X, A](implicit MonoidX: Monoid[X], MonoidA: Monoid[A]): Monoid[RightProjection[X, A]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherRightOrder[X, A](implicit OrderA: Order[A]): Order[RightProjection[X, A]]
- Definition Classes
- EitherInstances
-
implicit
def
eitherRightSemigroup[X, A](implicit MonoidX: Monoid[X], SemigroupA: Semigroup[A]): Semigroup[RightProjection[X, A]]
- Definition Classes
- EitherInstances0
-
def
encode(s: String)(implicit c: CharSet): Array[Byte]
Encode
s
according to a Java character set identifier.Encode
s
according to a Java character set identifier.- Definition Classes
- StringFunctions
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
filterM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]
- Definition Classes
- ListFunctions
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
findM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]
Run
p(a)
s left-to-right until it yields a true value, answeringSome(that)
, orNone
if nothing matchedp
.Run
p(a)
s left-to-right until it yields a true value, answeringSome(that)
, orNone
if nothing matchedp
.- Definition Classes
- ListFunctions
-
implicit
val
floatInstance: Monoid[Float] with Order[Float] with Show[Float]
- Definition Classes
- AnyValInstances
-
implicit
val
floatMultiplicationNewType: Semigroup[@@[Float, Multiplication]]
- Definition Classes
- AnyValInstances
-
final
def
fold[A, X](oa: Option[A])(some: (A) ⇒ X, none: ⇒ X): X
Alias for
cata
Alias for
cata
- Definition Classes
- OptionFunctions
-
final
def
foldLift[F[_], A, B](oa: Option[A])(b: ⇒ B, k: (F[A]) ⇒ B)(implicit p: Applicative[F]): B
Returns the given value if None, otherwise lifts the Some value and passes it to the given function.
Returns the given value if None, otherwise lifts the Some value and passes it to the given function.
- Definition Classes
- OptionFunctions
-
final
def
foldLiftOpt[A, B](oa: Option[A])(b: ⇒ B, k: (Option[A]) ⇒ B): B
Returns the given value if None, otherwise lifts the Some value to Option and passes it to the given function.
Returns the given value if None, otherwise lifts the Some value to Option and passes it to the given function.
- Definition Classes
- OptionFunctions
-
implicit
def
function0Equal[R](implicit arg0: Equal[R]): Equal[() ⇒ R]
- Definition Classes
- FunctionInstances
-
implicit
val
function0Instance: Traverse[Function0] with Monad[Function0] with Comonad[Function0] with Distributive[Function0]
- Definition Classes
- FunctionInstances
-
implicit
def
function1Comonad[A, R](implicit A0: Monoid[A]): Function1Comonad[A, R]
- Definition Classes
- FunctionInstances0
-
implicit
def
function1Contravariant[R]: Contravariant[[a](a) ⇒ R]
- Definition Classes
- FunctionInstances
-
implicit
def
function1Covariant[T]: Monad[[a](T) ⇒ a] with Zip[[a](T) ⇒ a] with Unzip[[a](T) ⇒ a] with Distributive[[a](T) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
val
function1Instance: Arrow[Function1] with Category[Function1] with Choice[Function1]
- Definition Classes
- FunctionInstances
-
implicit
def
function1Monoid[A, R](implicit R0: Monoid[R]): Function1Monoid[A, R]
- Definition Classes
- FunctionInstances0
-
implicit
def
function1Semigroup[A, R](implicit R0: Semigroup[R]): Function1Semigroup[A, R]
- Definition Classes
- FunctionInstances1
-
implicit
def
function2Instance[T1, T2]: Monad[[a](T1, T2) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function3Instance[T1, T2, T3]: Monad[[a](T1, T2, T3) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function4Instance[T1, T2, T3, T4]: Monad[[a](T1, T2, T3, T4) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function5Instance[T1, T2, T3, T4, T5]: Monad[[a](T1, T2, T3, T4, T5) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[a](T1, T2, T3, T4, T5, T6) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[a](T1, T2, T3, T4, T5, T6, T7) ⇒ a]
- Definition Classes
- FunctionInstances
-
implicit
def
function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[a](T1, T2, T3, T4, T5, T6, T7, T8) ⇒ a]
- Definition Classes
- FunctionInstances
-
def
get[S]: State[S, S]
- Definition Classes
- StateFunctions
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
gets[S, T](f: (S) ⇒ T): State[S, T]
- Definition Classes
- StateFunctions
-
final
def
groupByM[A, M[_]](as: List[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[List[A]]]
Split at each point where
p(as(n), as(n+1))
yields false.Split at each point where
p(as(n), as(n+1))
yields false.- Definition Classes
- ListFunctions
-
final
def
groupWhen[A](as: List[A])(p: (A, A) ⇒ Boolean): List[List[A]]
groupByM
specialized to scalaz.Id.Id.groupByM
specialized to scalaz.Id.Id.- Definition Classes
- ListFunctions
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
heads[A](as: Stream[A]): Stream[Stream[A]]
[as take 1, as take 2, ..., as]
[as take 1, as take 2, ..., as]
- Definition Classes
- StreamFunctions
-
def
iModify[S1, S2](f: (S1) ⇒ S2): IndexedState[S1, S2, Unit]
- Definition Classes
- IndexedStateFunctions
-
def
iPut[S1, S2](s: S2): IndexedState[S1, S2, Unit]
- Definition Classes
- IndexedStateFunctions
-
val
id: Traverse1[Id] with Each[Id] with Monad[Id] with Comonad[Id] with Cojoin[Id] with Distributive[Id] with Zip[Id] with Unzip[Id] with Cozip[Id]
- Definition Classes
- IdInstances
-
def
init[S]: State[S, S]
- Definition Classes
- StateFunctions
-
final
def
initz[A](as: List[A]): List[List[A]]
[Nil, as take 1, as take 2, ..., as]
[Nil, as take 1, as take 2, ..., as]
- Definition Classes
- ListFunctions
-
implicit
val
intInstance: Monoid[Int] with Enum[Int] with Show[Int]
- Definition Classes
- AnyValInstances
-
implicit
val
intMultiplicationNewType: Monoid[@@[Int, Multiplication]] with Enum[@@[Int, Multiplication]]
- Definition Classes
- AnyValInstances
-
final
def
intersperse[A](as: Stream[A], a: A): Stream[A]
Intersperse the element
a
between each adjacent pair of elements inas
Intersperse the element
a
between each adjacent pair of elements inas
- Definition Classes
- StreamFunctions
-
final
def
intersperse[A](as: List[A], a: A): List[A]
Intersperse the element
a
between each adjacent pair of elements inas
Intersperse the element
a
between each adjacent pair of elements inas
- Definition Classes
- ListFunctions
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
implicit
def
lift2[F[_], A, B, C](f: (A, B) ⇒ C)(implicit F: Apply[F]): (F[A], F[B]) ⇒ F[C]
- Definition Classes
- ToApplyOps
-
implicit
def
lift3[F[_], A, B, C, D](f: (A, B, C) ⇒ D)(implicit F: Apply[F]): (F[A], F[B], F[C]) ⇒ F[D]
- Definition Classes
- ToApplyOps
-
implicit
def
lift4[F[_], A, B, C, D, E](f: (A, B, C, D) ⇒ E)(implicit F: Apply[F]): (F[A], F[B], F[C], F[D]) ⇒ F[E]
- Definition Classes
- ToApplyOps
-
implicit
def
listEqual[A](implicit A0: Equal[A]): ListEqual[A]
- Definition Classes
- ListInstances0
-
implicit
val
listInstance: Traverse[List] with MonadPlus[List] with Each[List] with Index[List] with Length[List] with Zip[List] with Unzip[List] with IsEmpty[List] { def empty[A]: scala.collection.immutable.Nil.type }
- Definition Classes
- ListInstances
-
implicit
def
listMonoid[A]: Monoid[List[A]]
- Definition Classes
- ListInstances
-
implicit
def
listOrder[A](implicit A0: Order[A]): Order[List[A]]
- Definition Classes
- ListInstances
-
implicit
def
listShow[A](implicit arg0: Show[A]): Show[List[A]]
- Definition Classes
- ListInstances
-
implicit
val
longInstance: Monoid[Long] with Enum[Long] with Show[Long]
- Definition Classes
- AnyValInstances
-
implicit
val
longMultiplicationNewType: Monoid[@@[Long, Multiplication]] with Enum[@@[Long, Multiplication]]
- Definition Classes
- AnyValInstances
-
final
def
mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])
All of the
B
s, in order, and the finalC
acquired by a stateful left fold overas
.All of the
B
s, in order, and the finalC
acquired by a stateful left fold overas
.- Definition Classes
- ListFunctions
-
final
def
mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) ⇒ (C, B)): (C, List[B])
All of the
B
s, in orderas
-wise, and the finalC
acquired by a stateful right fold overas
.All of the
B
s, in orderas
-wise, and the finalC
acquired by a stateful right fold overas
.- Definition Classes
- ListFunctions
-
implicit
def
mapEntryBitraverse: Bitraverse[Entry]
- Definition Classes
- MapInstances
-
implicit
def
mapEqual[K, V](implicit arg0: Order[K], arg1: Equal[V]): Equal[Map[K, V]]
- Definition Classes
- MapInstances0
-
implicit
def
mapInstance[K]: Traverse[[V]Map[K, V]] with IsEmpty[[V]Map[K, V]]
Covariant over the value parameter, where
plus
applies theLast
semigroup to values.Covariant over the value parameter, where
plus
applies theLast
semigroup to values.- Definition Classes
- MapInstances
-
implicit
def
mapMonoid[K, V](implicit arg0: Semigroup[V]): Monoid[Map[K, V]]
Map union monoid, unifying values with
V
'sappend
.Map union monoid, unifying values with
V
'sappend
.- Definition Classes
- MapInstances
-
implicit
def
mapOrder[K, V](implicit arg0: Order[K], arg1: Order[V]): Order[Map[K, V]]
- Definition Classes
- MapInstances
-
implicit
def
mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[Map[K, V]]
- Definition Classes
- MapInstances
-
final
def
merge[A](s1: Stream[A], s2: Stream[A]): Stream[A]
- Definition Classes
- StreamFunctions
-
def
modify[S](f: (S) ⇒ S): State[S, Unit]
- Definition Classes
- StateFunctions
-
def
mzero[F](implicit F: Monoid[F]): F
- Definition Classes
- ToMonoidOps
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
implicit
val
nodeSeqInstance: Monoid[NodeSeq] with Show[NodeSeq] with Equal[NodeSeq]
- Definition Classes
- NodeSeqInstances
-
final
def
none[A]: Option[A]
scala.None with a sometimes more convenient type.
scala.None with a sometimes more convenient type.
- Definition Classes
- OptionFunctions
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
implicit
def
optionEqual[A](implicit A0: Equal[A]): OptionEqual[A]
- Definition Classes
- OptionInstances0
-
implicit
def
optionFirst[A]: Monoid[FirstOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionFirstMonad: Monad[FirstOption]
- Definition Classes
- OptionInstances
-
implicit
def
optionFirstOrder[A](implicit arg0: Order[A]): Order[FirstOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionFirstShow[A](implicit arg0: Show[A]): Show[FirstOption[A]]
- Definition Classes
- OptionInstances
-
implicit
val
optionInstance: Traverse[Option] with MonadPlus[Option] with Each[Option] with Index[Option] with Length[Option] with Cozip[Option] with Zip[Option] with Unzip[Option] with IsEmpty[Option] { def point[A](a: => A): Some[A] }
- Definition Classes
- OptionInstances
-
implicit
def
optionLast[A]: Monoid[LastOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionLastMonad: Monad[LastOption]
- Definition Classes
- OptionInstances
-
implicit
def
optionLastOrder[A](implicit arg0: Order[A]): Order[LastOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionLastShow[A](implicit arg0: Show[A]): Show[LastOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMaxMonad: Monad[MaxOption]
- Definition Classes
- OptionInstances
-
implicit
def
optionMaxOrder[A](implicit arg0: Order[A]): Order[MaxOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMaxShow[A](implicit arg0: Show[A]): Show[MaxOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMinMonad: Monad[MinOption]
- Definition Classes
- OptionInstances
-
implicit
def
optionMinOrder[A](implicit arg0: Order[A]): Order[MinOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMinShow[A](implicit arg0: Show[A]): Show[MinOption[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionMonoid[A](implicit arg0: Semigroup[A]): Monoid[Option[A]]
- Definition Classes
- OptionInstances
-
implicit
def
optionOrder[A](implicit A0: Order[A]): Order[Option[A]]
Add
None
as an element less than allA
s.Add
None
as an element less than allA
s.- Definition Classes
- OptionInstances
-
implicit
def
optionShow[A](implicit arg0: Show[A]): Show[Option[A]]
- Definition Classes
- OptionInstances
-
final
def
orEmpty[A, M[_]](oa: Option[A])(implicit arg0: Applicative[M], arg1: PlusEmpty[M]): M[A]
Returns the item contained in the Option wrapped in type M if the Option is defined, otherwise, the empty value for type M.
Returns the item contained in the Option wrapped in type M if the Option is defined, otherwise, the empty value for type M.
- Definition Classes
- OptionFunctions
-
def
orderingMonoid[A]: Monoid[scala.math.Ordering[A]]
- Definition Classes
- OrderingInstances
-
def
parseBoolean(s: String): Validation[IllegalArgumentException, Boolean]
- Definition Classes
- StringFunctions
-
def
parseByte(s: String): Validation[NumberFormatException, Byte]
- Definition Classes
- StringFunctions
-
def
parseDouble(s: String): Validation[NumberFormatException, Double]
- Definition Classes
- StringFunctions
-
def
parseFloat(s: String): Validation[NumberFormatException, Float]
- Definition Classes
- StringFunctions
-
def
parseInt(s: String): Validation[NumberFormatException, Int]
- Definition Classes
- StringFunctions
-
def
parseLong(s: String): Validation[NumberFormatException, Long]
- Definition Classes
- StringFunctions
-
def
parseShort(s: String): Validation[NumberFormatException, Short]
- Definition Classes
- StringFunctions
-
def
parserMonad[P <: Parsers](p: P): Monad[[A]std.util.parsing.combinator.Parsers.parserMonad.P.Parser[A]] forSome {val _1701: ParsersW[P]}
- Definition Classes
- Parsers
-
implicit
val
partialFunctionInstance: Arrow[PartialFunction] with Category[PartialFunction] with Choice[PartialFunction]
- Definition Classes
- PartialFunctionInstances
-
final
def
partitionM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]
A pair of passing and failing values of
as
againstp
.A pair of passing and failing values of
as
againstp
.- Definition Classes
- ListFunctions
-
def
plural(s: String, n: Long): String
Returns the same String value if the given value is 1 otherwise pluralises this String by appending an "s" unless this String ends with "y" and not one of ["ay", "ey", "iy", "oy", "uy"] in which case the 'y' character is chopped and "ies" is appended.
Returns the same String value if the given value is 1 otherwise pluralises this String by appending an "s" unless this String ends with "y" and not one of ["ay", "ey", "iy", "oy", "uy"] in which case the 'y' character is chopped and "ies" is appended.
- Definition Classes
- StringFunctions
-
final
def
powerset[A](as: List[A]): List[List[A]]
- Definition Classes
- ListFunctions
-
def
put[S](s: S): State[S, Unit]
- Definition Classes
- StateFunctions
-
implicit
val
setInstance: Foldable[Set] with IsEmpty[Set] with Length[Set]
- Definition Classes
- SetInstances
-
implicit
def
setMonoid[A]: Monoid[Set[A]]
- Definition Classes
- SetInstances
-
implicit
def
setOrder[A](implicit arg0: Order[A]): Order[Set[A]]
We could derive set equality from
Equal[A]
, but it would beO(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 beO(n^2)
. Instead, we require
Order[A], reducing the complexity to
O(log n)If
Equal[A].equalIsNatural == true
, thanAny#==
is used.- Definition Classes
- SetInstances
-
implicit
def
setShow[A](implicit arg0: Show[A]): Show[Set[A]]
- Definition Classes
- SetInstances
-
implicit
val
shortInstance: Monoid[Short] with Enum[Short] with Show[Short]
- Definition Classes
- AnyValInstances
-
implicit
val
shortMultiplicationNewType: Monoid[@@[Short, Multiplication]] with Enum[@@[Short, Multiplication]]
- Definition Classes
- AnyValInstances
-
final
def
some[A](a: A): Option[A]
scala.Some.apply with a sometimes more convenient type.
scala.Some.apply with a sometimes more convenient type.
- Definition Classes
- OptionFunctions
-
final
def
spanM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
A pair of the longest prefix of passing
as
againstp
, and the remainder.A pair of the longest prefix of passing
as
againstp
, and the remainder.- Definition Classes
- ListFunctions
-
def
state[S, A](a: A): State[S, A]
- Definition Classes
- StateFunctions
-
implicit
def
streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]
- Definition Classes
- StreamInstances
-
implicit
val
streamInstance: Traverse[Stream] with MonadPlus[Stream] with Each[Stream] with Index[Stream] with Length[Stream] with Zip[Stream] with Unzip[Stream] with IsEmpty[Stream]
- Definition Classes
- StreamInstances
-
implicit
def
streamMonoid[A]: Monoid[Stream[A]]
- Definition Classes
- StreamInstances
-
implicit
def
streamShow[A](implicit A0: Show[A]): Show[Stream[A]]
- Definition Classes
- StreamInstances
-
implicit
val
streamZipApplicative: Applicative[[α]Stream[α] with AnyRef { type Tag = scalaz.Tags.Zip }]
An alternative scalaz.Applicative instance for
Stream
, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.An alternative scalaz.Applicative instance for
Stream
, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.Example:
import scalaz.Tags.Zip streamZipApplicative.apply2(Zip(Stream(1, 2)), Zip(Stream(3, 4)))(_ * _) // Stream(3, 8)
- Definition Classes
- StreamInstances
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
tails[A](as: Stream[A]): Stream[Stream[A]]
[as, as.tail, as.tail.tail, ..., Stream(as.last)]
[as, as.tail, as.tail.tail, ..., Stream(as.last)]
- Definition Classes
- StreamFunctions
-
final
def
tailz[A](as: List[A]): List[List[A]]
[as, as.tail, as.tail.tail, ..., Nil]
[as, as.tail, as.tail.tail, ..., Nil]
- Definition Classes
- ListFunctions
-
final
def
takeUntilM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]
Run
p(a)
s and collectas
whilep
yields false.Run
p(a)
s and collectas
whilep
yields false. Don't run anyp
s after the first true.- Definition Classes
- ListFunctions
-
final
def
takeWhileM[A, M[_]](as: List[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[List[A]]
Run
p(a)
s and collectas
whilep
yields true.Run
p(a)
s and collectas
whilep
yields true. Don't run anyp
s after the first false.- Definition Classes
- ListFunctions
-
final
def
toFailure[A, B](oa: Option[A])(b: ⇒ B): Validation[A, B]
- Definition Classes
- OptionFunctions
-
final
def
toLeft[A, B](oa: Option[A])(b: ⇒ B): \/[A, B]
- Definition Classes
- OptionFunctions
-
final
def
toNel[A](as: List[A]): Option[NonEmptyList[A]]
- Definition Classes
- ListFunctions
-
final
def
toRight[A, E](oa: Option[A])(e: ⇒ E): \/[E, A]
- Definition Classes
- OptionFunctions
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
toSuccess[A, E](oa: Option[A])(e: ⇒ E): Validation[E, A]
- Definition Classes
- OptionFunctions
-
final
def
toZipper[A](as: Stream[A]): Option[Zipper[A]]
- Definition Classes
- StreamFunctions
-
final
def
toZipper[A](as: List[A]): Option[Zipper[A]]
- Definition Classes
- ListFunctions
-
implicit
def
tuple1Cozip: Cozip[Tuple1]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple1Equal[A1](implicit A1: Equal[A1]): Tuple1Equal[A1]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple1Instance: Traverse[Tuple1] with Monad[Tuple1] with Comonad[Tuple1]
Tuple1[A]
is isomorphic toId[X]
Tuple1[A]
is isomorphic toId[X]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple1Monoid[A1](implicit A1: Monoid[A1]): Tuple1Monoid[A1]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple1Order[A1](implicit A1: Order[A1]): Tuple1Order[A1]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Tuple1Semigroup[A1]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple1Show[A1](implicit A1: Show[A1]): Tuple1Show[A1]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple2Bitraverse[A1, A2]: Bitraverse[Tuple2]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple2Cozip[A1]: Cozip[[x](A1, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Tuple2Equal[A1, A2]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple2Instance[A1]: Traverse[[x](A1, x)] with Comonad[[x](A1, x)]
Product functor and comonad
Product functor and comonad
- Definition Classes
- TupleInstances0
-
implicit
def
tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[x](A1, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Tuple2Monoid[A1, A2]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Tuple2Order[A1, A2]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Tuple2Semigroup[A1, A2]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Tuple2Show[A1, A2]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple3Cozip[A1, A2]: Cozip[[x](A1, A2, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Tuple3Equal[A1, A2, A3]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple3Functor[A1, A2]: Traverse[[x](A1, A2, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[x](A1, A2, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Tuple3Monoid[A1, A2, A3]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Tuple3Order[A1, A2, A3]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Tuple3Semigroup[A1, A2, A3]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Tuple3Show[A1, A2, A3]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple4Cozip[A1, A2, A3]: Cozip[[x](A1, A2, A3, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple4Equal[A1, A2, A3, A4](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4]): Tuple4Equal[A1, A2, A3, A4]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple4Functor[A1, A2, A3]: Traverse[[x](A1, A2, A3, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[x](A1, A2, A3, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple4Monoid[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Tuple4Monoid[A1, A2, A3, A4]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple4Order[A1, A2, A3, A4](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4]): Tuple4Order[A1, A2, A3, A4]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple4Semigroup[A1, A2, A3, A4](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4]): Tuple4Semigroup[A1, A2, A3, A4]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple4Show[A1, A2, A3, A4](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4]): Tuple4Show[A1, A2, A3, A4]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple5Cozip[A1, A2, A3, A4]: Cozip[[x](A1, A2, A3, A4, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple5Equal[A1, A2, A3, A4, A5](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3], A4: Equal[A4], A5: Equal[A5]): Tuple5Equal[A1, A2, A3, A4, A5]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple5Functor[A1, A2, A3, A4]: Traverse[[x](A1, A2, A3, A4, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[x](A1, A2, A3, A4, x)]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple5Monoid[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Tuple5Monoid[A1, A2, A3, A4, A5]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple5Order[A1, A2, A3, A4, A5](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3], A4: Order[A4], A5: Order[A5]): Tuple5Order[A1, A2, A3, A4, A5]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple5Semigroup[A1, A2, A3, A4, A5](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3], A4: Semigroup[A4], A5: Semigroup[A5]): Tuple5Semigroup[A1, A2, A3, A4, A5]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple5Show[A1, A2, A3, A4, A5](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3], A4: Show[A4], A5: Show[A5]): Tuple5Show[A1, A2, A3, A4, A5]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[x](A1, A2, A3, A4, A5, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple6Equal[A1, A2, A3, A4, A5, A6]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[x](A1, A2, A3, A4, A5, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple6Monad[A1, A2, A3, A4, A5](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5]): Monad[[x](A1, A2, A3, A4, A5, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple6Monoid[A1, A2, A3, A4, A5, A6]
- Definition Classes
- TupleInstances1
-
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]): Tuple6Order[A1, A2, A3, A4, A5, A6]
- Definition Classes
- TupleInstances1
-
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]): Tuple6Semigroup[A1, A2, A3, A4, A5, A6]
- Definition Classes
- TupleInstances0
-
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]): Tuple6Show[A1, A2, A3, A4, A5, A6]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[x](A1, A2, A3, A4, A5, A6, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple7Equal[A1, A2, A3, A4, A5, A6, A7]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[x](A1, A2, A3, A4, A5, A6, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple7Monad[A1, A2, A3, A4, A5, A6](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6]): Monad[[x](A1, A2, A3, A4, A5, A6, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple7Monoid[A1, A2, A3, A4, A5, A6, A7]
- Definition Classes
- TupleInstances1
-
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]): Tuple7Order[A1, A2, A3, A4, A5, A6, A7]
- Definition Classes
- TupleInstances1
-
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]): Tuple7Semigroup[A1, A2, A3, A4, A5, A6, A7]
- Definition Classes
- TupleInstances0
-
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]): Tuple7Show[A1, A2, A3, A4, A5, A6, A7]
- Definition Classes
- TupleInstances1
-
implicit
def
tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[x](A1, A2, A3, A4, A5, A6, A7, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple8Equal[A1, A2, A3, A4, A5, A6, A7, A8]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[x](A1, A2, A3, A4, A5, A6, A7, x)]
- Definition Classes
- TupleInstances0
-
implicit
def
tuple8Monad[A1, A2, A3, A4, A5, A6, A7](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4], A5: Monoid[A5], A6: Monoid[A6], A7: Monoid[A7]): Monad[[x](A1, A2, A3, A4, A5, A6, A7, x)]
- Definition Classes
- TupleInstances1
-
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]): Tuple8Monoid[A1, A2, A3, A4, A5, A6, A7, A8]
- Definition Classes
- TupleInstances1
-
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]): Tuple8Order[A1, A2, A3, A4, A5, A6, A7, A8]
- Definition Classes
- TupleInstances1
-
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]): Tuple8Semigroup[A1, A2, A3, A4, A5, A6, A7, A8]
- Definition Classes
- TupleInstances0
-
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]): Tuple8Show[A1, A2, A3, A4, A5, A6, A7, A8]
- Definition Classes
- TupleInstances1
-
def
unfold[A, B](seed: A)(f: (A) ⇒ Option[(B, A)]): Stream[B]
- Definition Classes
- StreamFunctions
-
final
def
unfoldForest[A, B](as: Stream[A])(f: (A) ⇒ (B, () ⇒ Stream[A])): Stream[Tree[B]]
- Definition Classes
- StreamFunctions
-
final
def
unfoldForestM[A, B, M[_]](as: Stream[A])(f: (A) ⇒ M[(B, Stream[A])])(implicit arg0: Monad[M]): M[Stream[Tree[B]]]
- Definition Classes
- StreamFunctions
-
implicit
val
unitInstance: Monoid[Unit] with Enum[Unit] with Show[Unit]
- Definition Classes
- AnyValInstances
-
def
unsafeCharsNel(s: String): NonEmptyList[Char]
- Definition Classes
- StringFunctions
-
implicit
def
vectorEqual[A](implicit A0: Equal[A]): IndexedSeqEqual[A, Vector[A]]
- Definition Classes
- VectorInstances0
-
implicit
val
vectorInstance: Traverse[std.VectorInstances.generic.IxSq] with MonadPlus[std.VectorInstances.generic.IxSq] with Each[std.VectorInstances.generic.IxSq] with Index[std.VectorInstances.generic.IxSq] with Length[std.VectorInstances.generic.IxSq] with Zip[std.VectorInstances.generic.IxSq] with Unzip[std.VectorInstances.generic.IxSq] with IsEmpty[std.VectorInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.Scalaz.generic.IxSq[A]): scalaz.Scalaz.generic.IxSq[A] }
- Definition Classes
- VectorInstances
-
implicit
def
vectorMonoid[A]: Monoid[Vector[A]]
- Definition Classes
- VectorInstances
-
implicit
def
vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]
- Definition Classes
- VectorInstances
-
implicit
def
vectorShow[A](implicit arg0: Show[A]): Show[Vector[A]]
- Definition Classes
- VectorInstances
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
zapp[A, B, C](a: Stream[A])(f: Stream[(A) ⇒ (B) ⇒ C]): Stream[(B) ⇒ C]
- Definition Classes
- StreamFunctions
-
final
def
zipperEnd[A](as: Stream[A]): Option[Zipper[A]]
- Definition Classes
- StreamFunctions
-
final
def
zipperEnd[A](as: List[A]): Option[Zipper[A]]
- Definition Classes
- ListFunctions
-
def
∅[F](implicit F: Monoid[F]): F
- Definition Classes
- ToMonoidOps
-
implicit
object
booleanInstance
extends Enum[Boolean] with Show[Boolean]
- Definition Classes
- AnyValInstances
-
implicit
object
stringInstance
extends Monoid[String] with Show[String] with Equal[String] with Order[String] with IsEmpty[[α]String]
- Definition Classes
- StringInstances
-
object
generic
extends IndexedSeqSubVector with IndexedSeqSubInstances
- Definition Classes
- VectorInstances
Deprecated Value Members
-
implicit
val
intMetricSpace: MetricSpace[Int]
Warning: the triangle inequality will not hold if
b - a
overflows.Warning: the triangle inequality will not hold if
b - a
overflows.- Definition Classes
- AnyValInstances
- Annotations
- @deprecated
- Deprecated
(Since version 7.0.1) MetricSpace is deprecated