Scalaz
Related Doc:
package scalaz
The strict identity type constructor.
The strict identity type constructor. Can be thought of as Tuple1, but with no
runtime representation.
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.
[(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))]
Combinations of as and as, excluding same-element pairs.
Combinations of as and as, excluding same-element pairs.
Vary the value of m get k.
Vary the value of m get k.
Vary the value of m get k.
Vary the value of m get k.
spanM with p's complement.
spanM with p's complement.
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.
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.
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.
Conditional.
Conditional.
p q p --> q 0 0 1 0 1 1 1 0 0 1 1 1
Conjunction.
Conjunction. (AND)
p q p ∧ q 0 0 0 0 1 0 1 0 0 1 1 1
Disjunction.
Disjunction. (OR)
p q p ∨ q 0 0 0 0 1 1 1 0 1 1 1 1
Right biased monad
Right biased monad
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.
emptyOrPoint curried into a natural transformation.
emptyOrPoint curried into a natural transformation.
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.
f(f(f(... for referentially transparent f.
f(f(f(... for referentially transparent f.
7.0.1
t if cond is true, f otherwise
Alias for cata
Alias for cata
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.
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.
Requires explicit usage as the use of Await.result.
Requires explicit usage as the use of Await.result. Can throw an exception, which is inherently bad.
Grab a value out of SortedMap if it's present.
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 Map if it's present.
Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.
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.
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
groupWhenM specialized to scalaz.Id.Id.
groupWhenM specialized to scalaz.Id.Id.
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.
[Nil, as take 1, as take 2, ..., as]
[Nil, as take 1, as take 2, ..., as]
As with SortedMap.updated, but resolve a collision with f.
As with SortedMap.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.
As with Map.updated, but resolve a collision with f. The
first argument is guaranteed to be from m1.
Collect only elements with matching keys, joining their
associated values with f.
Collect only elements with matching keys, joining their
associated values with f.
Collect only elements with matching keys, joining their
associated values with f.
Collect only elements with matching keys, joining their
associated values with f.
Like intersectWith, but tell f about the key.
Like intersectWith, but tell f about the key.
Like intersectWith, but tell f about the key.
Like intersectWith, but tell f about the key.
Intersperse the element a between each adjacent pair of elements in as
Intersperse the element a between each adjacent pair of elements in as
Inverse Conditional.
Inverse Conditional.
p q p <-- q 0 0 1 0 1 0 1 0 1 1 1 1
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.
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.
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.
Exchange keys of m according to f.
Exchange keys of m according to f. Result may be smaller if
f maps two or more Ks to the same K2, in which case the
resulting associated value is an arbitrary choice.
Exchange keys of m according to f.
Exchange keys of m according to f. Result may be smaller if
f maps two or more Ks to the same K2, in which case the
resulting associated value is an arbitrary choice.
Map union monoid, unifying values with V's append.
Map union monoid, unifying values with V's append.
Negation of Conjunction.
Negation of Conjunction. (NAND)
p q p !&& q 0 0 1 0 1 1 1 0 1 1 1 0
Negational of Conditional.
Negational of Conditional.
p q p ⇏ q 0 0 0 0 1 0 1 0 1 1 1 0
Negation of Inverse Conditional.
Negation of Inverse Conditional.
p q p <\- q 0 0 0 0 1 1 1 0 0 1 1 0
scala.Nil with a sometimes more convenient type
scala.Nil with a sometimes more convenient type
scala.None with a sometimes more convenient type.
scala.None with a sometimes more convenient type.
Negation of Disjunction.
Negation of Disjunction. (NOR)
p q p !|| q 0 0 1 0 1 0 1 0 0 1 1 0
Returns the given argument in Some if cond is true, None otherwise.
Returns the given argument in Some if cond is true, None otherwise.
Add None as an element less than all As.
Add None as an element less than all As.
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.
A pair of passing and failing values of as against p.
A pair of passing and failing values of as against p.
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.
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.
pointOrEmpty curried into a natural transformation.
pointOrEmpty curried into a natural transformation.
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.
scala.Some.apply with a sometimes more convenient type.
scala.Some.apply with a sometimes more convenient type.
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.
SortedMap union monoid, unifying values with V's append.
SortedMap union monoid, unifying values with V's append.
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.
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)
[as, as.tail, as.tail.tail, ..., Nil]
[as, as.tail, as.tail.tail, ..., Nil]
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.
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.
Returns 1 if p is true, or 0 otherwise.
Returns 1 if p is true, or 0 otherwise.
Tuple1[A] is isomorphic to Id[X]
Tuple1[A] is isomorphic to Id[X]
Product BindRec
Product BindRec
Product functor and comonad
Product functor and comonad
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.
iff f gives rise to a scalaz.Semigroup, so does
unionWith(_, _)(f).
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.
iff f gives rise to a scalaz.Semigroup, so does
unionWith(_, _)(f).
Like unionWith, but telling f about the key.
Like unionWith, but telling f about the key.
Like unionWith, but telling f about the key.
Like unionWith, but telling f about the key.
Executes the given side-effect if cond is false
Executes the given side-effect if cond is false
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.
A version of unlessM that infers the type constructor M.
A version of unlessM that infers the type constructor M.
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.
Executes the given side-effect if cond is true
Executes the given side-effect if cond is true
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.
A version of whenM that infers the type constructor M.
A version of whenM that infers the type constructor M.
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.
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.
(Since version 7.3.0) use emptyOrPoint instead
(Since version 7.3.0) use emptyOrPointNT instead