Uses of Interface
com.jnape.palatable.lambda.monad.MonadReader
Packages that use MonadReader
Package
Description
-
Uses of MonadReader in com.jnape.palatable.lambda.functions
Subinterfaces of MonadReader in com.jnape.palatable.lambda.functionsModifier and TypeInterfaceDescriptioninterface
Effect<A>
A function returning "no result", and therefore only useful as a side-effect.interface
Fn0<A>
interface
Fn1<A,
B> A function taking a single argument.interface
Fn2<A,
B, C> A function taking two arguments.interface
Fn3<A,
B, C, D> A function taking three arguments.interface
Fn4<A,
B, C, D, E> A function taking four arguments.interface
Fn5<A,
B, C, D, E, F> A function taking five arguments.interface
Fn6<A,
B, C, D, E, F, G> A function taking six arguments.interface
Fn7<A,
B, C, D, E, F, G, H> A function taking seven arguments.interface
Fn8<A,
B, C, D, E, F, G, H, I> A function taking eight arguments. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn1
Classes in com.jnape.palatable.lambda.functions.builtin.fn1 that implement MonadReaderModifier and TypeClassDescriptionfinal class
CatMaybes<A>
final class
Coalesce<L,
R> final class
Constantly<A,
B> A function that takes two arguments and always returns the first argument.final class
Cycle<A>
Given anIterable
, return an infiniteIterable
that repeatedly cycles its elements, in order.final class
Distinct<A>
final class
Downcast<A extends B,
B> Covariantly cast a value of typeB
to a value of subtypeA
.final class
Empty<A>
A predicate that returns true ifas
is empty; false otherwise.final class
Flatten<A>
final class
Force<A>
Deprecated.final class
Head<A>
final class
Id<A>
The identity function.final class
Init<A>
final class
Inits<A>
final class
Last<A>
final class
Magnetize<A>
final class
Not<A>
Negate a predicate function.final class
Occurrences<A>
final class
Repeat<A>
Given a value, return an infiniteIterable
that repeatedly iterates that value.final class
Reverse<A>
Given anIterable
, return a reversed representation of thatIterable
.final class
final class
Sort<A extends Comparable<A>>
final class
Tail<A>
Returns the tail of anIterable
; the is, anIterable
of all the elements except for the head element.final class
Tails<A>
final class
Uncons<A>
final class
Upcast<A extends B,
B> Upcast a value of typeB
to a value of typeA
thatB
extends. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn2
Classes in com.jnape.palatable.lambda.functions.builtin.fn2 that implement MonadReaderModifier and TypeClassDescriptionfinal class
$<A,
B> final class
All<A>
Eagerly apply a predicate to each element in anIterable
, returningtrue
if every element satisfies the predicate, andfalse
otherwise.final class
Alter<A>
final class
Any<A>
Eagerly apply a predicate to each element in anIterable
, returningtrue
if any element satisfies the predicate, andfalse
otherwise.final class
AutoBracket<A extends AutoCloseable,
B> Given anIO
yielding someAutoCloseable
typeA
and a kleisli arrow from that type to a newIO
of typeB
, attempt to provision theA
, applying the body operation if provisioning was successful and ensuring thatAutoCloseable.close()
is called regardless of whether the body succeeds or fails.final class
Both<A,
B, C> final class
CartesianProduct<A,
B> Lazily compute the cartesian product of anIterable<A>
andIterable<B>
, returning anIterable<Tuple2<A, B>>
, the products as tuples of multiplicandA
s and multiplierB
s.final class
CmpEq<A extends Comparable<A>>
Given twoComparable
values of typeA
, returntrue
if the first value is strictly equal to the second value (according toComparable.compareTo(Object)
; otherwise, return false.final class
Cons<A>
Prepend an element to anIterable
.final class
Difference<A>
final class
Drop<A>
Lazily skip the firstn
elements from anIterable
by returning anIterable
that begins iteration after thenth
element.final class
DropWhile<A>
Lazily limit theIterable
by skipping the first contiguous group of elements that satisfy the predicate, beginning iteration at the first element for which the predicate evaluates tofalse
.final class
Eq<A>
Type-safe equality in function form; usesObject.equals(java.lang.Object)
, not==
.final class
Filter<A>
Lazily apply a predicate to each element in anIterable
, returning anIterable
of just the elements for which the predicate evaluated totrue
.final class
Find<A>
Iterate the elements in anIterable
, applying a predicate to each one, returning the first element that matches the predicate, wrapped in aMaybe
.final class
GroupBy<K,
V> Given anIterable<V>
vs
and a key functionV -> K
f
, foldvs
into aMap<K, List<V>>
by applyingf
to each element ofvs
, retaining values that map to the same key in a list, in the order they were iterated in.final class
GT<A extends Comparable<A>>
Given twoComparable
values of typeA
, returntrue
if the second value is strictly greater than the first value; otherwise, return false.final class
GTE<A extends Comparable<A>>
Given twoComparable
values of typeA
, returntrue
if the second value is greater than or equal to the first value according toComparable.compareTo(Object)
; otherwise, return false.final class
InGroupsOf<A>
Lazily group theIterable
by returning anIterable
of smallerIterable
s of sizek
.final class
Intersperse<A>
Lazily inject the provided separator value between each value in the suppliedIterable
.final class
Into<A,
B, C> final class
Into1<A,
B> Given an
and aFn1
<A, B>
, pop the head and apply it to the function, returning the result.SingletonHList
<A>final class
Into3<A,
B, C, D> final class
Into4<A,
B, C, D, E> final class
Into5<A,
B, C, D, E, F> final class
Into6<A,
B, C, D, E, F, G> final class
Into7<A,
B, C, D, E, F, G, H> final class
Into8<A,
B, C, D, E, F, G, H, I> final class
Iterate<A>
final class
LazyRec<A,
B> final class
LT<A extends Comparable<A>>
Given twoComparable
values of typeA
, returntrue
if the second value is strictly less than the first value; otherwise, return false.final class
LTE<A extends Comparable<A>>
Given twoComparable
values of typeA
, returntrue
if the second value is less than or equal to the first value according toComparable.compareTo(Object)
otherwise, return false.final class
MagnetizeBy<A>
final class
Map<A,
B> Lazily apply a function to each element in anIterable
, producing anIterable
of the mapped results.final class
Partition<A,
B, C> Given anIterable<A>
as
and a disjoint mapping functiona -> CoProduct2<A, B>
, return aTuple2
over the lazily unwrapped leftA
and rightB
values in the first and second slots, respectively.final class
final class
Peek2<A,
B, FAB extends BoundedBifunctor<A, B, ? super A, ? super B, ?>> Deprecated.in favor of producing anIO
from the givenBoundedBifunctor
and explicitly running itfinal class
PrependAll<A>
Lazily prepend each value with of theIterable
with the supplied separator value.final class
ReduceLeft<A>
final class
ReduceRight<A>
final class
Replicate<A>
Produce anIterable
of a valuen
times.final class
Sequence<A,
App extends Applicative<?, App>, Trav extends Traversable<?, Trav>, TravA extends Traversable<A, Trav>, AppTrav extends Applicative<TravA, App>> Given aTraversable
ofApplicative
s and a pureApplicative
constructor, traverse the elements from left to right, zipping theApplicative
s together and collecting the results.final class
Slide<A>
final class
Snoc<A>
final class
SortBy<A,
B extends Comparable<B>> Given anIterable
and some mapping function from theIterable
element type to someComparable
type, produce a sortedList
of the original elements based on sorting applied to the result of the mapping function.final class
SortWith<A>
Given anIterable
and aComparator
over theIterable
element type, produce a sortedList
of the original elements based on sorting applied by theComparator
.final class
Span<A>
final class
Take<A>
Lazily limit theIterable
ton
elements by returning anIterable
that stops iteration after thenth
element, or the last element of theIterable
, whichever comes first.final class
TakeWhile<A>
Lazily limit theIterable
to the first group of contiguous elements that satisfy the predicate by iterating up to, but not including, the first element for which the predicate evaluates tofalse
.final class
ToArray<A>
Write all the elements of anIterable
directly into an array of the specified type.final class
ToCollection<A,
C extends Collection<A>> Given anFn0
of someCollection
C
, create an instance ofC
and add all of the elements in the providedIterable
to the instance.final class
final class
Tupler2<A,
B> Creates aTuple2
from two values.final class
Unfoldr<A,
B> final class
Until<A>
Given apredicate function
for a value of some typeA
and anIO
that yields a value of typeA
, produce anIO
that repeatedly executes the originalIO
until the predicate returns true when applied to the yielded value.final class
Zip<A,
B> Zip together twoIterable
s into a singleIterable
ofTuple2<A, B>
. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn3
Classes in com.jnape.palatable.lambda.functions.builtin.fn3 that implement MonadReaderModifier and TypeClassDescriptionfinal class
Between<A extends Comparable<A>>
Given two bounds and a value, return whether or not the value is greater than or equal to the lower bound and less than or equal to the upper bound.final class
Bracket<A,
B> Given anIO
that yields some typeA
, a cleanup operation to run if a value of that type could be provisioned, and a kleisli arrow from that type to a newIO
of typeB
, produce an
that, when run, will provision theIO
<B>A
,flatMap
it toB
, and clean up the original value if it was produced in the first place.final class
Clamp<A extends Comparable<A>>
Given two bounds and a value, "clamp" the value between the bounds via the following algorithm: - if the value is strictly less than the lower bound, return the lower bound - if the value is strictly greater than the upper bound, return the upper bound - otherwise, return the valuefinal class
CmpEqBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
and two values of typeA
, returntrue
if the first value is strictly equal to the second value (according toComparable.compareTo(Object)
in terms of their mappedB
results; otherwise, return false.final class
CmpEqWith<A>
Given aComparator
from some typeA
and two values of typeA
, returntrue
if the first value is strictly equal to the second value (according toComparator.compare(Object, Object)
otherwise, return false.final class
Compare<A>
Given aComparator
from some typeA
and two values of typeA
, return aComparisonRelation
of the first value with reference to the second value (according toComparator.compare(Object, Object)
.final class
FoldLeft<A,
B> Given anIterable
ofA
s, a starting valueB
, and a
, iteratively accumulate over theFn2
<B, A, B>Iterable
, ultimately returning a finalB
value.final class
FoldRight<A,
B> final class
GTBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
and two values of typeA
, returntrue
if the second value is strictly greater than the first value in terms of their mappedB
results; otherwise, return false.final class
GTEBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
and two values of typeA
, returntrue
if the second value is greater than or equal to the first value in terms of their mappedB
results according toComparable.compareTo(Object)
; otherwise, return false.final class
GTEWith<A>
Given aComparator
from some typeA
and two values of typeA
, returntrue
if the second value is greater than or equal to the first value in terms of their mappedB
results according toComparator.compare(Object, Object)
; otherwise, return false.final class
GTWith<A>
Given aComparator
from some typeA
and two values of typeA
, returntrue
if the second value is strictly greater than the first value in terms of their mappedB
results; otherwise, return false.final class
LiftA2<A,
B, C, App extends Applicative<?, App>, AppC extends Applicative<C, App>> Lift into and apply anFn2
to twoApplicative
values, returning the result inside the sameApplicative
context.final class
LTBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
and two values of typeA
, returntrue
if the second value is strictly less than the first value in terms of their mappedB
results; otherwise, return false.final class
LTEBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
and two values of typeA
, returntrue
if the second value is less than or equal to the first value in terms of their mappedB
results according toComparable.compareTo(Object)
; otherwise, return false.final class
LTEWith<A>
Given aComparator
from some typeA
and two values of typeA
, returntrue
if the second value is less than or equal to the first value in terms of their mappedB
results according toComparator.compare(Object, Object)
; otherwise, return false.final class
LTWith<A>
Given a comparator for some typeA
and two values of typeA
, returntrue
if the second value is strictly less than than the first value in terms of their mappedB
results; otherwise, return false.final class
ScanLeft<A,
B> Given anIterable
ofA
s, a starting valueB
, and a
, iteratively accumulate over theFn2
<B, A, B>Iterable
, collecting each function application result, finally returning anIterable
of all the results.final class
Times<A>
Given some number of timesn
to invoke a functionA -> A
, and given an inputA
, iteratively apply the function to the input, and then to the result of the invocation, a total ofn
times, returning the result.final class
ZipWith<A,
B, C> Zip together twoIterable
s by applying a zipping function to the successive elements of eachIterable
until one of them runs out of elements. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn4
Classes in com.jnape.palatable.lambda.functions.builtin.fn4 that implement MonadReaderModifier and TypeClassDescriptionfinal class
IfThenElse<A,
B> final class
LiftA3<A,
B, C, D, App extends Applicative<?, App>, AppD extends Applicative<D, App>> Lift into and apply anFn3
to threeApplicative
values, returning the result inside the sameApplicative
context.final class
RateLimit<A>
-
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn5
Classes in com.jnape.palatable.lambda.functions.builtin.fn5 that implement MonadReaderModifier and TypeClassDescriptionfinal class
LiftA4<A,
B, C, D, E, App extends Applicative<?, App>, AppE extends Applicative<E, App>> Lift into and apply anFn4
to fourApplicative
values, returning the result inside the sameApplicative
context. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn6
Classes in com.jnape.palatable.lambda.functions.builtin.fn6 that implement MonadReaderModifier and TypeClassDescriptionfinal class
LiftA5<A,
B, C, D, E, F, App extends Applicative<?, App>, AppF extends Applicative<F, App>> Lift into and apply anFn5
to fiveApplicative
values, returning the result inside the sameApplicative
context. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn7
Classes in com.jnape.palatable.lambda.functions.builtin.fn7 that implement MonadReaderModifier and TypeClassDescriptionfinal class
LiftA6<A,
B, C, D, E, F, G, App extends Applicative<?, App>, AppG extends Applicative<G, App>> Lift into and apply anFn6
to sixApplicative
values, returning the result inside the sameApplicative
context. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.builtin.fn8
Classes in com.jnape.palatable.lambda.functions.builtin.fn8 that implement MonadReaderModifier and TypeClassDescriptionfinal class
LiftA7<A,
B, C, D, E, F, G, H, App extends Applicative<?, App>, AppH extends Applicative<H, App>> Lift into and apply anFn7
to sevenApplicative
values, returning the result inside the sameApplicative
context. -
Uses of MonadReader in com.jnape.palatable.lambda.functions.recursion
Classes in com.jnape.palatable.lambda.functions.recursion that implement MonadReaderModifier and TypeClassDescriptionfinal class
Trampoline<A,
B> Given an
(analogous to "recurse" and "return" tail position instructions, respectively), produce aFn1
<A,CoProduct2
<A, B, ?>>
that unrolls the original function by iteratively passing each result that matches the input (Fn1
<A, B>A
) back to the original function, and then terminating on and returning the first output (B
). -
Uses of MonadReader in com.jnape.palatable.lambda.functions.specialized
Subinterfaces of MonadReader in com.jnape.palatable.lambda.functions.specializedModifier and TypeInterfaceDescriptioninterface
BiMonoidFactory<A,
B, C> interface
BiPredicate<A,
B> interface
BiSemigroupFactory<A,
B, C> interface
interface
MonoidFactory<A,
B> interface
Predicate<A>
A specializedFn1
that returns aBoolean
.interface
SemigroupFactory<A,
B> -
Uses of MonadReader in com.jnape.palatable.lambda.functor.builtin
Classes in com.jnape.palatable.lambda.functor.builtin that implement MonadReader -
Uses of MonadReader in com.jnape.palatable.lambda.monad
Classes in com.jnape.palatable.lambda.monad with type parameters of type MonadReaderModifier and TypeInterfaceDescriptioninterface
MonadReader<R,
A, MR extends MonadReader<R, ?, MR>> A monad that is capable of reading an environmentR
and producing a lifted valueA
.Methods in com.jnape.palatable.lambda.monad that return MonadReaderModifier and TypeMethodDescriptiondefault <B> MonadReader
<R, B, MR> MonadReader.discardL
(Applicative<B, MR> appB) Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.default <B> MonadReader
<R, A, MR> MonadReader.discardR
(Applicative<B, MR> appB) Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.<B> MonadReader
<R, B, MR> Chain dependent computations that may continue or short-circuit based on previous results.default <B> MonadReader
<R, B, MR> Covariantly transmute this functor's parameter using the given mapping function.MonadReader
<R, A, MR> Modify thisMonadReader's
environment after reading it but before running the effect.<B> MonadReader
<R, B, MR> MonadReader.pure
(B b) Lift the valueb
into this applicative functor.default <B> MonadReader
<R, B, MR> MonadReader.zip
(Applicative<Fn1<? super A, ? extends B>, MR> appFn) Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.Methods in com.jnape.palatable.lambda.monad that return types with arguments of type MonadReaderModifier and TypeMethodDescriptiondefault <B> Lazy
<? extends MonadReader<R, B, MR>> Given alazy
instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports. -
Uses of MonadReader in com.jnape.palatable.lambda.monad.transformer.builtin
Classes in com.jnape.palatable.lambda.monad.transformer.builtin that implement MonadReader -
Uses of MonadReader in com.jnape.palatable.lambda.monoid
Subinterfaces of MonadReader in com.jnape.palatable.lambda.monoid -
Uses of MonadReader in com.jnape.palatable.lambda.monoid.builtin
Classes in com.jnape.palatable.lambda.monoid.builtin that implement MonadReaderModifier and TypeClassDescriptionfinal class
AddAll<A,
C extends Collection<A>> TheMonoid
instance formed under mutative concatenation for an arbitraryCollection
.final class
AMonoid
instance formed byBoolean
.final class
Collapse<_1,
_2> final class
Compose<A>
final class
Concat<A>
final class
Endo<A>
final class
The monoid formed under monadic endomorphism.final class
First<A>
final class
AMonoid
instance formed byString
that concats two strings together.final class
Last<A>
final class
LeftAll<L,
R> final class
LeftAny<L,
R> final class
Merge<L,
R> AMonoid
instance formed byEither.merge(com.jnape.palatable.lambda.functions.Fn2<? super L, ? super L, ? extends L>, com.jnape.palatable.lambda.functions.Fn2<? super R, ? super R, ? extends R>, com.jnape.palatable.lambda.adt.Either<L, R>...)
, a semigroup overL
, and a monoid overR
.final class
AMonoid
instance formed by mergingHMaps
using the chosenTypeSafeKey
->Semigroup
mappings
, defaulting toLast
in case noSemigroup
has been chosen for a givenTypeSafeKey
.final class
MergeMaps<K,
V> final class
AMonoid
instance formed byBoolean
.final class
Present<A>
final class
final class
RightAll<L,
R> final class
RightAny<L,
R> final class
RunAll<A>
final class
final class
Union<A>
final class
Logical exclusive-or. -
Uses of MonadReader in com.jnape.palatable.lambda.optics.functions
Classes in com.jnape.palatable.lambda.optics.functions that implement MonadReaderModifier and TypeClassDescriptionfinal class
Matching<S,
T, A, B> final class
Over<S,
T, A, B> Given anOptic
, a function fromA
toB
, and a "larger" valueS
, produce aT
by retrieving theA
from theS
, applying the function, and updating theS
with theB
resulting from the function.final class
Pre<P extends Profunctor<?,
?, ? extends P>, S, T, A, B> final class
Re<S,
T, A, B> Turn anOptic
with a unary mapping that can be used for setting (e.g.final class
Set<S,
T, A, B> final class
Under<S,
T, A, B> final class
View<S,
T, A, B> -
Uses of MonadReader in com.jnape.palatable.lambda.semigroup
Subinterfaces of MonadReader in com.jnape.palatable.lambda.semigroupModifier and TypeInterfaceDescriptioninterface
Semigroup<A>
ASemigroup
is a closed, associative category. -
Uses of MonadReader in com.jnape.palatable.lambda.semigroup.builtin
Classes in com.jnape.palatable.lambda.semigroup.builtin that implement MonadReaderModifier and TypeClassDescriptionfinal class
Absent<A>
final class
Collapse<_1,
_2> final class
Compose<A>
final class
Intersection<A>
final class
LeftAll<L,
R> final class
LeftAny<L,
R> final class
Max<A extends Comparable<A>>
ASemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly less thany
, returny
Otherwise, returnx
final class
MaxBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
, produce aSemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly less thany
in terms ofB
, returny
Otherwise, returnx
final class
MaxWith<A>
Given a comparator for some typeA
, produce aSemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly less thany
in terms ofB
, returny
Otherwise, returnx
final class
Merge<L,
R> final class
Min<A extends Comparable<A>>
ASemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly greater thany
, returny
Otherwise, returnx
final class
MinBy<A,
B extends Comparable<B>> Given a mapping function from some typeA
to someComparable
typeB
, produce aSemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly greater thany
in terms ofB
, returny
Otherwise, returnx
final class
MinWith<A>
Given a comparator for some typeA
, produce aSemigroup
overA
that chooses between two valuesx
andy
via the following rules: Ifx
is strictly greater thany
in terms ofB
, returny
Otherwise, returnx
final class
RightAll<L,
R> final class
RightAny<L,
R> final class
RunAll<A>
traversing
into anIO
and running it