Packages

trait AllFunctions extends ListFunctions with OptionFunctions with LazyListFunctions with BooleanFunctions with OrderingFunctions with StringFunctions with FunctionFunctions

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AllFunctions
  2. FunctionFunctions
  3. StringFunctions
  4. OrderingFunctions
  5. BooleanFunctions
  6. LazyListFunctions
  7. OptionFunctions
  8. ListFunctions
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. 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
  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. final def ToScalazOrderFromOrdering[A](oa: scala.math.Ordering[A]): Order[A]
    Definition Classes
    OrderingFunctions
  6. 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
  7. 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
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. 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
  10. 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
  11. 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
  12. 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
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  14. 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
  15. 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
  16. 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
  17. 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
  18. 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
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  21. final def filterM[A, M[_]](as: List[A])(p: (A) => M[Boolean])(implicit arg0: Applicative[M]): M[List[A]]
    Definition Classes
    ListFunctions
  22. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  23. 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 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.

    Definition Classes
    ListFunctions
  24. 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

  25. final def fold[A](cond: Boolean, t: => A, f: => A): A

    returns

    t if cond is true, f otherwise

    Definition Classes
    BooleanFunctions
  26. final def fold[A, X](oa: Option[A])(some: (A) => X, none: => X): X

    Alias for cata

    Alias for cata

    Definition Classes
    OptionFunctions
  27. 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
  28. 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
  29. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  30. 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
  31. 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
  32. 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
  33. 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
  34. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  35. 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
  36. 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
  37. final def interleave[A](s1: LazyList[A], s2: LazyList[A]): LazyList[A]
    Definition Classes
    LazyListFunctions
  38. 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
  39. 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
  40. 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
  41. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  42. 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
  43. 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
  44. 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
  45. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  46. 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
  47. 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
  48. 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
  49. 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
  50. 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
  51. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  52. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  53. 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
  54. 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
  55. def parseBigDecimal(s: String): Validation[String, BigDecimal]
    Definition Classes
    StringFunctions
  56. def parseBigInt(s: String): Validation[String, BigInteger]
    Definition Classes
    StringFunctions
  57. def parseBoolean(s: String): Validation[String, Boolean]
    Definition Classes
    StringFunctions
  58. def parseByte(s: String): Validation[String, Byte]
    Definition Classes
    StringFunctions
  59. def parseDouble(s: String): Validation[String, Double]
    Definition Classes
    StringFunctions
  60. def parseFloat(s: String): Validation[String, Float]
    Definition Classes
    StringFunctions
  61. def parseInt(s: String): Validation[String, Int]
    Definition Classes
    StringFunctions
  62. def parseLong(s: String): Validation[String, Long]
    Definition Classes
    StringFunctions
  63. def parseShort(s: String): Validation[String, Short]
    Definition Classes
    StringFunctions
  64. 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
  65. 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
  66. 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
  67. 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
  68. final def powerset[A](as: List[A]): List[List[A]]
    Definition Classes
    ListFunctions
  69. 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
  70. 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
  71. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  72. final def tailOption[A](as: List[A]): Option[List[A]]
    Definition Classes
    ListFunctions
  73. 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
  74. 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
  75. 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
  76. 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
  77. 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
  78. final def toFailure[A, B](oa: Option[A])(b: => B): Validation[A, B]
    Definition Classes
    OptionFunctions
  79. final def toFailureNel[A, B](oa: Option[A])(b: => B): ValidationNel[A, B]
    Definition Classes
    OptionFunctions
  80. final def toLeft[A, B](oa: Option[A])(b: => B): \/[A, B]
    Definition Classes
    OptionFunctions
  81. final def toMaybe[A](oa: Option[A]): Maybe[A]
    Definition Classes
    OptionFunctions
  82. final def toNel[A](as: List[A]): Maybe[NonEmptyList[A]]
    Definition Classes
    ListFunctions
  83. final def toRight[A, E](oa: Option[A])(e: => E): \/[E, A]
    Definition Classes
    OptionFunctions
  84. def toString(): String
    Definition Classes
    AnyRef → Any
  85. final def toSuccess[A, E](oa: Option[A])(e: => E): Validation[E, A]
    Definition Classes
    OptionFunctions
  86. final def toSuccessNel[A, E](oa: Option[A])(e: => E): ValidationNel[E, A]
    Definition Classes
    OptionFunctions
  87. final def toZipper[A](as: LazyList[A]): Maybe[Zipper[A]]
    Definition Classes
    LazyListFunctions
  88. final def toZipper[A](as: List[A]): Maybe[Zipper[A]]
    Definition Classes
    ListFunctions
  89. def unfold[A, B](seed: A)(f: (A) => Option[(B, A)]): LazyList[B]
    Definition Classes
    LazyListFunctions
  90. final def unfoldForest[A, B](as: LazyList[A])(f: (A) => (B, () => LazyList[A])): LazyList[Tree[B]]
    Definition Classes
    LazyListFunctions
  91. 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
  92. def unfoldm[A, B](seed: A)(f: (A) => Maybe[(B, A)]): LazyList[B]
    Definition Classes
    LazyListFunctions
  93. 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
  94. 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
  95. 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
  96. 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
  97. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  98. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  99. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  100. 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
  101. 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
  102. 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
  103. final def zapp[A, B, C](a: LazyList[A])(f: LazyList[(A) => (B) => C]): LazyList[(B) => C]
    Definition Classes
    LazyListFunctions
  104. 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
  105. final def zipperEnd[A](as: LazyList[A]): Maybe[Zipper[A]]
    Definition Classes
    LazyListFunctions
  106. final def zipperEnd[A](as: List[A]): Maybe[Zipper[A]]
    Definition Classes
    ListFunctions

Inherited from FunctionFunctions

Inherited from StringFunctions

Inherited from OrderingFunctions

Inherited from BooleanFunctions

Inherited from LazyListFunctions

Inherited from OptionFunctions

Inherited from ListFunctions

Inherited from AnyRef

Inherited from Any

Ungrouped