AllFunctions

Companion trait AllFunctions

object AllFunctions extends AllFunctions

Source: AllFunctions.scala

Linear Supertypes

AllFunctions, FunctionFunctions, StringFunctions, OrderingFunctions, BooleanFunctions, LazyListFunctions, OptionFunctions, ListFunctions, AnyRef, Any

Ordering

Alphabetic
By Inheritance

Inherited

AllFunctions
AllFunctions
FunctionFunctions
StringFunctions
OrderingFunctions
BooleanFunctions
LazyListFunctions
OptionFunctions
ListFunctions
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) => B)(implicit arg0: Monoid[B]): B
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Definition Classes
ListFunctions
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
Definition Classes
OrderingFunctions
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 and as, excluding same-element pairs.
Combinations of as and as, excluding same-element pairs.
Definition Classes
ListFunctions
final def asInstanceOf[T0]: T0
Definition Classes
Any
final def breakM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
spanM with p's complement.
spanM with p's complement.
Definition Classes
ListFunctions
final def cata[A, X](oa: Option[A])(some: (A) => X, none: => X): X
Catamorphism over the option.
Catamorphism over the option. Returns the provided function some applied to item contained in the Option if it is defined, otherwise, the provided value none.
Definition Classes
OptionFunctions
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): 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.
Definition Classes
StringFunctions
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def conditional(p: Boolean, q: => Boolean): Boolean
Conditional.
Conditional.
```
p q  p --> q
0 0  1
0 1  1
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def conjunction(p: Boolean, q: => Boolean): Boolean
Conjunction.
Conjunction. (AND)
```
p q  p ∧ q
0 0  0
0 1  0
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def disjunction(p: Boolean, q: => Boolean): Boolean
Disjunction.
Disjunction. (OR)
```
p q  p ∨ q
0 0  0
0 1  1
1 0  1
1 1  1
```
Definition Classes
BooleanFunctions
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.
Definition Classes
BooleanFunctions
final def emptyOrPointNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
emptyOrPoint curried into a natural transformation.
emptyOrPoint curried into a natural transformation.
Definition Classes
BooleanFunctions
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): 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[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[Maybe[A]]
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Definition Classes
ListFunctions
final def fix[A](f: (=> A) => A): A
f(f(f(... for referentially transparent f.
f(f(f(... for referentially transparent f.
Definition Classes
FunctionFunctions
Since
7.0.1
final def fold[A](cond: Boolean, t: => A, f: => A): A
returns
t if cond is true, f otherwise
Definition Classes
BooleanFunctions
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
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
final def getOrElseF[A, F[_]](oa: Option[A])(fa: => F[A])(implicit arg0: Applicative[F]): 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.
Definition Classes
OptionFunctions
final def groupBy1[A, B](as: List[A])(f: (A) => B): Map[B, NonEmptyList[A]]
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
Definition Classes
ListFunctions
final def groupWhen[A](as: List[A])(p: (A, A) => Boolean): List[NonEmptyList[A]]
groupWhenM specialized to scalaz.Id.Id.
groupWhenM specialized to scalaz.Id.Id.
Definition Classes
ListFunctions
final def groupWhenM[A, M[_]](as: List[A])(p: (A, A) => M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]
Split at each point where p(as(n), as(n+1)) yields false.
Split at each point where p(as(n), as(n+1)) yields false.
Definition Classes
ListFunctions
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
final def heads[A](as: LazyList[A]): LazyList[LazyList[A]]
[as take 1, as take 2, ..., as]
[as take 1, as take 2, ..., as]
Definition Classes
LazyListFunctions
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
final def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
Definition Classes
LazyListFunctions
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
Definition Classes
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
Definition Classes
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
```
Definition Classes
BooleanFunctions
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
Definition Classes
ListFunctions
final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
Definition Classes
ListFunctions
final def nand(p: Boolean, q: => Boolean): Boolean
Negation of Conjunction.
Negation of Conjunction. (NAND)
```
p q  p !&& q
0 0  1
0 1  1
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def negConditional(p: Boolean, q: => Boolean): Boolean
Negational of Conditional.
Negational of Conditional.
```
p q  p ⇏ q
0 0  0
0 1  0
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def negInverseConditional(p: Boolean, q: => Boolean): Boolean
Negation of Inverse Conditional.
Negation of Inverse Conditional.
```
p q  p <\- q
0 0  0
0 1  1
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def nil[A]: List[A]
scala.Nil with a sometimes more convenient type
scala.Nil with a sometimes more convenient type
Definition Classes
ListFunctions
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 nor(p: Boolean, q: => Boolean): Boolean
Negation of Disjunction.
Negation of Disjunction. (NOR)
```
p q  p !|| q
0 0  1
0 1  0
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def option[A](cond: Boolean, a: => A): Option[A]
Returns the given argument in Some if cond is true, None otherwise.
Returns the given argument in Some if cond is true, None otherwise.
Definition Classes
BooleanFunctions
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 parseBigDecimal(s: String): Validation[String, BigDecimal]
Definition Classes
StringFunctions
def parseBigInt(s: String): Validation[String, BigInteger]
Definition Classes
StringFunctions
def parseBoolean(s: String): Validation[String, Boolean]
Definition Classes
StringFunctions
def parseByte(s: String): Validation[String, Byte]
Definition Classes
StringFunctions
def parseDouble(s: String): Validation[String, Double]
Definition Classes
StringFunctions
def parseFloat(s: String): Validation[String, Float]
Definition Classes
StringFunctions
def parseInt(s: String): Validation[String, Int]
Definition Classes
StringFunctions
def parseLong(s: String): Validation[String, Long]
Definition Classes
StringFunctions
def parseShort(s: String): Validation[String, Short]
Definition Classes
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.
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 pointOrEmpty[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Definition Classes
BooleanFunctions
final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
pointOrEmpty curried into a natural transformation.
pointOrEmpty curried into a natural transformation.
Definition Classes
BooleanFunctions
final def powerset[A](as: List[A]): List[List[A]]
Definition Classes
ListFunctions
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 against p, and the remainder.
A pair of the longest prefix of passing as against p, and the remainder.
Definition Classes
ListFunctions
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
final def tailOption[A](as: List[A]): Option[List[A]]
Definition Classes
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)]
Definition Classes
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]
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 collect as while p yields false.
Run p(a)s and collect as while p yields false. Don't run any ps after the first true.
Definition Classes
ListFunctions
final def takeWhileM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[List[A]]
Run p(a)s and collect as while p yields true.
Run p(a)s and collect as while p yields true. Don't run any ps after the first false.
Definition Classes
ListFunctions
def test(p: Boolean): Int
Returns 1 if p is true, or 0 otherwise.
Returns 1 if p is true, or 0 otherwise.
Definition Classes
BooleanFunctions
final def toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
Definition Classes
OptionFunctions
final def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
Definition Classes
OptionFunctions
final def toLeft[A, B](oa: Option[A])(b: => B): \/[A, B]
Definition Classes
OptionFunctions
final def toMaybe[A](oa: Option[A]): Maybe[A]
Definition Classes
OptionFunctions
final def toNel[A](as: List[A]): Maybe[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 toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
Definition Classes
OptionFunctions
final def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions
final def toZipper[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions
def unfold[A, B](seed: A)(f: (A) => Option[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def unfoldForest[A, B](as: LazyList[A])(f: (A) => (B, () => LazyList[A])): LazyList[Tree[B]]
Definition Classes
LazyListFunctions
final def unfoldForestM[A, B, M[_]](as: LazyList[A])(f: (A) => M[(B, LazyList[A])])(implicit arg0: Monad[M]): M[LazyList[Tree[B]]]
Definition Classes
LazyListFunctions
def unfoldm[A, B](seed: A)(f: (A) => Maybe[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def unless(cond: Boolean)(f: => Unit): Unit
Executes the given side-effect if cond is false
Executes the given side-effect if cond is false
Definition Classes
BooleanFunctions
final def unlessM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]
Returns the given argument if cond is false, otherwise, unit lifted into M.
Returns the given argument if cond is false, otherwise, unit lifted into M.
Definition Classes
BooleanFunctions
final def unlessMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of unlessM that infers the type constructor M.
A version of unlessM that infers the type constructor M.
Definition Classes
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.
Definition Classes
BooleanFunctions
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def when(cond: Boolean)(f: => Unit): Unit
Executes the given side-effect if cond is true
Executes the given side-effect if cond is true
Definition Classes
BooleanFunctions
final def whenM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]
Returns the given argument if cond is true, otherwise, unit lifted into M.
Returns the given argument if cond is true, otherwise, unit lifted into M.
Definition Classes
BooleanFunctions
final def whenMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of whenM that infers the type constructor M.
A version of whenM that infers the type constructor M.
Definition Classes
BooleanFunctions
final def zapp[A, B, C](a: LazyList[A])(f: LazyList[(A) => (B) => C]): LazyList[(B) => C]
Definition Classes
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.
Definition Classes
BooleanFunctions
final def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions
final def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions

Inherited from FunctionFunctions

Value Members

final def fix[A](f: (=> A) => A): A
f(f(f(... for referentially transparent f.
f(f(f(... for referentially transparent f.
Definition Classes
FunctionFunctions
Since
7.0.1

Inherited from StringFunctions

Value Members

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): 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.
Definition Classes
StringFunctions
def parseBigDecimal(s: String): Validation[String, BigDecimal]
Definition Classes
StringFunctions
def parseBigInt(s: String): Validation[String, BigInteger]
Definition Classes
StringFunctions
def parseBoolean(s: String): Validation[String, Boolean]
Definition Classes
StringFunctions
def parseByte(s: String): Validation[String, Byte]
Definition Classes
StringFunctions
def parseDouble(s: String): Validation[String, Double]
Definition Classes
StringFunctions
def parseFloat(s: String): Validation[String, Float]
Definition Classes
StringFunctions
def parseInt(s: String): Validation[String, Int]
Definition Classes
StringFunctions
def parseLong(s: String): Validation[String, Long]
Definition Classes
StringFunctions
def parseShort(s: String): Validation[String, Short]
Definition Classes
StringFunctions
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

Inherited from OrderingFunctions

Value Members

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

Inherited from BooleanFunctions

Value Members

final def conditional(p: Boolean, q: => Boolean): Boolean
Conditional.
Conditional.
```
p q  p --> q
0 0  1
0 1  1
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def conjunction(p: Boolean, q: => Boolean): Boolean
Conjunction.
Conjunction. (AND)
```
p q  p ∧ q
0 0  0
0 1  0
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def disjunction(p: Boolean, q: => Boolean): Boolean
Disjunction.
Disjunction. (OR)
```
p q  p ∨ q
0 0  0
0 1  1
1 0  1
1 1  1
```
Definition Classes
BooleanFunctions
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.
Definition Classes
BooleanFunctions
final def emptyOrPointNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
emptyOrPoint curried into a natural transformation.
emptyOrPoint curried into a natural transformation.
Definition Classes
BooleanFunctions
final def fold[A](cond: Boolean, t: => A, f: => A): A
returns
t if cond is true, f otherwise
Definition Classes
BooleanFunctions
final def inverseConditional(p: Boolean, q: => Boolean): Boolean
Inverse Conditional.
Inverse Conditional.
```
p q  p <-- q
0 0  1
0 1  0
1 0  1
1 1  1
```
Definition Classes
BooleanFunctions
final def nand(p: Boolean, q: => Boolean): Boolean
Negation of Conjunction.
Negation of Conjunction. (NAND)
```
p q  p !&& q
0 0  1
0 1  1
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def negConditional(p: Boolean, q: => Boolean): Boolean
Negational of Conditional.
Negational of Conditional.
```
p q  p ⇏ q
0 0  0
0 1  0
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def negInverseConditional(p: Boolean, q: => Boolean): Boolean
Negation of Inverse Conditional.
Negation of Inverse Conditional.
```
p q  p <\- q
0 0  0
0 1  1
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def nor(p: Boolean, q: => Boolean): Boolean
Negation of Disjunction.
Negation of Disjunction. (NOR)
```
p q  p !|| q
0 0  1
0 1  0
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def option[A](cond: Boolean, a: => A): Option[A]
Returns the given argument in Some if cond is true, None otherwise.
Returns the given argument in Some if cond is true, None otherwise.
Definition Classes
BooleanFunctions
final def pointOrEmpty[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Definition Classes
BooleanFunctions
final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
pointOrEmpty curried into a natural transformation.
pointOrEmpty curried into a natural transformation.
Definition Classes
BooleanFunctions
def test(p: Boolean): Int
Returns 1 if p is true, or 0 otherwise.
Returns 1 if p is true, or 0 otherwise.
Definition Classes
BooleanFunctions
final def unless(cond: Boolean)(f: => Unit): Unit
Executes the given side-effect if cond is false
Executes the given side-effect if cond is false
Definition Classes
BooleanFunctions
final def unlessM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]
Returns the given argument if cond is false, otherwise, unit lifted into M.
Returns the given argument if cond is false, otherwise, unit lifted into M.
Definition Classes
BooleanFunctions
final def unlessMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of unlessM that infers the type constructor M.
A version of unlessM that infers the type constructor M.
Definition Classes
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.
Definition Classes
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
Definition Classes
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.
Definition Classes
BooleanFunctions
final def whenMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of whenM that infers the type constructor M.
A version of whenM that infers the type constructor M.
Definition Classes
BooleanFunctions
final def zeroOrValue[A](cond: Boolean)(value: => A)(implicit z: Monoid[A]): A
Returns the given argument if cond is false, otherwise, the zero element for the type of the given argument.
Returns the given argument if cond is false, otherwise, the zero element for the type of the given argument.
Definition Classes
BooleanFunctions

Inherited from LazyListFunctions

Value Members

final def heads[A](as: LazyList[A]): LazyList[LazyList[A]]
[as take 1, as take 2, ..., as]
[as take 1, as take 2, ..., as]
Definition Classes
LazyListFunctions
final def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
Definition Classes
LazyListFunctions
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
Definition Classes
LazyListFunctions
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)]
Definition Classes
LazyListFunctions
final def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions
def unfold[A, B](seed: A)(f: (A) => Option[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def unfoldForest[A, B](as: LazyList[A])(f: (A) => (B, () => LazyList[A])): LazyList[Tree[B]]
Definition Classes
LazyListFunctions
final def unfoldForestM[A, B, M[_]](as: LazyList[A])(f: (A) => M[(B, LazyList[A])])(implicit arg0: Monad[M]): M[LazyList[Tree[B]]]
Definition Classes
LazyListFunctions
def unfoldm[A, B](seed: A)(f: (A) => Maybe[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def zapp[A, B, C](a: LazyList[A])(f: LazyList[(A) => (B) => C]): LazyList[(B) => C]
Definition Classes
LazyListFunctions
final def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions

Inherited from OptionFunctions

Value Members

final def cata[A, X](oa: Option[A])(some: (A) => X, none: => X): X
Catamorphism over the option.
Catamorphism over the option. Returns the provided function some applied to item contained in the Option if it is defined, otherwise, the provided value none.
Definition Classes
OptionFunctions
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
final def getOrElseF[A, F[_]](oa: Option[A])(fa: => F[A])(implicit arg0: Applicative[F]): 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.
Definition Classes
OptionFunctions
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 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
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 toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
Definition Classes
OptionFunctions
final def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
Definition Classes
OptionFunctions
final def toLeft[A, B](oa: Option[A])(b: => B): \/[A, B]
Definition Classes
OptionFunctions
final def toMaybe[A](oa: Option[A]): Maybe[A]
Definition Classes
OptionFunctions
final def toRight[A, E](oa: Option[A])(e: => E): \/[E, A]
Definition Classes
OptionFunctions
final def toSuccess[A, E](oa: Option[A])(e: => E): Validation[E, A]
Definition Classes
OptionFunctions
final def toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
Definition Classes
OptionFunctions

Inherited from ListFunctions

Value Members

final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) => B)(implicit arg0: Monoid[B]): B
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Definition Classes
ListFunctions
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 and as, excluding same-element pairs.
Combinations of as and as, excluding same-element pairs.
Definition Classes
ListFunctions
final def breakM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
spanM with p's complement.
spanM with p's complement.
Definition Classes
ListFunctions
final def filterM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]
Definition Classes
ListFunctions
final def findM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[Maybe[A]]
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Definition Classes
ListFunctions
final def groupBy1[A, B](as: List[A])(f: (A) => B): Map[B, NonEmptyList[A]]
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
Definition Classes
ListFunctions
final def groupWhen[A](as: List[A])(p: (A, A) => Boolean): List[NonEmptyList[A]]
groupWhenM specialized to scalaz.Id.Id.
groupWhenM specialized to scalaz.Id.Id.
Definition Classes
ListFunctions
final def groupWhenM[A, M[_]](as: List[A])(p: (A, A) => M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]
Split at each point where p(as(n), as(n+1)) yields false.
Split at each point where p(as(n), as(n+1)) yields false.
Definition Classes
ListFunctions
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
final def intersperse[A](as: List[A], a: A): List[A]
Intersperse the element a between each adjacent pair of elements in as
Intersperse the element a between each adjacent pair of elements in as
Definition Classes
ListFunctions
final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
Definition Classes
ListFunctions
final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
Definition Classes
ListFunctions
final def nil[A]: List[A]
scala.Nil with a sometimes more convenient type
scala.Nil with a sometimes more convenient type
Definition Classes
ListFunctions
final def partitionM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit F: Applicative[M]): M[(List[A], List[A])]
A pair of passing and failing values of as against p.
A pair of passing and failing values of as against p.
Definition Classes
ListFunctions
final def powerset[A](as: List[A]): List[List[A]]
Definition Classes
ListFunctions
final def spanM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
A pair of the longest prefix of passing as against p, and the remainder.
A pair of the longest prefix of passing as against p, and the remainder.
Definition Classes
ListFunctions
final def tailOption[A](as: List[A]): Option[List[A]]
Definition Classes
ListFunctions
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 collect as while p yields false.
Run p(a)s and collect as while p yields false. Don't run any ps after the first true.
Definition Classes
ListFunctions
final def takeWhileM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[List[A]]
Run p(a)s and collect as while p yields true.
Run p(a)s and collect as while p yields true. Don't run any ps after the first false.
Definition Classes
ListFunctions
final def toNel[A](as: List[A]): Maybe[NonEmptyList[A]]
Definition Classes
ListFunctions
final def toZipper[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions
final def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions

Inherited from AnyRef

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): Boolean
Definition Classes
AnyRef → Any
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def toString(): String
Definition Classes
AnyRef → Any
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Any

Value Members

final def asInstanceOf[T0]: T0
Definition Classes
Any
final def isInstanceOf[T0]: Boolean
Definition Classes
Any

Ungrouped

final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
final def <^>[A, B](as: List[A])(f: (NonEmptyList[A]) => B)(implicit arg0: Monoid[B]): B
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.
Definition Classes
ListFunctions
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
Definition Classes
OrderingFunctions
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 and as, excluding same-element pairs.
Combinations of as and as, excluding same-element pairs.
Definition Classes
ListFunctions
final def asInstanceOf[T0]: T0
Definition Classes
Any
final def breakM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[(List[A], List[A])]
spanM with p's complement.
spanM with p's complement.
Definition Classes
ListFunctions
final def cata[A, X](oa: Option[A])(some: (A) => X, none: => X): X
Catamorphism over the option.
Catamorphism over the option. Returns the provided function some applied to item contained in the Option if it is defined, otherwise, the provided value none.
Definition Classes
OptionFunctions
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): 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.
Definition Classes
StringFunctions
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def conditional(p: Boolean, q: => Boolean): Boolean
Conditional.
Conditional.
```
p q  p --> q
0 0  1
0 1  1
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def conjunction(p: Boolean, q: => Boolean): Boolean
Conjunction.
Conjunction. (AND)
```
p q  p ∧ q
0 0  0
0 1  0
1 0  0
1 1  1
```
Definition Classes
BooleanFunctions
final def disjunction(p: Boolean, q: => Boolean): Boolean
Disjunction.
Disjunction. (OR)
```
p q  p ∨ q
0 0  0
0 1  1
1 0  1
1 1  1
```
Definition Classes
BooleanFunctions
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.
Definition Classes
BooleanFunctions
final def emptyOrPointNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
emptyOrPoint curried into a natural transformation.
emptyOrPoint curried into a natural transformation.
Definition Classes
BooleanFunctions
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(arg0: AnyRef): 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[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[Maybe[A]]
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Run p(a)s left-to-right until it yields a true value, answering Some(that), or None if nothing matched p.
Definition Classes
ListFunctions
final def fix[A](f: (=> A) => A): A
f(f(f(... for referentially transparent f.
f(f(f(... for referentially transparent f.
Definition Classes
FunctionFunctions
Since
7.0.1
final def fold[A](cond: Boolean, t: => A, f: => A): A
returns
t if cond is true, f otherwise
Definition Classes
BooleanFunctions
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
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
final def getOrElseF[A, F[_]](oa: Option[A])(fa: => F[A])(implicit arg0: Applicative[F]): 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.
Definition Classes
OptionFunctions
final def groupBy1[A, B](as: List[A])(f: (A) => B): Map[B, NonEmptyList[A]]
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
As with the standard library groupBy but preserving the fact that the values in the Map must be non-empty
Definition Classes
ListFunctions
final def groupWhen[A](as: List[A])(p: (A, A) => Boolean): List[NonEmptyList[A]]
groupWhenM specialized to scalaz.Id.Id.
groupWhenM specialized to scalaz.Id.Id.
Definition Classes
ListFunctions
final def groupWhenM[A, M[_]](as: List[A])(p: (A, A) => M[Boolean])(implicit arg0: Monad[M]): M[List[NonEmptyList[A]]]
Split at each point where p(as(n), as(n+1)) yields false.
Split at each point where p(as(n), as(n+1)) yields false.
Definition Classes
ListFunctions
def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
final def heads[A](as: LazyList[A]): LazyList[LazyList[A]]
[as take 1, as take 2, ..., as]
[as take 1, as take 2, ..., as]
Definition Classes
LazyListFunctions
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
final def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
Definition Classes
LazyListFunctions
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
Definition Classes
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
Definition Classes
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
```
Definition Classes
BooleanFunctions
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def mapAccumLeft[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
All of the Bs, in order, and the final C acquired by a stateful left fold over as.
Definition Classes
ListFunctions
final def mapAccumRight[A, B, C](as: List[A])(c: C, f: (C, A) => (C, B)): (C, List[B])
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.
Definition Classes
ListFunctions
final def nand(p: Boolean, q: => Boolean): Boolean
Negation of Conjunction.
Negation of Conjunction. (NAND)
```
p q  p !&& q
0 0  1
0 1  1
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final def negConditional(p: Boolean, q: => Boolean): Boolean
Negational of Conditional.
Negational of Conditional.
```
p q  p ⇏ q
0 0  0
0 1  0
1 0  1
1 1  0
```
Definition Classes
BooleanFunctions
final def negInverseConditional(p: Boolean, q: => Boolean): Boolean
Negation of Inverse Conditional.
Negation of Inverse Conditional.
```
p q  p <\- q
0 0  0
0 1  1
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def nil[A]: List[A]
scala.Nil with a sometimes more convenient type
scala.Nil with a sometimes more convenient type
Definition Classes
ListFunctions
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 nor(p: Boolean, q: => Boolean): Boolean
Negation of Disjunction.
Negation of Disjunction. (NOR)
```
p q  p !|| q
0 0  1
0 1  0
1 0  0
1 1  0
```
Definition Classes
BooleanFunctions
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def option[A](cond: Boolean, a: => A): Option[A]
Returns the given argument in Some if cond is true, None otherwise.
Returns the given argument in Some if cond is true, None otherwise.
Definition Classes
BooleanFunctions
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 parseBigDecimal(s: String): Validation[String, BigDecimal]
Definition Classes
StringFunctions
def parseBigInt(s: String): Validation[String, BigInteger]
Definition Classes
StringFunctions
def parseBoolean(s: String): Validation[String, Boolean]
Definition Classes
StringFunctions
def parseByte(s: String): Validation[String, Byte]
Definition Classes
StringFunctions
def parseDouble(s: String): Validation[String, Double]
Definition Classes
StringFunctions
def parseFloat(s: String): Validation[String, Float]
Definition Classes
StringFunctions
def parseInt(s: String): Validation[String, Int]
Definition Classes
StringFunctions
def parseLong(s: String): Validation[String, Long]
Definition Classes
StringFunctions
def parseShort(s: String): Validation[String, Short]
Definition Classes
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.
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 pointOrEmpty[M[_], A](cond: Boolean)(a: => A)(implicit M: Applicative[M], M0: PlusEmpty[M]): M[A]
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Returns the value a lifted into the context M if cond is true, otherwise, the empty value for M.
Definition Classes
BooleanFunctions
final def pointOrEmptyNT[M[_]](cond: Boolean)(implicit M: Applicative[M], M0: PlusEmpty[M]): ~>[Id.Id, M]
pointOrEmpty curried into a natural transformation.
pointOrEmpty curried into a natural transformation.
Definition Classes
BooleanFunctions
final def powerset[A](as: List[A]): List[List[A]]
Definition Classes
ListFunctions
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 against p, and the remainder.
A pair of the longest prefix of passing as against p, and the remainder.
Definition Classes
ListFunctions
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
final def tailOption[A](as: List[A]): Option[List[A]]
Definition Classes
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)]
Definition Classes
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]
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 collect as while p yields false.
Run p(a)s and collect as while p yields false. Don't run any ps after the first true.
Definition Classes
ListFunctions
final def takeWhileM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Monad[M]): M[List[A]]
Run p(a)s and collect as while p yields true.
Run p(a)s and collect as while p yields true. Don't run any ps after the first false.
Definition Classes
ListFunctions
def test(p: Boolean): Int
Returns 1 if p is true, or 0 otherwise.
Returns 1 if p is true, or 0 otherwise.
Definition Classes
BooleanFunctions
final def toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
Definition Classes
OptionFunctions
final def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
Definition Classes
OptionFunctions
final def toLeft[A, B](oa: Option[A])(b: => B): \/[A, B]
Definition Classes
OptionFunctions
final def toMaybe[A](oa: Option[A]): Maybe[A]
Definition Classes
OptionFunctions
final def toNel[A](as: List[A]): Maybe[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 toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
Definition Classes
OptionFunctions
final def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions
final def toZipper[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions
def unfold[A, B](seed: A)(f: (A) => Option[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def unfoldForest[A, B](as: LazyList[A])(f: (A) => (B, () => LazyList[A])): LazyList[Tree[B]]
Definition Classes
LazyListFunctions
final def unfoldForestM[A, B, M[_]](as: LazyList[A])(f: (A) => M[(B, LazyList[A])])(implicit arg0: Monad[M]): M[LazyList[Tree[B]]]
Definition Classes
LazyListFunctions
def unfoldm[A, B](seed: A)(f: (A) => Maybe[(B, A)]): LazyList[B]
Definition Classes
LazyListFunctions
final def unless(cond: Boolean)(f: => Unit): Unit
Executes the given side-effect if cond is false
Executes the given side-effect if cond is false
Definition Classes
BooleanFunctions
final def unlessM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]
Returns the given argument if cond is false, otherwise, unit lifted into M.
Returns the given argument if cond is false, otherwise, unit lifted into M.
Definition Classes
BooleanFunctions
final def unlessMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of unlessM that infers the type constructor M.
A version of unlessM that infers the type constructor M.
Definition Classes
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.
Definition Classes
BooleanFunctions
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def when(cond: Boolean)(f: => Unit): Unit
Executes the given side-effect if cond is true
Executes the given side-effect if cond is true
Definition Classes
BooleanFunctions
final def whenM[M[_], A](cond: Boolean)(f: => M[A])(implicit M: Applicative[M]): M[Unit]
Returns the given argument if cond is true, otherwise, unit lifted into M.
Returns the given argument if cond is true, otherwise, unit lifted into M.
Definition Classes
BooleanFunctions
final def whenMU[MA](cond: Boolean)(f: => MA)(implicit M: Unapply[Applicative, MA]): M[Unit]
A version of whenM that infers the type constructor M.
A version of whenM that infers the type constructor M.
Definition Classes
BooleanFunctions
final def zapp[A, B, C](a: LazyList[A])(f: LazyList[(A) => (B) => C]): LazyList[(B) => C]
Definition Classes
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.
Definition Classes
BooleanFunctions
final def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
Definition Classes
LazyListFunctions
final def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
Definition Classes
ListFunctions

Packages

AllFunctions

Companion trait AllFunctions

object AllFunctions extends AllFunctions

Value Members

Inherited from FunctionFunctions

Value Members

Inherited from StringFunctions

Value Members

Inherited from OrderingFunctions

Value Members

Inherited from BooleanFunctions

Value Members

Inherited from LazyListFunctions

Value Members

Inherited from OptionFunctions

Value Members

Inherited from ListFunctions

Value Members

Inherited from AnyRef

Value Members

Inherited from Any

Value Members

Ungrouped

AllFunctions