Scalaz

trait ToTryOps
trait ToMapOps
trait ToListOps
trait BigInts
trait ToDataOps
trait ToNelOps
trait ToTreeOps
trait ToIdOps
trait ToProChoiceOps0[[=>:[_, _]] =>> ProChoice[=>:]]
trait ToProChoiceOpsU[[=>:[_, _]] =>> ProChoice[=>:]]
trait ToAlignOps0[[F[_]] =>> Align[F]]
trait ToAlignOpsU[[F[_]] =>> Align[F]]
trait ToOptionalOps0[[F[_]] =>> Optional[F]]
trait ToOptionalOpsU[[F[_]] =>> Optional[F]]
trait ToTraverse1Ops0[[F[_]] =>> Traverse1[F]]
trait ToTraverse1OpsU[[F[_]] =>> Traverse1[F]]
trait ToFoldable1Ops0[[F[_]] =>> Foldable1[F]]
trait ToFoldable1OpsU[[F[_]] =>> Foldable1[F]]
trait ToApplicativeErrorOps0[[F[_], S] =>> ApplicativeError[F, S]]
trait ToMonadErrorOps0[[F[_], S] =>> MonadError[F, S]]
trait ToMonadListenOps0[[F[_], W] =>> MonadListen[F, W]]
trait ToMonadTellOps0[[F[_], S] =>> MonadTell[F, S]]
trait ToUnzipOps0[[F[_]] =>> Unzip[F]]
trait ToUnzipOpsU[[F[_]] =>> Unzip[F]]
trait ToZipOps0[[F[_]] =>> Zip[F]]
trait ToZipOpsU[[F[_]] =>> Zip[F]]
trait ToSplitOps0[[=>:[_, _]] =>> Split[=>:]]
trait ToSplitOpsU[[=>:[_, _]] =>> Split[=>:]]
trait ToChoiceOps0[[=>:[_, _]] =>> Choice[=>:]]
trait ToChoiceOpsU[[=>:[_, _]] =>> Choice[=>:]]
trait ToFoldableOps0[[F[_]] =>> Foldable[F]]
trait ToFoldableOpsU[[F[_]] =>> Foldable[F]]
trait ToStrongOps0[[=>:[_, _]] =>> Strong[=>:]]
trait ToStrongOpsU[[=>:[_, _]] =>> Strong[=>:]]
trait ToProfunctorOps0[[=>:[_, _]] =>> Profunctor[=>:]]
trait ToProfunctorOpsU[[=>:[_, _]] =>> Profunctor[=>:]]
trait ToArrowOps0[[=>:[_, _]] =>> Arrow[=>:]]
trait ToArrowOpsU[[=>:[_, _]] =>> Arrow[=>:]]
trait ToCategoryOps0[[=>:[_, _]] =>> Category[=>:]]
trait ToCategoryOpsU[[=>:[_, _]] =>> Category[=>:]]
trait ToComposeOps0[[=>:[_, _]] =>> Compose[=>:]]
trait ToComposeOpsU[[=>:[_, _]] =>> Compose[=>:]]
trait ToBitraverseOps0[[F[_, _]] =>> Bitraverse[F]]
trait ToBitraverseOpsU[[F[_, _]] =>> Bitraverse[F]]
trait ToAssociativeOps0[[=>:[_, _]] =>> Associative[=>:]]
trait ToAssociativeOpsU[[=>:[_, _]] =>> Associative[=>:]]
trait ToBifunctorOps0[[F[_, _]] =>> Bifunctor[F]]
trait ToBifunctorOpsU[[F[_, _]] =>> Bifunctor[F]]
trait ToTraverseOps0[[F[_]] =>> Traverse[F]]
trait ToTraverseOpsU[[F[_]] =>> Traverse[F]]
trait ToMonadPlusOps0[[F[_]] =>> MonadPlus[F]]
trait ToMonadPlusOpsU[[F[_]] =>> MonadPlus[F]]
trait ToAltOps0[[F[_]] =>> Alt[F]]
trait ToAltOpsU[[F[_]] =>> Alt[F]]
trait ToPlusOps0[[F[_]] =>> Plus[F]]
trait ToPlusOpsU[[F[_]] =>> Plus[F]]
trait ToCozipOps0[[F[_]] =>> Cozip[F]]
trait ToCozipOpsU[[F[_]] =>> Cozip[F]]
trait ToBifoldableOps0[[F[_, _]] =>> Bifoldable[F]]
trait ToBifoldableOpsU[[F[_, _]] =>> Bifoldable[F]]
trait ToComonadOps0[[F[_]] =>> Comonad[F]]
trait ToComonadOpsU[[F[_]] =>> Comonad[F]]
trait ToMonadOps0[[F[_]] =>> Monad[F]]
trait ToMonadOpsU[[F[_]] =>> Monad[F]]
trait ToBindOps0[[F[_]] =>> Bind[F]]
trait ToBindOpsU[[F[_]] =>> Bind[F]]
trait ToApplicativeOps0[[F[_]] =>> Applicative[F]]
trait ToApplicativeOpsU[[F[_]] =>> Applicative[F]]
trait ToApplyOps0[[F[_]] =>> Apply[F]]
trait ToApplyOpsU[[F[_]] =>> Apply[F]]
trait ToContravariantOps0[[F[_]] =>> Contravariant[F]]
trait ToContravariantOpsU[[F[_]] =>> Contravariant[F]]
trait ToFunctorOps0[[F[_]] =>> Functor[F]]
trait ToFunctorOpsU[[F[_]] =>> Functor[F]]
trait ToPlusEmptyOps0[[F[_]] =>> PlusEmpty[F]]
trait ToPlusEmptyOpsU[[F[_]] =>> PlusEmpty[F]]
trait ToEnumOps
trait ToShowOps
trait ToBandOps
class Object
trait Matchable
class Any

Type members

Inherited classlikes

Inherited from
ToApplicativeOps0
trait FunctorIdV[A]
Inherited from
ToFunctorOps0
trait LiftV[F[_], A, B]
Inherited from
ToFunctorOps0
final
class UnzipPairOps[F[_], A, B]
Inherited from
ToUnzipOps0
Inherited from
AnyValInstances

Inherited types

type Id[X] = X

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

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

Inherited from
IdInstances
type Identity[X] = Need[X]
Inherited from
IdInstances

Value members

Inherited methods

final
def <^>[A, B : Monoid](as: List[A])(f: NonEmptyList[A] => B): B

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

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

Inherited from
ListFunctions
final
def ToScalazOrderFromOrdering[A](oa: Ordering[A]): Order[A]
Inherited from
OrderingFunctions
def ^[F[_], A, B, C](fa: => F[A], fb: => F[B])(f: (A, B) => C)(implicit F: Apply[F]): F[C]
Inherited from
ToApplyOps0
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]
Inherited from
ToApplyOps0
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]
Inherited from
ToApplyOps0
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]
Inherited from
ToApplyOps0
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]
Inherited from
ToApplyOps0
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]
Inherited from
ToApplyOps0
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))]

Inherited from
ListFunctions
final
def allPairs[A](as: List[A]): List[(A, A)]

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

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

Inherited from
ListFunctions
final
def alter[K, A](m: SortedMap[K, A], k: K)(f: Option[A] => Option[A]): SortedMap[K, A]

Vary the value of m get k.

Vary the value of m get k.

Inherited from
SortedMapFunctions
final
def alter[K, A](m: Map[K, A], k: K)(f: Option[A] => Option[A]): Map[K, A]

Vary the value of m get k.

Vary the value of m get k.

Inherited from
MapFunctions
final
def breakM[A, M[_] : Monad](as: List[A])(p: A => M[Boolean]): M[(List[A], List[A])]

spanM with p's complement.

spanM with p's complement.

Inherited from
ListFunctions
final
def cata[A, X](oa: Option[A])(some: A => X, none: => X): X

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.

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.

Inherited from
OptionFunctions
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.

Inherited from
StringFunctions
def charsNel(s: String): Maybe[NonEmptyList[Char]]

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

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

Inherited from
StringFunctions
final
def conditional(p: Boolean, q: => Boolean): Boolean

Conditional.

Conditional.

p q  p --> q
0 0  1
0 1  1
1 0  0
1 1  1
Inherited from
BooleanFunctions
final
def conjunction(p: Boolean, q: => Boolean): Boolean

Conjunction. (AND)

Conjunction. (AND)

p q  p ∧ q
0 0  0
0 1  0
1 0  0
1 1  1
Inherited from
BooleanFunctions
def constantIndexedState[S1, S2, A](a: A, s: => S2): IndexedState[S1, S2, A]
Inherited from
IndexedStateFunctions
def constantState[S, A](a: A, s: => S): State[S, A]
Inherited from
StateFunctions
final
def disjunction(p: Boolean, q: => Boolean): Boolean

Disjunction. (OR)

Disjunction. (OR)

p q  p ∨ q
0 0  0
0 1  1
1 0  1
1 1  1
Inherited from
BooleanFunctions
final
def emptyOrPoint[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

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

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

Inherited from
BooleanFunctions
final
def emptyOrPointNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): NaturalTransformation[Id, M]

emptyOrPoint curried into a natural transformation.

emptyOrPoint curried into a natural transformation.

Inherited from
BooleanFunctions
final
def filterM[A, M[_] : Applicative](as: List[A])(p: A => M[Boolean]): M[List[A]]
Inherited from
ListFunctions
final
def findM[A, M[_] : Monad](as: List[A])(p: A => M[Boolean]): M[Maybe[A]]

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

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

Inherited from
ListFunctions
final
def fix[A](f: (=> A) => A): A

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

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

Since

7.0.1

Inherited from
FunctionFunctions
final
def fold[A](cond: Boolean, t: => A, f: => A): A
Returns

t if cond is true, f otherwise

Inherited from
BooleanFunctions
final
def fold[A, X](oa: Option[A])(some: A => X, none: => X): X

Alias for cata

Alias for cata

Inherited from
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.

Inherited from
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.

Inherited from
OptionFunctions
def futureComonad(duration: Duration)(implicit executionContext: ExecutionContext): Comonad[Future]

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

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

Inherited from
FutureInstances
def get[S]: State[S, S]
Inherited from
StateFunctions
final
def getOrAdd[F[_], K, A](m: SortedMap[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(SortedMap[K, A], A)]

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

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

Inherited from
SortedMapFunctions
final
def getOrAdd[F[_], K, A](m: Map[K, A], k: K)(fa: => F[A])(implicit F: Applicative[F]): F[(Map[K, A], A)]

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

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

Inherited from
MapFunctions
final
def getOrElseF[A, F[_] : Applicative](oa: Option[A])(fa: => F[A]): F[A]

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

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

Inherited from
OptionFunctions
def gets[S, T](f: S => T): State[S, T]
Inherited from
StateFunctions
final
def groupBy1[A, B](as: List[A])(f: A => B): Map[B, NonEmptyList[A]]

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

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

Inherited from
ListFunctions
final
def groupWhen[A](as: List[A])(p: (A, A) => Boolean): List[NonEmptyList[A]]

groupWhenM specialized to scalaz.Id.Id.

groupWhenM specialized to scalaz.Id.Id.

Inherited from
ListFunctions
final
def groupWhenM[A, M[_] : Monad](as: List[A])(p: (A, A) => M[Boolean]): M[List[NonEmptyList[A]]]

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

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

Inherited from
ListFunctions
final
def heads[A](as: LazyList[A]): LazyList[LazyList[A]]

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

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

Inherited from
LazyListFunctions
def iModify[S1, S2](f: S1 => S2): IndexedState[S1, S2, Unit]
Inherited from
IndexedStateFunctions
def iPut[S1, S2](s: S2): IndexedState[S1, S2, Unit]
Inherited from
IndexedStateFunctions
def init[S]: State[S, S]
Inherited from
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]

Inherited from
ListFunctions
final
def insertWith[K, A](m1: SortedMap[K, A], k: K, v: A)(f: (A, A) => A): SortedMap[K, A]

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

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

Inherited from
SortedMapFunctions
final
def insertWith[K, A](m1: Map[K, A], k: K, v: A)(f: (A, A) => A): Map[K, A]

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

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

Inherited from
MapFunctions
final
def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
Inherited from
LazyListFunctions
final
def intersectWith[K : Ordering, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (A, B) => C): SortedMap[K, C]

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

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

Inherited from
SortedMapFunctions
final
def intersectWith[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (A, B) => C): Map[K, C]

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

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

Inherited from
MapFunctions
final
def intersectWithKey[K : Ordering, A, B, C](m1: SortedMap[K, A], m2: SortedMap[K, B])(f: (K, A, B) => C): SortedMap[K, C]

Like intersectWith, but tell f about the key.

Like intersectWith, but tell f about the key.

Inherited from
SortedMapFunctions
final
def intersectWithKey[K, A, B, C](m1: Map[K, A], m2: Map[K, B])(f: (K, A, B) => C): Map[K, C]

Like intersectWith, but tell f about the key.

Like intersectWith, but tell f about the key.

Inherited from
MapFunctions
final
def intersperse[A](as: LazyList[A], a: A): LazyList[A]

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

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

Inherited from
LazyListFunctions
final
def intersperse[A](as: List[A], a: A): List[A]

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

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

Inherited from
ListFunctions
final
def inverseConditional(p: Boolean, q: => Boolean): Boolean

Inverse Conditional.

Inverse Conditional.

p q  p <-- q
0 0  1
0 1  0
1 0  1
1 1  1
Inherited from
BooleanFunctions
final
def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])

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

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

Inherited from
ListFunctions
final
def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])

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

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

Inherited from
ListFunctions
final
def mapKeys[K, K2 : Ordering, A](m: SortedMap[K, A])(f: K => K2): SortedMap[K2, A]

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.

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.

Inherited from
SortedMapFunctions
final
def mapKeys[K, K2, A](m: Map[K, A])(f: K => K2): Map[K2, A]

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.

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.

Inherited from
MapFunctions
def mempty[F[_], A](implicit F: PlusEmpty[F]): F[A]
Inherited from
ToPlusEmptyOps0
def modify[S](f: S => S): State[S, Unit]
Inherited from
StateFunctions
def mzero[F](implicit F: Monoid[F]): F
Inherited from
ToMonoidOps
final
def nand(p: Boolean, q: => Boolean): Boolean

Negation of Conjunction. (NAND)

Negation of Conjunction. (NAND)

p q  p !&& q
0 0  1
0 1  1
1 0  1
1 1  0
Inherited from
BooleanFunctions
final
def negConditional(p: Boolean, q: => Boolean): Boolean

Negational of Conditional.

Negational of Conditional.

p q  p ⇏ q
0 0  0
0 1  0
1 0  1
1 1  0
Inherited from
BooleanFunctions
final
def negInverseConditional(p: Boolean, q: => Boolean): Boolean

Negation of Inverse Conditional.

Negation of Inverse Conditional.

p q  p <\- q
0 0  0
0 1  1
1 0  0
1 1  0
Inherited from
BooleanFunctions
final
def nil[A]: List[A]

scala.Nil with a sometimes more convenient type

scala.Nil with a sometimes more convenient type

Inherited from
ListFunctions
final
def none[A]: Option[A]

scala.None with a sometimes more convenient type.

scala.None with a sometimes more convenient type.

Inherited from
OptionFunctions
final
def nor(p: Boolean, q: => Boolean): Boolean

Negation of Disjunction. (NOR)

Negation of Disjunction. (NOR)

p q  p !|| q
0 0  1
0 1  0
1 0  0
1 1  0
Inherited from
BooleanFunctions
final
def option[A](cond: Boolean, a: => A): Option[A]

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

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

Inherited from
BooleanFunctions
final
def orEmpty[A, M[_] : PlusEmpty](oa: Option[A]): 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.

Inherited from
OptionFunctions
def orderingMonoid[A]: Monoid[Ordering[A]]
Inherited from
OrderingInstances
def parseBigDecimal(s: String): Validation[String, BigDecimal]
Inherited from
StringFunctions
def parseBigInt(s: String): Validation[String, BigInteger]
Inherited from
StringFunctions
def parseBoolean(s: String): Validation[String, Boolean]
Inherited from
StringFunctions
def parseByte(s: String): Validation[String, Byte]
Inherited from
StringFunctions
def parseDouble(s: String): Validation[String, Double]
Inherited from
StringFunctions
def parseFloat(s: String): Validation[String, Float]
Inherited from
StringFunctions
def parseInt(s: String): Validation[String, Int]
Inherited from
StringFunctions
def parseLong(s: String): Validation[String, Long]
Inherited from
StringFunctions
def parseShort(s: String): Validation[String, Short]
Inherited from
StringFunctions
final
def partitionM[A, M[_]](as: List[A])(p: A => M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]

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

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

Inherited from
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.

Inherited from
StringFunctions
final
def pointOrEmpty[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]

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

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

Inherited from
BooleanFunctions
final
def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): NaturalTransformation[Id, M]

pointOrEmpty curried into a natural transformation.

pointOrEmpty curried into a natural transformation.

Inherited from
BooleanFunctions
final
def powerset[A](as: List[A]): List[List[A]]
Inherited from
ListFunctions
def put[S](s: S): State[S, Unit]
Inherited from
StateFunctions
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.

Inherited from
OptionFunctions
final
def spanM[A, M[_] : Monad](as: List[A])(p: A => M[Boolean]): M[(List[A], List[A])]

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

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

Inherited from
ListFunctions
def state[S, A](a: A): State[S, A]
Inherited from
StateFunctions
final
def tailOption[A](as: List[A]): Option[List[A]]
Inherited from
ListFunctions
final
def tails[A](as: LazyList[A]): LazyList[LazyList[A]]

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

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

Inherited from
LazyListFunctions
final
def tailz[A](as: List[A]): List[List[A]]

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

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

Inherited from
ListFunctions
final
def takeUntilM[A, M[_] : Monad](as: List[A])(p: A => M[Boolean]): M[List[A]]

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

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

Inherited from
ListFunctions
final
def takeWhileM[A, M[_] : Monad](as: List[A])(p: A => M[Boolean]): M[List[A]]

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

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

Inherited from
ListFunctions
def test(p: Boolean): Int

Returns 1 if p is true, or 0 otherwise.

Returns 1 if p is true, or 0 otherwise.

Inherited from
BooleanFunctions
final
def toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
Inherited from
OptionFunctions
final
def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
Inherited from
OptionFunctions
final
def toLeft[A, B](oa: Option[A])(b: => B): A \/ B
Inherited from
OptionFunctions
final
def toMaybe[A](oa: Option[A]): Maybe[A]
Inherited from
OptionFunctions
final
def toNel[A](as: List[A]): Maybe[NonEmptyList[A]]
Inherited from
ListFunctions
final
def toRight[A, E](oa: Option[A])(e: => E): E \/ A
Inherited from
OptionFunctions
final
def toSuccess[A, E](oa: Option[A])(e: => E): Validation[E, A]
Inherited from
OptionFunctions
final
def toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
Inherited from
OptionFunctions
final
def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
Inherited from
LazyListFunctions
final
def toZipper[A](as: List[A]): Maybe[Zipper[A]]
Inherited from
ListFunctions
def unfold[A, B](seed: A)(f: A => Option[(B, A)]): LazyList[B]
Inherited from
LazyListFunctions
final
def unfoldForest[A, B](as: LazyList[A])(f: A => (B, () => LazyList[A])): LazyList[Tree[B]]
Inherited from
LazyListFunctions
final
def unfoldForestM[A, B, M[_] : Monad](as: LazyList[A])(f: A => M[(B, LazyList[A])]): M[LazyList[Tree[B]]]
Inherited from
LazyListFunctions
def unfoldm[A, B](seed: A)(f: A => Maybe[(B, A)]): LazyList[B]
Inherited from
LazyListFunctions
final
def unionWith[K : Ordering, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (A, A) => A): SortedMap[K, A]

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

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

Note

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

Inherited from
SortedMapFunctions
final
def unionWith[K, A](m1: Map[K, A], m2: Map[K, A])(f: (A, A) => A): Map[K, A]

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

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

Note

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

Inherited from
MapFunctions
final
def unionWithKey[K : Ordering, A](m1: SortedMap[K, A], m2: SortedMap[K, A])(f: (K, A, A) => A): SortedMap[K, A]

Like unionWith, but telling f about the key.

Like unionWith, but telling f about the key.

Inherited from
SortedMapFunctions
final
def unionWithKey[K, A](m1: Map[K, A], m2: Map[K, A])(f: (K, A, A) => A): Map[K, A]

Like unionWith, but telling f about the key.

Like unionWith, but telling f about the key.

Inherited from
MapFunctions
final
def unless(cond: Boolean)(f: => Unit): Unit

Executes the given side-effect if cond is false

Executes the given side-effect if cond is false

Inherited from
BooleanFunctions
final
def unlessM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]

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

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

Inherited from
BooleanFunctions
final
def unlessMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[[F[_]] =>> Applicative[F], MA]): M[Unit]

A version of unlessM that infers the type constructor M.

A version of unlessM that infers the type constructor M.

Inherited from
BooleanFunctions
final
def valueOrZero[A](cond: Boolean)(value: => A)(implicit z: Monoid[A]): A

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

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

Inherited from
BooleanFunctions
final
def when(cond: Boolean)(f: => Unit): Unit

Executes the given side-effect if cond is true

Executes the given side-effect if cond is true

Inherited from
BooleanFunctions
final
def whenM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]

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

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

Inherited from
BooleanFunctions
final
def whenMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[[F[_]] =>> Applicative[F], MA]): M[Unit]

A version of whenM that infers the type constructor M.

A version of whenM that infers the type constructor M.

Inherited from
BooleanFunctions
final
def zapp[A, B, C](a: LazyList[A])(f: LazyList[A => B => C]): LazyList[B => C]
Inherited from
LazyListFunctions
final
def zeroOrValue[A](cond: Boolean)(value: => A)(implicit z: Monoid[A]): A

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

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

Inherited from
BooleanFunctions
final
def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
Inherited from
LazyListFunctions
final
def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
Inherited from
ListFunctions
def [F](implicit F: Monoid[F]): F
Inherited from
ToMonoidOps

Inherited fields

val <:<: Category[<:<]
val =:=: Category[=:=]
Inherited from
IdInstances

Implicits

Inherited implicits

implicit
def ApplicativeIdV[A](v: => A): ApplicativeIdV[A]
Inherited from
ToApplicativeOps0
implicit
def MonadTransGFGA[F[_[_], _], G[_], A](gfga: G[F[G, A]]): MonadTransGFGA[F, G, A]
Inherited from
ToMonadTransOps
implicit
def ToAlignOps[F[_], A](v: F[A])(implicit F0: Align[F]): AlignOps[F, A]
Inherited from
ToAlignOps0
implicit
def ToAlignOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Align[F], FA]): AlignOps[M, A]
Inherited from
ToAlignOpsU
implicit
def ToAltOps[F[_], A](v: F[A])(implicit F0: Alt[F]): AltOps[F, A]
Inherited from
ToAltOps0
implicit
def ToAltOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Alt[F], FA]): AltOps[M, A]
Inherited from
ToAltOpsU
implicit
def ToApplicativeErrorOps[F[_], S, A](v: F[A])(implicit F0: ApplicativeError[F, S]): ApplicativeErrorOps[F, S, A]
implicit
def ToApplicativeOps[F[_], A](v: F[A])(implicit F0: Applicative[F]): ApplicativeOps[F, A]
Inherited from
ToApplicativeOps0
implicit
def ToApplicativeOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Applicative[F], FA]): ApplicativeOps[M, A]
Inherited from
ToApplicativeOpsU
implicit
def ToApplicativePlusOps[F[_], A](v: F[A])(implicit F0: ApplicativePlus[F]): ApplicativePlusOps[F, A]
Inherited from
ToApplicativePlusOps0
implicit
def ToApplicativePlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> ApplicativePlus[F], FA]): ApplicativePlusOps[M, A]
Inherited from
ToApplicativePlusOpsU
implicit
def ToApplyOps[F[_], A](v: F[A])(implicit F0: Apply[F]): ApplyOps[F, A]
Inherited from
ToApplyOps0
implicit
def ToApplyOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Apply[F], FA]): ApplyOps[M, A]
Inherited from
ToApplyOpsU
implicit
def ToArrowOps[F[_, _], A, B](v: F[A, B])(implicit F0: Arrow[F]): ArrowOps[F, A, B]
Inherited from
ToArrowOps0
implicit
def ToArrowOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Arrow[=>:], FA]): ArrowOps[M, A, B]
Inherited from
ToArrowOpsU
implicit
def ToArrowVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Arrow[[_, _] =>> F[G, _$13, _$14]]): ArrowOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToArrowOps0
implicit
def ToAssociativeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Associative[F]): AssociativeOps[F, A, B]
Inherited from
ToAssociativeOps0
implicit
def ToAssociativeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Associative[=>:], FA]): AssociativeOps[M, A, B]
Inherited from
ToAssociativeOpsU
implicit
def ToAssociativeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Associative[[_, _] =>> F[G, _$13, _$14]]): AssociativeOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToAssociativeOps0
implicit
def ToBandOps[F](v: F)(implicit F0: Band[F]): BandOps[F]
Inherited from
ToBandOps
implicit
def ToBifoldableOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifoldable[F]): BifoldableOps[F, A, B]
Inherited from
ToBifoldableOps0
implicit
def ToBifoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[F[_, _]] =>> Bifoldable[F], FA]): BifoldableOps[M, A, B]
Inherited from
ToBifoldableOpsU
implicit
def ToBifoldableVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifoldable[[_, _] =>> F[G, _$13, _$14]]): BifoldableOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToBifoldableOps0
implicit
def ToBifunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bifunctor[F]): BifunctorOps[F, A, B]
Inherited from
ToBifunctorOps0
implicit
def ToBifunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[F[_, _]] =>> Bifunctor[F], FA]): BifunctorOps[M, A, B]
Inherited from
ToBifunctorOpsU
implicit
def ToBifunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bifunctor[[_, _] =>> F[G, _$15, _$16]]): BifunctorOps[[_, _] =>> F[G, _$17, _$18], A, B]
Inherited from
ToBifunctorOps0
implicit
def ToBindOps[F[_], A](v: F[A])(implicit F0: Bind[F]): BindOps[F, A]
Inherited from
ToBindOps0
implicit
def ToBindOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Bind[F], FA]): BindOps[M, A]
Inherited from
ToBindOpsU
implicit
def ToBitraverseOps[F[_, _], A, B](v: F[A, B])(implicit F0: Bitraverse[F]): BitraverseOps[F, A, B]
Inherited from
ToBitraverseOps0
implicit
def ToBitraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[F[_, _]] =>> Bitraverse[F], FA]): BitraverseOps[M, A, B]
Inherited from
ToBitraverseOpsU
implicit
def ToBitraverseVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Bitraverse[[_, _] =>> F[G, _$15, _$16]]): BitraverseOps[[_, _] =>> F[G, _$17, _$18], A, B]
Inherited from
ToBitraverseOps0
implicit
Inherited from
ToBooleanOps
implicit
Inherited from
ToBooleanOps
implicit
def ToCategoryOps[F[_, _], A, B](v: F[A, B])(implicit F0: Category[F]): CategoryOps[F, A, B]
Inherited from
ToCategoryOps0
implicit
def ToCategoryOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Category[=>:], FA]): CategoryOps[M, A, B]
Inherited from
ToCategoryOpsU
implicit
def ToCategoryVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Category[[_, _] =>> F[G, _$13, _$14]]): CategoryOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToCategoryOps0
implicit
def ToChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: Choice[F]): ChoiceOps[F, A, B]
Inherited from
ToChoiceOps0
implicit
def ToChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Choice[=>:], FA]): ChoiceOps[M, A, B]
Inherited from
ToChoiceOpsU
implicit
def ToChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Choice[[_, _] =>> F[G, _$13, _$14]]): ChoiceOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToChoiceOps0
implicit
def ToComonadOps[F[_], A](v: F[A])(implicit F0: Comonad[F]): ComonadOps[F, A]
Inherited from
ToComonadOps0
implicit
def ToComonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Comonad[F], FA]): ComonadOps[M, A]
Inherited from
ToComonadOpsU
implicit
def ToComposeOps[F[_, _], A, B](v: F[A, B])(implicit F0: Compose[F]): ComposeOps[F, A, B]
Inherited from
ToComposeOps0
implicit
def ToComposeOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Compose[=>:], FA]): ComposeOps[M, A, B]
Inherited from
ToComposeOpsU
implicit
def ToComposeVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Compose[[_, _] =>> F[G, _$13, _$14]]): ComposeOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToComposeOps0
implicit
def ToConstOps[A](a: A): ConstOps[A]
Inherited from
ToConstOps
implicit
def ToContTOps[M[_], A](ma: M[A]): ContTOps[M, A]
Inherited from
ToContTOps
implicit
def ToContravariantOps[F[_], A](v: F[A])(implicit F0: Contravariant[F]): ContravariantOps[F, A]
Inherited from
ToContravariantOps0
implicit
def ToContravariantOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Contravariant[F], FA]): ContravariantOps[M, A]
Inherited from
ToContravariantOpsU
implicit
def ToCozipOps[F[_], A](v: F[A])(implicit F0: Cozip[F]): CozipOps[F, A]
Inherited from
ToCozipOps0
implicit
def ToCozipOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Cozip[F], FA]): CozipOps[M, A]
Inherited from
ToCozipOpsU
implicit
def ToEitherOps[A](a: A): EitherOps[A]
Inherited from
ToEitherOps
implicit
def ToEitherOpsFromEither[A, B](e: Either[A, B]): EitherOps[A, B]
Inherited from
ToEitherOps
implicit
def ToEitherTOps[A](a: A): EitherTOps[A]
Inherited from
ToEitherTOps
implicit
def ToEnumOps[F](v: F)(implicit F0: Enum[F]): EnumOps[F]
Inherited from
ToEnumOps
implicit
def ToEqualOps[F](v: F)(implicit F0: Equal[F]): EqualOps[F]
Inherited from
ToEqualOps
implicit
def ToFoldable1Ops[F[_], A](v: F[A])(implicit F0: Foldable1[F]): Foldable1Ops[F, A]
Inherited from
ToFoldable1Ops0
implicit
def ToFoldable1OpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Foldable1[F], FA]): Foldable1Ops[M, A]
Inherited from
ToFoldable1OpsU
implicit
def ToFoldableOps[F[_], A](v: F[A])(implicit F0: Foldable[F]): FoldableOps[F, A]
Inherited from
ToFoldableOps0
implicit
def ToFoldableOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Foldable[F], FA]): FoldableOps[M, A]
Inherited from
ToFoldableOpsU
implicit
def ToFunction1OpsFromBoolean[A, B](f: A => B): Function1Ops[A, B]
Inherited from
ToFunction1Ops
implicit
def ToFunction2Ops[T1, T2, R](f: (T1, T2) => R): Function2Ops[T1, T2, R]
Inherited from
ToFunction2Ops
implicit
def ToFunctorIdV[A](v: A): FunctorIdV[A]
Inherited from
ToFunctorOps0
implicit
def ToFunctorOps[F[_], A](v: F[A])(implicit F0: Functor[F]): FunctorOps[F, A]
Inherited from
ToFunctorOps0
implicit
def ToFunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Functor[F], FA]): FunctorOps[M, A]
Inherited from
ToFunctorOpsU
implicit
def ToIdOps[A](a: A): IdOps[A]
Inherited from
ToIdOps
implicit
def ToKleisliFAOps[F[_], A](fa: F[A]): KleisliFAOps[F, A]
Inherited from
ToKleisliOps
implicit
def ToKleisliIdOps[A](a: A): KleisliIdOps[A]
Inherited from
ToKleisliOps
implicit
def ToKleisliOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Monad[F], FA]): KleisliFAOps[M, A]
Inherited from
ToKleisliOps0
implicit
def ToLazyListOpsFromLazyList[A](a: LazyList[A]): LazyListOps[A]
Inherited from
ToLazyListOps
implicit
def ToLeftOpsFromLeft[A, B](e: Left[A, B]): LeftOps[A, B]
Inherited from
ToEitherOps
implicit
def ToLiftV[F[_], A, B](v: A => B): LiftV[F, A, B]
Inherited from
ToFunctorOps0
implicit
def ToListOpsFromList[A](a: List[A]): ListOps[A]
Inherited from
ToListOps
implicit
def ToMapOpsFromMap[K, V](m: Map[K, V]): MapOps[K, V]
Inherited from
ToMapOps
implicit
def ToMaybeOps[A](a: A): MaybeOps[A]
Inherited from
ToMaybeOps
implicit
Inherited from
ToMonadErrorOps0
implicit
def ToMonadErrorOps[F[_], S, A](v: F[A])(implicit F0: MonadError[F, S]): MonadErrorOps[F, S, A]
Inherited from
ToMonadErrorOps0
implicit
def ToMonadListenOps[F[_], A, W](v: F[A])(implicit F0: MonadListen[F, W]): MonadListenOps[F, W, A]
Inherited from
ToMonadListenOps0
implicit
def ToMonadOps[F[_], A](v: F[A])(implicit F0: Monad[F]): MonadOps[F, A]
Inherited from
ToMonadOps0
implicit
def ToMonadOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Monad[F], FA]): MonadOps[M, A]
Inherited from
ToMonadOpsU
implicit
def ToMonadPlusOps[F[_], A](v: F[A])(implicit F0: MonadPlus[F]): MonadPlusOps[F, A]
Inherited from
ToMonadPlusOps0
implicit
def ToMonadPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> MonadPlus[F], FA]): MonadPlusOps[M, A]
Inherited from
ToMonadPlusOpsU
implicit
def ToMonadTellOps[F[_], S, A](v: F[A])(implicit F0: MonadTell[F, S]): MonadTellOps[F, S, A]
Inherited from
ToMonadTellOps0
implicit
def ToMonoidOps[F](v: F)(implicit F0: Monoid[F]): MonoidOps[F]
Inherited from
ToMonoidOps
implicit
def ToNelOps[A](a: A): NelOps[A]
Inherited from
ToNelOps
implicit
def ToOptionIdOps[A](a: A): OptionIdOps[A]
Inherited from
ToOptionIdOps
implicit
def ToOptionOps2FromOption[A](a: Option[A]): OptionOps2[A]
Inherited from
ToOptionOps
implicit
def ToOptionOpsFromOption[A](a: Option[A]): OptionOps[A]
Inherited from
ToOptionOps
implicit
def ToOptionalOps[F[_], A](v: F[A])(implicit F0: Optional[F]): OptionalOps[F, A]
Inherited from
ToOptionalOps0
implicit
def ToOptionalOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Optional[F], FA]): OptionalOps[M, A]
Inherited from
ToOptionalOpsU
implicit
def ToOrderOps[F](v: F)(implicit F0: Order[F]): OrderOps[F]
Inherited from
ToOrderOps
implicit
def ToPlusEmptyOps[F[_], A](v: F[A])(implicit F0: PlusEmpty[F]): PlusEmptyOps[F, A]
Inherited from
ToPlusEmptyOps0
implicit
def ToPlusEmptyOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> PlusEmpty[F], FA]): PlusEmptyOps[M, A]
Inherited from
ToPlusEmptyOpsU
implicit
def ToPlusOps[F[_], A](v: F[A])(implicit F0: Plus[F]): PlusOps[F, A]
Inherited from
ToPlusOps0
implicit
def ToPlusOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Plus[F], FA]): PlusOps[M, A]
Inherited from
ToPlusOpsU
implicit
def ToProChoiceOps[F[_, _], A, B](v: F[A, B])(implicit F0: ProChoice[F]): ProChoiceOps[F, A, B]
Inherited from
ToProChoiceOps0
implicit
def ToProChoiceOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> ProChoice[=>:], FA]): ProChoiceOps[M, A, B]
Inherited from
ToProChoiceOpsU
implicit
def ToProChoiceVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: ProChoice[[_, _] =>> F[G, _$13, _$14]]): ProChoiceOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToProChoiceOps0
implicit
def ToProfunctorOps[F[_, _], A, B](v: F[A, B])(implicit F0: Profunctor[F]): ProfunctorOps[F, A, B]
Inherited from
ToProfunctorOps0
implicit
def ToProfunctorOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Profunctor[=>:], FA]): ProfunctorOps[M, A, B]
Inherited from
ToProfunctorOpsU
implicit
def ToProfunctorVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Profunctor[[_, _] =>> F[G, _$13, _$14]]): ProfunctorOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToProfunctorOps0
implicit
def ToReducerOps[A](a: A): ReducerOps[A]
Inherited from
ToReducerOps
implicit
def ToRightOpsFromRight[A, B](e: Right[A, B]): RightOps[A, B]
Inherited from
ToEitherOps
implicit
def ToSemigroupOps[F](v: F)(implicit F0: Semigroup[F]): SemigroupOps[F]
Inherited from
ToSemigroupOps
implicit
def ToShowOps[F](v: F)(implicit F0: Show[F]): ShowOps[F]
Inherited from
ToShowOps
implicit
def ToSplitOps[F[_, _], A, B](v: F[A, B])(implicit F0: Split[F]): SplitOps[F, A, B]
Inherited from
ToSplitOps0
implicit
def ToSplitOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Split[=>:], FA]): SplitOps[M, A, B]
Inherited from
ToSplitOpsU
implicit
def ToSplitVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Split[[_, _] =>> F[G, _$13, _$14]]): SplitOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToSplitOps0
implicit
def ToStateOps[A](a: A): StateOps[A]
Inherited from
ToStateOps
implicit
def ToStreamOpsFromStream[A](a: Stream[A]): StreamOps[A]
Inherited from
ToStreamOps
implicit
Inherited from
ToStrictTreeOps
implicit
Inherited from
ToStringOps
implicit
def ToStrongOps[F[_, _], A, B](v: F[A, B])(implicit F0: Strong[F]): StrongOps[F, A, B]
Inherited from
ToStrongOps0
implicit
def ToStrongOpsUnapply[FA](v: FA)(implicit F0: Unapply2[[=>:[_, _]] =>> Strong[=>:], FA]): StrongOps[M, A, B]
Inherited from
ToStrongOpsU
implicit
def ToStrongVFromKleisliLike[G[_], F[G[_], _, _], A, B](v: F[G, A, B])(implicit F0: Strong[[_, _] =>> F[G, _$13, _$14]]): StrongOps[[_, _] =>> F[G, _$15, _$16], A, B]
Inherited from
ToStrongOps0
implicit
def ToTheseOps[A](a: A): TheseOps[A]
Inherited from
ToTheseOps
implicit
def ToThesePairOps[A, B](a: (A, B)): ThesePairOps[A, B]
Inherited from
ToTheseOps
implicit
def ToTraverse1Ops[F[_], A](v: F[A])(implicit F0: Traverse1[F]): Traverse1Ops[F, A]
Inherited from
ToTraverse1Ops0
implicit
def ToTraverse1OpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Traverse1[F], FA]): Traverse1Ops[M, A]
Inherited from
ToTraverse1OpsU
implicit
def ToTraverseOps[F[_], A](v: F[A])(implicit F0: Traverse[F]): TraverseOps[F, A]
Inherited from
ToTraverseOps0
implicit
def ToTraverseOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Traverse[F], FA]): TraverseOps[M, A]
Inherited from
ToTraverseOpsU
implicit
def ToTreeOps[A](a: A): TreeOps[A]
Inherited from
ToTreeOps
implicit
def ToTryOpsFromTry[A](a: Try[A]): TryOps[A]
Inherited from
ToTryOps
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]
Inherited from
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]
Inherited from
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]
Inherited from
ToTupleOps
implicit
def ToTuple2Ops[A, B](t: (A, B)): Tuple2Ops[A, B]
Inherited from
ToTupleOps
implicit
def ToTuple3Ops[A, B, C](t: (A, B, C)): Tuple3Ops[A, B, C]
Inherited from
ToTupleOps
implicit
def ToTuple4Ops[A, B, C, D](t: (A, B, C, D)): Tuple4Ops[A, B, C, D]
Inherited from
ToTupleOps
implicit
def ToTuple5Ops[A, B, C, D, E](t: (A, B, C, D, E)): Tuple5Ops[A, B, C, D, E]
Inherited from
ToTupleOps
implicit
def ToTuple6Ops[A, B, C, D, E, F](t: (A, B, C, D, E, F)): Tuple6Ops[A, B, C, D, E, F]
Inherited from
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]
Inherited from
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]
Inherited from
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]
Inherited from
ToTupleOps
implicit
def ToUnzipOps[F[_], A](v: F[A])(implicit F0: Unzip[F]): UnzipOps[F, A]
Inherited from
ToUnzipOps0
implicit
def ToUnzipOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Unzip[F], FA]): UnzipOps[M, A]
Inherited from
ToUnzipOpsU
implicit
def ToUnzipPairOps[F[_], A, B](v: F[(A, B)])(implicit F0: Unzip[F]): UnzipPairOps[F, A, B]
Inherited from
ToUnzipOps0
implicit
Inherited from
ToValidationOps
implicit
def ToVectorOpsFromVector[A](a: Vector[A]): VectorOps[A]
Inherited from
ToVectorOps
implicit
def ToWriterOps[A](a: A): WriterOps[A]
Inherited from
ToWriterOps
implicit
def ToZipOps[F[_], A](v: F[A])(implicit F0: Zip[F]): ZipOps[F, A]
Inherited from
ToZipOps0
implicit
def ToZipOpsUnapply[FA](v: FA)(implicit F0: Unapply[[F[_]] =>> Zip[F], FA]): ZipOps[M, A]
Inherited from
ToZipOpsU
implicit
val bigDecimalInstance: Monoid[BigDecimal] & Enum[BigDecimal] & Show[BigDecimal]
Inherited from
BigDecimalInstances
implicit
val bigIntInstance: Monoid[BigInt] & Enum[BigInt] & Show[BigInt]
Inherited from
BigInts
Inherited from
BigInts
implicit
val bigIntegerInstance: Monoid[BigInteger] & Enum[BigInteger] & Show[BigInteger]
Inherited from
BigIntegerInstances
implicit
Inherited from
BigIntegerInstances
Inherited from
AnyValInstances
Inherited from
AnyValInstances
implicit
val byteInstance: Monoid[Byte] & Enum[Byte] & Show[Byte]
Inherited from
AnyValInstances
implicit
val callableMonad: Monad[[V <: <FromJavaObject>] =>> Callable[V]]
Inherited from
CallableInstances
implicit
def callableOrder[A : Order]: Order[Callable[A]]
Inherited from
CallableInstances
implicit
val char: Monoid[Char] & Enum[Char] & Show[Char]
Inherited from
AnyValInstances
final implicit
def cordInterpolator(sc: StringContext): CordInterpolator
Inherited from
ToShowOps
implicit
val dayOfWeekInstance: Enum[DayOfWeek]
Inherited from
TimeInstances
implicit
val doubleInstance: Order[Double] & Show[Double]
Inherited from
AnyValInstances
implicit
val durationInstance: Monoid[Duration] & Order[Duration]
Inherited from
TimeInstances
implicit
Inherited from
EitherInstances
implicit
def eitherEqual[A, B](implicit A0: Equal[A], B0: Equal[B]): Equal[Either[A, B]]
Inherited from
EitherInstances0
implicit
Inherited from
EitherInstances
implicit
def eitherMonad[L]: Traverse[[_] =>> Either[L, _$2]] & MonadError[[_] =>> Either[L, _$3], L] & BindRec[[_] =>> Either[L, _$4]] & Cozip[[_] =>> Either[L, _$5]] & Optional[[_] =>> Either[L, _$6]]

Right biased monad

Right biased monad

Inherited from
EitherInstances
implicit
def eitherOrder[A, B](implicit OrderA: Order[A], OrderB: Order[B]): Order[Either[A, B]]
Inherited from
EitherInstances
implicit
def eitherShow[A, B](implicit SA: Show[A], SB: Show[B]): Show[Either[A, B]]
Inherited from
EitherInstances
implicit
def enumInstance[E <: Enum[LazyRef(...)] : ClassTag]: Enum[E]
Inherited from
EnumInstances
implicit
val floatInstance: Order[Float] & Show[Float]
Inherited from
AnyValInstances
implicit
def function0Equal[R : Equal]: Equal[() => R]
Inherited from
FunctionInstances
implicit
val function0Instance: Traverse[Function0] & Monad[Function0] & BindRec[Function0] & Comonad[Function0] & Distributive[Function0]
Inherited from
FunctionInstances
implicit
def function1Cobind[A, R](implicit A0: Semigroup[A]): Cobind[[_] =>> A => _$1]
Inherited from
FunctionInstances1
implicit
def function1Comonad[A, R](implicit A0: Monoid[A]): Comonad[[_] =>> A => _$2]
Inherited from
FunctionInstances0
implicit
Inherited from
FunctionInstances
implicit
def function1Covariant[T]: Monad[[_] =>> T => _$21] & BindRec[[_] =>> T => _$22] & Zip[[_] =>> T => _$23] & Unzip[[_] =>> T => _$24] & Distributive[[_] =>> T => _$25]
Inherited from
FunctionInstances
implicit
def function1CovariantByName[T]: Monad[[_] =>> (=> T) => _$3] & BindRec[[_] =>> (=> T) => _$4] & Zip[[_] =>> (=> T) => _$5] & Unzip[[_] =>> (=> T) => _$6] & Distributive[[_] =>> (=> T) => _$7]
Inherited from
FunctionInstances0
implicit
val function1Instance: Arrow[Function1] & Choice[Function1] & ProChoice[Function1]
Inherited from
FunctionInstances
implicit
def function1Monoid[A, R](implicit R0: Monoid[R]): Monoid[A => R]
Inherited from
FunctionInstances0
implicit
def function1Semigroup[A, R](implicit R0: Semigroup[R]): Semigroup[A => R]
Inherited from
FunctionInstances1
implicit
def function2Instance[T1, T2]: Monad[[_] =>> (T1, T2) => _$37] & BindRec[[_] =>> (T1, T2) => _$38]
Inherited from
FunctionInstances
implicit
def function3Instance[T1, T2, T3]: Monad[[_] =>> (T1, T2, T3) => _$43] & BindRec[[_] =>> (T1, T2, T3) => _$44]
Inherited from
FunctionInstances
implicit
def function4Instance[T1, T2, T3, T4]: Monad[[_] =>> (T1, T2, T3, T4) => _$50] & BindRec[[_] =>> (T1, T2, T3, T4) => _$51]
Inherited from
FunctionInstances
implicit
def function5Instance[T1, T2, T3, T4, T5]: Monad[[_] =>> (T1, T2, T3, T4, T5) => _$58] & BindRec[[_] =>> (T1, T2, T3, T4, T5) => _$59]
Inherited from
FunctionInstances
implicit
def function6Instance[T1, T2, T3, T4, T5, T6]: Monad[[_] =>> (T1, T2, T3, T4, T5, T6) => _$67] & BindRec[[_] =>> (T1, T2, T3, T4, T5, T6) => _$68]
Inherited from
FunctionInstances
implicit
def function7Instance[T1, T2, T3, T4, T5, T6, T7]: Monad[[_] =>> (T1, T2, T3, T4, T5, T6, T7) => _$77] & BindRec[[_] =>> (T1, T2, T3, T4, T5, T6, T7) => _$78]
Inherited from
FunctionInstances
implicit
def function8Instance[T1, T2, T3, T4, T5, T6, T7, T8]: Monad[[_] =>> (T1, T2, T3, T4, T5, T6, T7, T8) => _$88] & BindRec[[_] =>> (T1, T2, T3, T4, T5, T6, T7, T8) => _$89]
Inherited from
FunctionInstances
implicit
def futureInstance(implicit ec: ExecutionContext): Nondeterminism[Future] & Cobind[Future] & MonadError[Future, Throwable]
Inherited from
FutureInstances1
implicit
def futureMonoid[A](implicit g: Monoid[A], ec: ExecutionContext): Monoid[Future[A]]
Inherited from
FutureInstances
implicit
def futureSemigroup[A](implicit m: Semigroup[A], ec: ExecutionContext): Semigroup[Future[A]]
Inherited from
FutureInstances1
implicit
val instantInstance: Order[Instant]
Inherited from
TimeInstances
implicit
val intInstance: Monoid[Int] & Enum[Int] & Show[Int]
Inherited from
AnyValInstances
implicit
val javaBigDecimalInstance: Show[BigDecimal] & Equal[BigDecimal]
Inherited from
BigDecimalInstances
implicit
def lazylistEqual[A](implicit A0: Equal[A]): Equal[LazyList[A]]
Inherited from
LazyListInstances
implicit
val lazylistInstance: Traverse[LazyList] & MonadPlus[LazyList] & Alt[LazyList] & BindRec[LazyList] & Zip[LazyList] & Unzip[LazyList] & Align[LazyList] & IsEmpty[LazyList] & Cobind[LazyList]
Inherited from
LazyListInstances
implicit
def lazylistMonoid[A]: Monoid[LazyList[A]]
Inherited from
LazyListInstances
implicit
def lazylistOrder[A](implicit A0: Order[A]): Order[LazyList[A]]
Inherited from
LazyListInstances
implicit
def lazylistShow[A](implicit A0: Show[A]): Show[LazyList[A]]
Inherited from
LazyListInstances
implicit
val lazylistZipApplicative: Applicative[[α] =>> LazyList[α] @@ Zip]

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

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

Example:

import scalaz.Tags.Zip
lazylistZipApplicative.apply2(Zip(LazyList(1, 2)), Zip(LazyList(3, 4)))(_ * _) // LazyList(3, 8)
Inherited from
LazyListInstances
implicit
def listEqual[A](implicit A0: Equal[A]): Equal[List[A]]
Inherited from
ListInstances0
implicit
val listInstance: Traverse[List] & MonadPlus[List] & Alt[List] & BindRec[List] & Zip[List] & Unzip[List] & Align[List] & IsEmpty[List] & Cobind[List]
Inherited from
ListInstances
implicit
def listMonoid[A]: Monoid[List[A]]
Inherited from
ListInstances
implicit
def listOrder[A](implicit A0: Order[A]): Order[List[A]]
Inherited from
ListInstances
implicit
def listShow[A](implicit A: Show[A]): Show[List[A]]
Inherited from
ListInstances
implicit
val localDateInstance: Enum[LocalDate]
Inherited from
TimeInstances
implicit
val localDateTimeInstance: Order[LocalDateTime]
Inherited from
TimeInstances
implicit
val localTimeInstance: Order[LocalTime]
Inherited from
TimeInstances
implicit
val longInstance: Monoid[Long] & Enum[Long] & Show[Long]
Inherited from
AnyValInstances
implicit
def mapBand[K, V](implicit S: Band[V]): Band[Map[K, V]]
Inherited from
MapInstances0
implicit
val mapEntryBitraverse: Bitraverse[[K <: <FromJavaObject>, V <: <FromJavaObject>] =>> Entry[K, V]]
Inherited from
MapInstances
implicit
def mapEqual[K : Order, V : Equal]: Equal[Map[K, V]]
Inherited from
MapInstances0
implicit
def mapFoldable[K]: Foldable[[_] =>> Map[K, _$7]]
Inherited from
MapInstances0
implicit
def mapInstance[K]: Traverse[[_] =>> Map[K, _$8]] & IsEmpty[[_] =>> Map[K, _$9]] & Bind[[_] =>> Map[K, _$10]] & Align[[_] =>> Map[K, _$11]]

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.

Inherited from
MapInstances
implicit
def mapMonoid[K, V](implicit S: Semigroup[V]): Monoid[Map[K, V]]

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

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

Inherited from
MapInstances
implicit
def mapOrder[K : Order, V : Order]: Order[Map[K, V]]
Inherited from
MapInstances
implicit
def mapShow[K, V](implicit K: Show[K], V: Show[V]): Show[Map[K, V]]
Inherited from
MapInstances
implicit
val monthDayInstance: Order[MonthDay]
Inherited from
TimeInstances
implicit
val monthInstance: Enum[Month]
Inherited from
TimeInstances
implicit
val offsetDateTimeInstance: Order[OffsetDateTime]
Inherited from
TimeInstances
implicit
val offsetTimeInstance: Order[OffsetTime]
Inherited from
TimeInstances
implicit
def optionBand[A : Band]: Band[Option[A]]
Inherited from
OptionInstances1
implicit
def optionEqual[A](implicit A0: Equal[A]): Equal[Option[A]]
Inherited from
OptionInstances0
implicit
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
val optionInstance: Traverse[Option] & MonadPlus[Option] & Alt[Option] & BindRec[Option] & Cozip[Option] & Zip[Option] & Unzip[Option] & Align[Option] & IsEmpty[Option] & Cobind[Option] & Optional[Option]
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
def optionMax[A](implicit o: Order[A]): Monoid[MaxOption[A]] & Band[MaxOption[A]]
Inherited from
OptionInstances
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
def optionMin[A](implicit o: Order[A]): Monoid[MinOption[A]] & Band[MinOption[A]]
Inherited from
OptionInstances
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
Inherited from
OptionInstances
implicit
def optionMonoid[A : Semigroup]: Monoid[Option[A]]
Inherited from
OptionInstances
implicit
def optionOrder[A](implicit A0: Order[A]): Order[Option[A]]

Add None as an element less than all As.

Add None as an element less than all As.

Inherited from
OptionInstances
implicit
Inherited from
OptionInstances0
implicit
def optionShow[A : Show]: Show[Option[A]]
Inherited from
OptionInstances
implicit
val partialFunctionInstance: Arrow[PartialFunction] & Category[PartialFunction] & Choice[PartialFunction]
implicit
val periodInstance: Monoid[Period] & Equal[Period]
Inherited from
TimeInstances
implicit
val setInstance: Foldable[Set] & IsEmpty[Set]
Inherited from
SetInstances
implicit
def setMonoid[A]: Monoid[Set[A]] & SemiLattice[Set[A]]
Inherited from
SetInstances
implicit
def setOrder[A : Order]: Order[Set[A]]

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

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

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

Inherited from
SetInstances
implicit
def setShow[A](implicit A: Show[A]): Show[Set[A]]
Inherited from
SetInstances
implicit
val shortInstance: Monoid[Short] & Enum[Short] & Show[Short]
Inherited from
AnyValInstances
final implicit
def showInterpolator(sc: StringContext): ShowInterpolator
Inherited from
ToShowOps
implicit
def sortedMapBand[K, V](implicit S: Band[V], K: Ordering[K]): Band[SortedMap[K, V]]
Inherited from
SortedMapInstances0
implicit
def sortedMapEqual[K : Order, V : Equal]: Equal[SortedMap[K, V]]
Inherited from
SortedMapInstances0
implicit
def sortedMapFoldable[K]: Foldable[[_] =>> SortedMap[K, _$7]]
Inherited from
SortedMapInstances0
implicit
def sortedMapInstance[K : Ordering]: Traverse[[_] =>> SortedMap[K, _$8]] & IsEmpty[[_] =>> SortedMap[K, _$9]] & Bind[[_] =>> SortedMap[K, _$10]] & Align[[_] =>> SortedMap[K, _$11]]

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.

Inherited from
SortedMapInstances
implicit
def sortedMapMonoid[K, V](implicit S: Semigroup[V], K: Ordering[K]): Monoid[SortedMap[K, V]]

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

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

Inherited from
SortedMapInstances
implicit
def sortedMapOrder[K : Order, V : Order]: Order[SortedMap[K, V]]
Inherited from
SortedMapInstances
implicit
def sortedMapShow[K, V](implicit K: Show[K], V: Show[V]): Show[SortedMap[K, V]]
Inherited from
SortedMapInstances
implicit
def streamEqual[A](implicit A0: Equal[A]): Equal[Stream[A]]
Inherited from
StreamInstances
implicit
val streamInstance: Traverse[Stream] & MonadPlus[Stream] & Alt[Stream] & BindRec[Stream] & Zip[Stream] & Unzip[Stream] & Align[Stream] & IsEmpty[Stream] & Cobind[Stream]
Inherited from
StreamInstances
implicit
def streamMonoid[A]: Monoid[Stream[A]]
Inherited from
StreamInstances
implicit
def streamOrder[A](implicit A0: Order[A]): Order[Stream[A]]
Inherited from
StreamInstances
implicit
def streamShow[A](implicit A0: Show[A]): Show[Stream[A]]
Inherited from
StreamInstances
implicit
val streamZipApplicative: Applicative[[α] =>> Stream[α] @@ 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)
Inherited from
StreamInstances
implicit
val stringInstance: Monoid[String] & Show[String] & Order[String] & IsEmpty[[α] =>> String]
Inherited from
StringInstances
implicit
def tuple1Band[A1](implicit A1: Band[A1]): Band[(A1)]
Inherited from
TupleInstances2
implicit
val tuple1Cozip: Cozip[Tuple1]
Inherited from
TupleInstances3
implicit
def tuple1Equal[A1](implicit A1: Equal[A1]): Equal[(A1)]
Inherited from
TupleInstances2
implicit
val tuple1Instance: Traverse[Tuple1] & Monad[Tuple1] & Comonad[Tuple1]

Tuple1[A] is isomorphic to Id[X]

Tuple1[A] is isomorphic to Id[X]

Inherited from
TupleInstances2
implicit
def tuple1Monoid[A1](implicit A1: Monoid[A1]): Monoid[(A1)]
Inherited from
TupleInstances1
implicit
def tuple1Order[A1](implicit A1: Order[A1]): Order[(A1)]
Inherited from
TupleInstances3
implicit
def tuple1SemiLattice[A1](implicit A1: SemiLattice[A1]): SemiLattice[(A1)]
Inherited from
TupleInstances3
implicit
def tuple1Semigroup[A1](implicit A1: Semigroup[A1]): Semigroup[(A1)]
Inherited from
TupleInstances0
implicit
def tuple1Show[A1](implicit A1: Show[A1]): Show[(A1)]
Inherited from
TupleInstances3
implicit
Inherited from
TupleInstances2
implicit
def tuple2Band[A1, A2](implicit A1: Band[A1], A2: Band[A2]): Band[(A1, A2)]
Inherited from
TupleInstances2
implicit
def tuple2BindRec[A1 : Semigroup]: BindRec[[_] =>> (A1, _$11)]

Product BindRec

Product BindRec

Inherited from
TupleInstances2
implicit
Inherited from
TupleInstances2
implicit
def tuple2Cozip[A1]: Cozip[[_] =>> (A1, _$18)]
Inherited from
TupleInstances3
implicit
def tuple2Equal[A1, A2](implicit A1: Equal[A1], A2: Equal[A2]): Equal[(A1, A2)]
Inherited from
TupleInstances2
implicit
def tuple2Instance[A1]: Traverse[[_] =>> (A1, _$1)] & Comonad[[_] =>> (A1, _$2)]

Product functor and comonad

Product functor and comonad

Inherited from
TupleInstances1
implicit
def tuple2Monad[A1](implicit A1: Monoid[A1]): Monad[[_] =>> (A1, _$25)]
Inherited from
TupleInstances3
implicit
def tuple2Monoid[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monoid[(A1, A2)]
Inherited from
TupleInstances1
implicit
def tuple2Order[A1, A2](implicit A1: Order[A1], A2: Order[A2]): Order[(A1, A2)]
Inherited from
TupleInstances3
implicit
def tuple2SemiLattice[A1, A2](implicit A1: SemiLattice[A1], A2: SemiLattice[A2]): SemiLattice[(A1, A2)]
Inherited from
TupleInstances3
implicit
def tuple2Semigroup[A1, A2](implicit A1: Semigroup[A1], A2: Semigroup[A2]): Semigroup[(A1, A2)]
Inherited from
TupleInstances0
implicit
def tuple2Show[A1, A2](implicit A1: Show[A1], A2: Show[A2]): Show[(A1, A2)]
Inherited from
TupleInstances3
implicit
def tuple3Band[A1, A2, A3](implicit A1: Band[A1], A2: Band[A2], A3: Band[A3]): Band[(A1, A2, A3)]
Inherited from
TupleInstances2
implicit
def tuple3BindRec[A1 : Semigroup, A2 : Semigroup]: BindRec[[_] =>> (A1, A2, _$12)]
Inherited from
TupleInstances2
implicit
def tuple3Cozip[A1, A2]: Cozip[[_] =>> (A1, A2, _$19)]
Inherited from
TupleInstances3
implicit
def tuple3Equal[A1, A2, A3](implicit A1: Equal[A1], A2: Equal[A2], A3: Equal[A3]): Equal[(A1, A2, A3)]
Inherited from
TupleInstances2
implicit
def tuple3Functor[A1, A2]: Traverse[[_] =>> (A1, A2, _$4)]
Inherited from
TupleInstances1
implicit
def tuple3Monad[A1, A2](implicit A1: Monoid[A1], A2: Monoid[A2]): Monad[[_] =>> (A1, A2, _$26)]
Inherited from
TupleInstances3
implicit
def tuple3Monoid[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monoid[(A1, A2, A3)]
Inherited from
TupleInstances1
implicit
def tuple3Order[A1, A2, A3](implicit A1: Order[A1], A2: Order[A2], A3: Order[A3]): Order[(A1, A2, A3)]
Inherited from
TupleInstances3
implicit
def tuple3SemiLattice[A1, A2, A3](implicit A1: SemiLattice[A1], A2: SemiLattice[A2], A3: SemiLattice[A3]): SemiLattice[(A1, A2, A3)]
Inherited from
TupleInstances3
implicit
def tuple3Semigroup[A1, A2, A3](implicit A1: Semigroup[A1], A2: Semigroup[A2], A3: Semigroup[A3]): Semigroup[(A1, A2, A3)]
Inherited from
TupleInstances0
implicit
def tuple3Show[A1, A2, A3](implicit A1: Show[A1], A2: Show[A2], A3: Show[A3]): Show[(A1, A2, A3)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple4BindRec[A1 : Semigroup, A2 : Semigroup, A3 : Semigroup]: BindRec[[_] =>> (A1, A2, A3, _$13)]
Inherited from
TupleInstances2
implicit
def tuple4Cozip[A1, A2, A3]: Cozip[[_] =>> (A1, A2, A3, _$20)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple4Functor[A1, A2, A3]: Traverse[[_] =>> (A1, A2, A3, _$5)]
Inherited from
TupleInstances1
implicit
def tuple4Monad[A1, A2, A3](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3]): Monad[[_] =>> (A1, A2, A3, _$27)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances1
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)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances0
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)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple5BindRec[A1 : Semigroup, A2 : Semigroup, A3 : Semigroup, A4 : Semigroup]: BindRec[[_] =>> (A1, A2, A3, A4, _$14)]
Inherited from
TupleInstances2
implicit
def tuple5Cozip[A1, A2, A3, A4]: Cozip[[_] =>> (A1, A2, A3, A4, _$21)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple5Functor[A1, A2, A3, A4]: Traverse[[_] =>> (A1, A2, A3, A4, _$6)]
Inherited from
TupleInstances1
implicit
def tuple5Monad[A1, A2, A3, A4](implicit A1: Monoid[A1], A2: Monoid[A2], A3: Monoid[A3], A4: Monoid[A4]): Monad[[_] =>> (A1, A2, A3, A4, _$28)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Order[(A1, A2, A3, A4, A5)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Show[(A1, A2, A3, A4, A5)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple6BindRec[A1 : Semigroup, A2 : Semigroup, A3 : Semigroup, A4 : Semigroup, A5 : Semigroup]: BindRec[[_] =>> (A1, A2, A3, A4, A5, _$15)]
Inherited from
TupleInstances2
implicit
def tuple6Cozip[A1, A2, A3, A4, A5]: Cozip[[_] =>> (A1, A2, A3, A4, A5, _$22)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple6Functor[A1, A2, A3, A4, A5]: Traverse[[_] =>> (A1, A2, A3, A4, A5, _$7)]
Inherited from
TupleInstances1
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[[_] =>> (A1, A2, A3, A4, A5, _$29)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Order[(A1, A2, A3, A4, A5, A6)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Show[(A1, A2, A3, A4, A5, A6)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple7BindRec[A1 : Semigroup, A2 : Semigroup, A3 : Semigroup, A4 : Semigroup, A5 : Semigroup, A6 : Semigroup]: BindRec[[_] =>> (A1, A2, A3, A4, A5, A6, _$16)]
Inherited from
TupleInstances2
implicit
def tuple7Cozip[A1, A2, A3, A4, A5, A6]: Cozip[[_] =>> (A1, A2, A3, A4, A5, A6, _$23)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple7Functor[A1, A2, A3, A4, A5, A6]: Traverse[[_] =>> (A1, A2, A3, A4, A5, A6, _$8)]
Inherited from
TupleInstances1
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[[_] =>> (A1, A2, A3, A4, A5, A6, _$30)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Order[(A1, A2, A3, A4, A5, A6, A7)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Show[(A1, A2, A3, A4, A5, A6, A7)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple8BindRec[A1 : Semigroup, A2 : Semigroup, A3 : Semigroup, A4 : Semigroup, A5 : Semigroup, A6 : Semigroup, A7 : Semigroup]: BindRec[[_] =>> (A1, A2, A3, A4, A5, A6, A7, _$17)]
Inherited from
TupleInstances2
implicit
def tuple8Cozip[A1, A2, A3, A4, A5, A6, A7]: Cozip[[_] =>> (A1, A2, A3, A4, A5, A6, A7, _$24)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances2
implicit
def tuple8Functor[A1, A2, A3, A4, A5, A6, A7]: Traverse[[_] =>> (A1, A2, A3, A4, A5, A6, A7, _$9)]
Inherited from
TupleInstances1
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[[_] =>> (A1, A2, A3, A4, A5, A6, A7, _$31)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Order[(A1, A2, A3, A4, A5, A6, A7, A8)]
Inherited from
TupleInstances3
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)]
Inherited from
TupleInstances3
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)]
Inherited from
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]): Show[(A1, A2, A3, A4, A5, A6, A7, A8)]
Inherited from
TupleInstances3
implicit
val unitInstance: Monoid[Unit] & Enum[Unit] & Show[Unit] & SemiLattice[Unit]
Inherited from
AnyValInstances
implicit
def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]
Inherited from
VectorInstances0
implicit
val vectorInstance: Traverse[Vector] & MonadPlus[Vector] & Alt[Vector] & BindRec[Vector] & Zip[Vector] & Unzip[Vector] & IsEmpty[Vector] & Align[Vector]
Inherited from
VectorInstances
implicit
def vectorMonoid[A]: Monoid[Vector[A]]
Inherited from
VectorInstances
implicit
def vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]
Inherited from
VectorInstances
implicit
def vectorShow[A : Show]: Show[Vector[A]]
Inherited from
VectorInstances
implicit
val yearInstance: Enum[Year]
Inherited from
TimeInstances
implicit
val yearMonthInstance: Enum[YearMonth]
Inherited from
TimeInstances
implicit
val zoneOffsetInstance: Order[ZoneOffset]
Inherited from
TimeInstances
implicit
val zonedDateTime: Order[ZonedDateTime]
Inherited from
TimeInstances