Uses of Interface
com.jnape.palatable.lambda.monad.MonadRec

Packages that use MonadRec

Package	Description
com.jnape.palatable.lambda.adt
com.jnape.palatable.lambda.adt.choice
com.jnape.palatable.lambda.adt.hlist
com.jnape.palatable.lambda.adt.hmap
com.jnape.palatable.lambda.functions
com.jnape.palatable.lambda.functions.builtin.fn1
com.jnape.palatable.lambda.functions.builtin.fn2
com.jnape.palatable.lambda.functions.builtin.fn3
com.jnape.palatable.lambda.functions.builtin.fn4
com.jnape.palatable.lambda.functions.builtin.fn5
com.jnape.palatable.lambda.functions.builtin.fn6
com.jnape.palatable.lambda.functions.builtin.fn7
com.jnape.palatable.lambda.functions.builtin.fn8
com.jnape.palatable.lambda.functions.recursion
com.jnape.palatable.lambda.functions.specialized
com.jnape.palatable.lambda.functor.builtin
com.jnape.palatable.lambda.io
com.jnape.palatable.lambda.monad
com.jnape.palatable.lambda.monad.transformer
com.jnape.palatable.lambda.monad.transformer.builtin
com.jnape.palatable.lambda.monoid
com.jnape.palatable.lambda.monoid.builtin
com.jnape.palatable.lambda.optics
com.jnape.palatable.lambda.optics.functions
com.jnape.palatable.lambda.semigroup
com.jnape.palatable.lambda.semigroup.builtin
com.jnape.palatable.lambda.traversable

Uses of MonadRec in com.jnape.palatable.lambda.adt

Classes in com.jnape.palatable.lambda.adt that implement MonadRec

Modifier and Type	Class	Description
class	Either<L,R>	The binary tagged union, implemented as a specialized CoProduct2.
private static final class	Either.Left<L,R>
private static final class	Either.Right<L,R>
class	Maybe<A>	The optional type, representing a potentially absent value.
private static final class	Maybe.Just<A>
private static final class	Maybe.Nothing<A>
class	These<A,B>	The coproduct of a coproduct (CoProduct2<A, B>) and its product (Tuple2<A, B>), represented as a CoProduct3<A, B, Tuple2<A, B>>.
private static final class	These._A<A,B>
private static final class	These._B<A,B>
private static final class	These.Both<A,B>
class	Try<A>	A Monad of the evaluation outcome of an expression that might throw.
private static final class	Try.Failure<A>
private static final class	Try.Success<A>

Method parameters in com.jnape.palatable.lambda.adt with type arguments of type MonadRec

Modifier and Type	Method	Description
<B> Either<L,B>	Either.trampolineM(Fn1<? super R, ? extends MonadRec<RecursiveResult<R,B>, Either<L,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> Maybe<B>	Maybe.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, Maybe<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<C> These<A,C>	These.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, These<A,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> Try<B>	Try.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, Try<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.adt.choice

Classes in com.jnape.palatable.lambda.adt.choice that implement MonadRec

Modifier and Type	Class	Description
class	Choice2<A,B>	Canonical ADT representation of CoProduct2.
private static final class	Choice2._A<A,B>
private static final class	Choice2._B<A,B>
class	Choice3<A,B,C>	Canonical ADT representation of CoProduct3.
private static final class	Choice3._A<A,B,C>
private static final class	Choice3._B<A,B,C>
private static final class	Choice3._C<A,B,C>
class	Choice4<A,B,C,D>	Canonical ADT representation of CoProduct4.
private static final class	Choice4._A<A,B,C,D>
private static final class	Choice4._B<A,B,C,D>
private static final class	Choice4._C<A,B,C,D>
private static final class	Choice4._D<A,B,C,D>
class	Choice5<A,B,C,D,E>	Canonical ADT representation of CoProduct5.
private static final class	Choice5._A<A,B,C,D,E>
private static final class	Choice5._B<A,B,C,D,E>
private static final class	Choice5._C<A,B,C,D,E>
private static final class	Choice5._D<A,B,C,D,E>
private static final class	Choice5._E<A,B,C,D,E>
class	Choice6<A,B,C,D,E,F>	Canonical ADT representation of CoProduct6.
private static final class	Choice6._A<A,B,C,D,E,F>
private static final class	Choice6._B<A,B,C,D,E,F>
private static final class	Choice6._C<A,B,C,D,E,F>
private static final class	Choice6._D<A,B,C,D,E,F>
private static final class	Choice6._E<A,B,C,D,E,F>
private static final class	Choice6._F<A,B,C,D,E,F>
class	Choice7<A,B,C,D,E,F,G>	Canonical ADT representation of CoProduct7.
private static final class	Choice7._A<A,B,C,D,E,F,G>
private static final class	Choice7._B<A,B,C,D,E,F,G>
private static final class	Choice7._C<A,B,C,D,E,F,G>
private static final class	Choice7._D<A,B,C,D,E,F,G>
private static final class	Choice7._E<A,B,C,D,E,F,G>
private static final class	Choice7._F<A,B,C,D,E,F,G>
private static final class	Choice7._G<A,B,C,D,E,F,G>
class	Choice8<A,B,C,D,E,F,G,H>	Canonical ADT representation of CoProduct8.
private static final class	Choice8._A<A,B,C,D,E,F,G,H>
private static final class	Choice8._B<A,B,C,D,E,F,G,H>
private static final class	Choice8._C<A,B,C,D,E,F,G,H>
private static final class	Choice8._D<A,B,C,D,E,F,G,H>
private static final class	Choice8._E<A,B,C,D,E,F,G,H>
private static final class	Choice8._F<A,B,C,D,E,F,G,H>
private static final class	Choice8._G<A,B,C,D,E,F,G,H>
private static final class	Choice8._H<A,B,C,D,E,F,G,H>

Method parameters in com.jnape.palatable.lambda.adt.choice with type arguments of type MonadRec

Modifier and Type	Method	Description
<C> Choice2<A,C>	Choice2.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, Choice2<A,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<D> Choice3<A,B,D>	Choice3.trampolineM(Fn1<? super C, ? extends MonadRec<RecursiveResult<C,D>, Choice3<A,B,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<E> Choice4<A,B,C,E>	Choice4.trampolineM(Fn1<? super D, ? extends MonadRec<RecursiveResult<D,E>, Choice4<A,B,C,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<F> Choice5<A,B,C,D,F>	Choice5.trampolineM(Fn1<? super E, ? extends MonadRec<RecursiveResult<E,F>, Choice5<A,B,C,D,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<G> Choice6<A,B,C,D,E,G>	Choice6.trampolineM(Fn1<? super F, ? extends MonadRec<RecursiveResult<F,G>, Choice6<A,B,C,D,E,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<H> Choice7<A,B,C,D,E,F,H>	Choice7.trampolineM(Fn1<? super G, ? extends MonadRec<RecursiveResult<G,H>, Choice7<A,B,C,D,E,F,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<I> Choice8<A,B,C,D,E,F,G,I>	Choice8.trampolineM(Fn1<? super H, ? extends MonadRec<RecursiveResult<H,I>, Choice8<A,B,C,D,E,F,G,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.adt.hlist

Classes in com.jnape.palatable.lambda.adt.hlist that implement MonadRec

Modifier and Type	Class	Description
class	SingletonHList<_1>	A singleton HList.
class	Tuple2<_1,_2>	A 2-element tuple product type, implemented as a specialized HList.
class	Tuple3<_1,_2,_3>	A 3-element tuple product type, implemented as a specialized HList.
class	Tuple4<_1,_2,_3,_4>	A 4-element tuple product type, implemented as a specialized HList.
class	Tuple5<_1,_2,_3,_4,_5>	A 5-element tuple product type, implemented as a specialized HList.
class	Tuple6<_1,_2,_3,_4,_5,_6>	A 6-element tuple product type, implemented as a specialized HList.
class	Tuple7<_1,_2,_3,_4,_5,_6,_7>	A 7-element tuple product type, implemented as a specialized HList.
class	Tuple8<_1,_2,_3,_4,_5,_6,_7,_8>	An 8-element tuple product type, implemented as a specialized HList.

Method parameters in com.jnape.palatable.lambda.adt.hlist with type arguments of type MonadRec

Modifier and Type	Method	Description
<_1Prime> SingletonHList<_1Prime>	SingletonHList.trampolineM(Fn1<? super _1, ? extends MonadRec<RecursiveResult<_1,_1Prime>, SingletonHList<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_2Prime> Tuple2<_1,_2Prime>	Tuple2.trampolineM(Fn1<? super _2, ? extends MonadRec<RecursiveResult<_2,_2Prime>, Tuple2<_1,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_3Prime> Tuple3<_1,_2,_3Prime>	Tuple3.trampolineM(Fn1<? super _3, ? extends MonadRec<RecursiveResult<_3,_3Prime>, Tuple3<_1,_2,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_4Prime> Tuple4<_1,_2,_3,_4Prime>	Tuple4.trampolineM(Fn1<? super _4, ? extends MonadRec<RecursiveResult<_4,_4Prime>, Tuple4<_1,_2,_3,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_5Prime> Tuple5<_1,_2,_3,_4,_5Prime>	Tuple5.trampolineM(Fn1<? super _5, ? extends MonadRec<RecursiveResult<_5,_5Prime>, Tuple5<_1,_2,_3,_4,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_6Prime> Tuple6<_1,_2,_3,_4,_5,_6Prime>	Tuple6.trampolineM(Fn1<? super _6, ? extends MonadRec<RecursiveResult<_6,_6Prime>, Tuple6<_1,_2,_3,_4,_5,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_7Prime> Tuple7<_1,_2,_3,_4,_5,_6,_7Prime>	Tuple7.trampolineM(Fn1<? super _7, ? extends MonadRec<RecursiveResult<_7,_7Prime>, Tuple7<_1,_2,_3,_4,_5,_6,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<_8Prime> Tuple8<_1,_2,_3,_4,_5,_6,_7,_8Prime>	Tuple8.trampolineM(Fn1<? super _8, ? extends MonadRec<RecursiveResult<_8,_8Prime>, Tuple8<_1,_2,_3,_4,_5,_6,_7,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.adt.hmap

Subinterfaces of MonadRec in com.jnape.palatable.lambda.adt.hmap

Modifier and Type	Interface	Description
interface	Schema<Values extends HList>	A lens that focuses on the heterogeneous list of values pointed at by one or more typesafe keys that must all exist in the same HMap to be collectively extracted.
interface	TypeSafeKey<A,B>	An interface representing a parametrized key for use in HMaps.
static interface	TypeSafeKey.Simple<A>	A simplified TypeSafeKey that can only view a value of type A as an A.

Uses of MonadRec in com.jnape.palatable.lambda.functions

Subinterfaces of MonadRec in com.jnape.palatable.lambda.functions

Modifier and Type	Interface	Description
interface	Effect<A>	A function returning "no result", and therefore only useful as a side-effect.
interface	Fn0<A>	A function taking "no arguments", implemented as an Fn1<Unit, 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.

Method parameters in com.jnape.palatable.lambda.functions with type arguments of type MonadRec

Modifier and Type	Method	Description
default <C> Fn1<A,C>	Fn1.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, Fn1<A,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn1

Classes in com.jnape.palatable.lambda.functions.builtin.fn1 that implement MonadRec

Modifier and Type	Class	Description
final class	CatMaybes<A>	Given an Iterable<Maybe<A>>, return an Iterable<A> of only the present values.
final class	Coalesce<L,R>	Fold an Iterable<Either<L, R>> into an Either<Iterable<L>, Iterable<R>>, preserving all results of the side that's returned.
final class	Constantly<A,B>	A function that takes two arguments and always returns the first argument.
final class	Cycle<A>	Given an Iterable, return an infinite Iterable that repeatedly cycles its elements, in order.
final class	Distinct<A>	Return an Iterable of the distinct values from the given input Iterable.
final class	Downcast<A extends B, B>	Covariantly cast a value of type B to a value of subtype A.
final class	Empty<A>	A predicate that returns true if as is empty; false otherwise.
final class	Flatten<A>	Given a nested Iterable of Iterables, return a lazily flattening Iterable of the nested elements.
final class	Force<A>	Deprecated. in favor of traversing into an IO and running it
final class	Head<A>	Retrieve the head element of an Iterable, wrapped in an Maybe.
final class	Id<A>	The identity function.
final class	Init<A>	Given an Iterable<A>, produce an Iterable<A> of all elements but the last one.
final class	Inits<A>	Given an Iterable<A>, produce an Iterable<Iterable<A>>, representing all of the subsequences of initial elements, ordered by size, starting with the empty Iterable.
final class	Last<A>	Retrieve the last element of an Iterable, wrapped in a Maybe.
final class	Magnetize<A>	Magnetize an Iterable using value equality as the magnetizing function.
final class	Not<A>	Negate a predicate function.
final class	Occurrences<A>	Given an Iterable<A>, return a Map<A, Long> representing each unique element in the Iterable paired with its number of occurrences.
final class	Repeat<A>	Given a value, return an infinite Iterable that repeatedly iterates that value.
final class	Reverse<A>	Given an Iterable, return a reversed representation of that Iterable.
final class	Size
final class	Sort<A extends Comparable<A>>	Given an Iterable of Comparable elements, return a List of the sorted elements.
final class	Tail<A>	Returns the tail of an Iterable; the is, an Iterable of all the elements except for the head element.
final class	Tails<A>	Given an Iterable<A>, produce an Iterable<Iterable<A>>, representing all of the subsequences of tail elements, ordered by size, starting with the full Iterable.
final class	Uncons<A>	Destructure an Iterable into a Tuple2 of its head and tail, wrapped in an Maybe.
final class	Upcast<A extends B, B>	Upcast a value of type B to a value of type A that B extends.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn2

Classes in com.jnape.palatable.lambda.functions.builtin.fn2 that implement MonadRec

Modifier and Type	Class	Description
final class	$<A,B>	Function application, represented as a higher-order Fn2 that receives an Fn1 and its argument, and applies it.
final class	All<A>	Eagerly apply a predicate to each element in an Iterable, returning true if every element satisfies the predicate, and false otherwise.
final class	Alter<A>	Given an Effect<A> and some A, produce an IO that, when run, performs the effect on A and returns it.
final class	Any<A>	Eagerly apply a predicate to each element in an Iterable, returning true if any element satisfies the predicate, and false otherwise.
final class	AutoBracket<A extends AutoCloseable, B>	Given an IO yielding some AutoCloseable type A and a kleisli arrow from that type to a new IO of type B, attempt to provision the A, applying the body operation if provisioning was successful and ensuring that AutoCloseable.close() is called regardless of whether the body succeeds or fails.
final class	Both<A,B,C>	Given two functions f and g, produce a Fn1<A, Tuple2<B, C>> (the dual application of both functions).
final class	CartesianProduct<A,B>	Lazily compute the cartesian product of an Iterable<A> and Iterable<B>, returning an Iterable<Tuple2<A, B>>, the products as tuples of multiplicand As and multiplier Bs.
final class	CmpEq<A extends Comparable<A>>	Given two Comparable values of type A, return true if the first value is strictly equal to the second value (according to Comparable.compareTo(Object); otherwise, return false.
final class	Cons<A>	Prepend an element to an Iterable.
final class	Difference<A>	Given two Iterables xs and ys, return the distinct elements of xs that are not in ys.
final class	Drop<A>	Lazily skip the first n elements from an Iterable by returning an Iterable that begins iteration after the nth element.
final class	DropWhile<A>	Lazily limit the Iterable by skipping the first contiguous group of elements that satisfy the predicate, beginning iteration at the first element for which the predicate evaluates to false.
final class	Eq<A>	Type-safe equality in function form; uses Object.equals(Object), not ==.
final class	Filter<A>	Lazily apply a predicate to each element in an Iterable, returning an Iterable of just the elements for which the predicate evaluated to true.
final class	Find<A>	Iterate the elements in an Iterable, applying a predicate to each one, returning the first element that matches the predicate, wrapped in a Maybe.
final class	GroupBy<K,V>	Given an Iterable<V> vs and a key function V -> K f, fold vs into a Map<K, List<V>> by applying f to each element of vs, 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 two Comparable values of type A, return true if the second value is strictly greater than the first value; otherwise, return false.
final class	GTE<A extends Comparable<A>>	Given two Comparable values of type A, return true if the second value is greater than or equal to the first value according to Comparable.compareTo(Object); otherwise, return false.
final class	InGroupsOf<A>	Lazily group the Iterable by returning an Iterable of smaller Iterables of size k.
final class	Intersperse<A>	Lazily inject the provided separator value between each value in the supplied Iterable.
final class	Into<A,B,C>	Given an Fn2<A, B, C> and a Map.Entry<A, B>, destructure the entry and apply the key and value as arguments to the function, returning the result.
final class	Into1<A,B>	Given an Fn1<A, B> and a SingletonHList<A>, pop the head and apply it to the function, returning the result.
final class	Into3<A,B,C,D>	Given an Fn3<A, B, C, D> and a Product3<A, B, C>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Into4<A,B,C,D,E>	Given an Fn4<A, B, C, D, E> and a Product4<A, B, C, D>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Into5<A,B,C,D,E,F>	Given an Fn5<A, B, C, D, E, F> and a Product5<A, B, C, D, E>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Into6<A,B,C,D,E,F,G>	Given an Fn6<A, B, C, D, E, F, G> and a Product6<A, B, C, D, E, F>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Into7<A,B,C,D,E,F,G,H>	Given an Fn7<A, B, C, D, E, F, G, H> and a Product7<A, B, C, D, E, F, G>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Into8<A,B,C,D,E,F,G,H,I>	Given an Fn8<A, B, C, D, E, F, G, H, I> and a Product8<A, B, C, D, E, F, G, H>, destructure the product and apply the slots as arguments to the function, returning the result.
final class	Iterate<A>	Lazily generate an infinite Iterable from the successive applications of the function first to the initial seed value, then to the result, and so on; i.e., the result of iterate(x -> x + 1, 0) would produce an infinite Iterable over the elements 0, 1, 2, 3, ...
final class	LazyRec<A,B>	Given a Fn2 that receives a recursive function and an input and yields a lazy result, and an input, produce a lazy result that, when forced, will recursively invoke the function until it terminates in a stack-safe way.
final class	LT<A extends Comparable<A>>	Given two Comparable values of type A, return true if the second value is strictly less than the first value; otherwise, return false.
final class	LTE<A extends Comparable<A>>	Given two Comparable values of type A, return true if the second value is less than or equal to the first value according to Comparable.compareTo(Object) otherwise, return false.
final class	MagnetizeBy<A>	Given a binary predicate and an Iterable<A>, return an Iterable<Iterable<A>> of the contiguous groups of elements that match the predicate pairwise.
final class	Map<A,B>	Lazily apply a function to each element in an Iterable, producing an Iterable of the mapped results.
final class	Partition<A,B,C>	Given an Iterable<A> as and a disjoint mapping function a -> CoProduct2<A, B>, return a Tuple2 over the lazily unwrapped left A and right B values in the first and second slots, respectively.
final class	Peek<A, FA extends Functor<A,?>>	Deprecated. in favor of producing an IO from the given Functor and explicitly running it
final class	Peek2<A, B, FAB extends BoundedBifunctor<A, B, ? super A, ? super B, ?>>	Deprecated. in favor of producing an IO from the given BoundedBifunctor and explicitly running it
final class	PrependAll<A>	Lazily prepend each value with of the Iterable with the supplied separator value.
final class	ReduceLeft<A>	Given an Iterable<A> and a Fn2<A, A, A>, iteratively accumulate over the Iterable, returning Maybe<A>.
final class	ReduceRight<A>	Given an Iterable<A> and a Fn2<A, A, A>, iteratively accumulate over the Iterable, returning Maybe<A>.
final class	Replicate<A>	Produce an Iterable of a value n times.
final class	Sequence<A, App extends Applicative<?,App>, Trav extends Traversable<?,Trav>, TravA extends Traversable<A,Trav>, AppTrav extends Applicative<TravA,App>>	Given a Traversable of Applicatives and a pure Applicative constructor, traverse the elements from left to right, zipping the Applicatives together and collecting the results.
final class	Slide<A>	Given an Iterable<A>, "slide" a window of k elements across the Iterable by one element at a time, returning an Iterable<Iterable<A>>.
final class	Snoc<A>	Opposite of Cons: lazily append an element to the end of the given Iterable.
final class	SortBy<A, B extends Comparable<B>>	Given an Iterable and some mapping function from the Iterable element type to some Comparable type, produce a sorted List of the original elements based on sorting applied to the result of the mapping function.
final class	SortWith<A>	Given an Iterable and a Comparator over the Iterable element type, produce a sorted List of the original elements based on sorting applied by the Comparator.
final class	Span<A>	Given a predicate, return a Tuple2 where the first slot is the front contiguous elements of an Iterable matching the predicate and the second slot is all the remaining elements.
final class	Take<A>	Lazily limit the Iterable to n elements by returning an Iterable that stops iteration after the nth element, or the last element of the Iterable, whichever comes first.
final class	TakeWhile<A>	Lazily limit the Iterable 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 to false.
final class	ToArray<A>	Write all the elements of an Iterable directly into an array of the specified type.
final class	ToCollection<A, C extends Collection<A>>	Given an Fn0 of some Collection C, create an instance of C and add all of the elements in the provided Iterable to the instance.
final class	ToMap<K, V, M extends Map<K,V>>	Given an Fn0 of some Map M, create an instance of M and put all of the entries in the provided Iterable into the instance.
final class	Tupler2<A,B>	Creates a Tuple2 from two values.
final class	Unfoldr<A,B>	Given an initial seed value and a function that takes the seed type and produces an Maybe<Tuple2<X, Seed>>, where the tuple's first slot represents the next Iterable element, and the second slot represents the next input to the unfolding function, unfold an Iterable of Xs.
final class	Until<A>	Given a predicate function for a value of some type A and an IO that yields a value of type A, produce an IO that repeatedly executes the original IO until the predicate returns true when applied to the yielded value.
final class	Zip<A,B>	Zip together two Iterables into a single Iterable of Tuple2<A, B>.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn3

Classes in com.jnape.palatable.lambda.functions.builtin.fn3 that implement MonadRec

Modifier and Type	Class	Description
final 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 an IO that yields some type A, a cleanup operation to run if a value of that type could be provisioned, and a kleisli arrow from that type to a new IO of type B, produce an IO<B> that, when run, will provision the A, flatMap it to B, 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 value
final class	CmpEqBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B and two values of type A, return true if the first value is strictly equal to the second value (according to Comparable.compareTo(Object) in terms of their mapped B results; otherwise, return false.
final class	CmpEqWith<A>	Given a Comparator from some type A and two values of type A, return true if the first value is strictly equal to the second value (according to Comparator.compare(Object, Object) otherwise, return false.
final class	Compare<A>	Given a Comparator from some type A and two values of type A, return a ComparisonRelation of the first value with reference to the second value (according to Comparator.compare(Object, Object).
final class	FoldLeft<A,B>	Given an Iterable of As, a starting value B, and a Fn2<B, A, B>, iteratively accumulate over the Iterable, ultimately returning a final B value.
final class	FoldRight<A,B>	Given an Iterable of As, a starting lazy value B, and a Fn2<A, Lazy<B>, Lazy<B>>, iteratively accumulate over the Iterable, ultimately returning a final Lazy<B> value.
final class	GTBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B and two values of type A, return true if the second value is strictly greater than the first value in terms of their mapped B results; otherwise, return false.
final class	GTEBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B and two values of type A, return true if the second value is greater than or equal to the first value in terms of their mapped B results according to Comparable.compareTo(Object); otherwise, return false.
final class	GTEWith<A>	Given a Comparator from some type A and two values of type A, return true if the second value is greater than or equal to the first value in terms of their mapped B results according to Comparator.compare(Object, Object); otherwise, return false.
final class	GTWith<A>	Given a Comparator from some type A and two values of type A, return true if the second value is strictly greater than the first value in terms of their mapped B results; otherwise, return false.
final class	LiftA2<A, B, C, App extends Applicative<?,App>, AppC extends Applicative<C,App>>	Lift into and apply an Fn2 to two Applicative values, returning the result inside the same Applicative context.
final class	LTBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B and two values of type A, return true if the second value is strictly less than the first value in terms of their mapped B results; otherwise, return false.
final class	LTEBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B and two values of type A, return true if the second value is less than or equal to the first value in terms of their mapped B results according to Comparable.compareTo(Object); otherwise, return false.
final class	LTEWith<A>	Given a Comparator from some type A and two values of type A, return true if the second value is less than or equal to the first value in terms of their mapped B results according to Comparator.compare(Object, Object); otherwise, return false.
final class	LTWith<A>	Given a comparator for some type A and two values of type A, return true if the second value is strictly less than than the first value in terms of their mapped B results; otherwise, return false.
final class	ScanLeft<A,B>	Given an Iterable of As, a starting value B, and a Fn2<B, A, B>, iteratively accumulate over the Iterable, collecting each function application result, finally returning an Iterable of all the results.
final class	Times<A>	Given some number of times n to invoke a function A -> A, and given an input A, iteratively apply the function to the input, and then to the result of the invocation, a total of n times, returning the result.
final class	ZipWith<A,B,C>	Zip together two Iterables by applying a zipping function to the successive elements of each Iterable until one of them runs out of elements.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn4

Classes in com.jnape.palatable.lambda.functions.builtin.fn4 that implement MonadRec

Modifier and Type	Class	Description
final class	IfThenElse<A,B>
final class	LiftA3<A, B, C, D, App extends Applicative<?,App>, AppD extends Applicative<D,App>>	Lift into and apply an Fn3 to three Applicative values, returning the result inside the same Applicative context.
final class	RateLimit<A>	Given an Fn0 of Instants (presumably backed by a clock), a limit, a Duration, and an Iterable as, return an Iterable that iterates as according to the threshold specified by the limit per duration, using the Fn0 to advance time.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn5

Classes in com.jnape.palatable.lambda.functions.builtin.fn5 that implement MonadRec

Modifier and Type	Class	Description
final class	LiftA4<A, B, C, D, E, App extends Applicative<?,App>, AppE extends Applicative<E,App>>	Lift into and apply an Fn4 to four Applicative values, returning the result inside the same Applicative context.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn6

Classes in com.jnape.palatable.lambda.functions.builtin.fn6 that implement MonadRec

Modifier and Type	Class	Description
final class	LiftA5<A, B, C, D, E, F, App extends Applicative<?,App>, AppF extends Applicative<F,App>>	Lift into and apply an Fn5 to five Applicative values, returning the result inside the same Applicative context.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn7

Classes in com.jnape.palatable.lambda.functions.builtin.fn7 that implement MonadRec

Modifier and Type	Class	Description
final class	LiftA6<A, B, C, D, E, F, G, App extends Applicative<?,App>, AppG extends Applicative<G,App>>	Lift into and apply an Fn6 to six Applicative values, returning the result inside the same Applicative context.

Uses of MonadRec in com.jnape.palatable.lambda.functions.builtin.fn8

Classes in com.jnape.palatable.lambda.functions.builtin.fn8 that implement MonadRec

Modifier and Type	Class	Description
final class	LiftA7<A, B, C, D, E, F, G, H, App extends Applicative<?,App>, AppH extends Applicative<H,App>>	Lift into and apply an Fn7 to seven Applicative values, returning the result inside the same Applicative context.

Uses of MonadRec in com.jnape.palatable.lambda.functions.recursion

Classes in com.jnape.palatable.lambda.functions.recursion that implement MonadRec

Modifier and Type	Class	Description
class	RecursiveResult<A,B>	Specialized CoProduct2 representing the possible results of a primitive recursive function.
(package private) static final class	RecursiveResult.Recurse<A,B>
(package private) static final class	RecursiveResult.Terminate<A,B>
final class	Trampoline<A,B>	Given an Fn1<A, CoProduct2<A, B, ?>> (analogous to "recurse" and "return" tail position instructions, respectively), produce a Fn1<A, B> that unrolls the original function by iteratively passing each result that matches the input (A) back to the original function, and then terminating on and returning the first output (B).

Method parameters in com.jnape.palatable.lambda.functions.recursion with type arguments of type MonadRec

Modifier and Type	Method	Description
<C> RecursiveResult<A,C>	RecursiveResult.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, RecursiveResult<A,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.functions.specialized

Subinterfaces of MonadRec in com.jnape.palatable.lambda.functions.specialized

Modifier and Type	Interface	Description
interface	BiMonoidFactory<A,B,C>
interface	BiPredicate<A,B>	A specialized Fn2 that returns a Boolean when fully applied, or a Predicate when partially applied.
interface	BiSemigroupFactory<A,B,C>
interface	Kleisli<A, B, M extends Monad<?,M>, MB extends Monad<B,M>>	The Kleisli arrow of a Monad, manifest as simply an Fn1<A, MB>.
interface	MonoidFactory<A,B>
interface	Predicate<A>	A specialized Fn1 that returns a Boolean.
interface	SemigroupFactory<A,B>

Methods in com.jnape.palatable.lambda.functions.specialized with type parameters of type MonadRec

Modifier and Type	Method	Description
default <A, M extends MonadRec<?,M>, MBA extends MonadBase<M,A,B>> MBA	Lift.apply(MonadRec<A,M> ma)
<A, M extends MonadRec<?,M>> MonadBase<M,A,B>	Lift.checkedApply(MonadRec<A,M> ga)

Methods in com.jnape.palatable.lambda.functions.specialized with parameters of type MonadRec

Modifier and Type	Method	Description
default <A, M extends MonadRec<?,M>, MBA extends MonadBase<M,A,B>> MBA	Lift.apply(MonadRec<A,M> ma)
<A, M extends MonadRec<?,M>> MonadBase<M,A,B>	Lift.checkedApply(MonadRec<A,M> ga)

Uses of MonadRec in com.jnape.palatable.lambda.functor.builtin

Classes in com.jnape.palatable.lambda.functor.builtin that implement MonadRec

Modifier and Type	Class	Description
final class	Const<A,B>	A (surprisingly useful) functor over some phantom type B, retaining a value of type A that can be retrieved later.
final class	Identity<A>	A functor over some value of type A that can be mapped over and retrieved later.
class	Lazy<A>	A Monad representing a lazily-computed value.
private static final class	Lazy.Compose<A>
private static final class	Lazy.Later<A>
final class	Market<A,B,S,T>	A profunctor used to extract the isomorphic functions a Prism is composed of.
final class	State<S,A>	The state Monad, useful for iteratively building up state and state-contextualized result.
final class	Tagged<S,B>	Like Const, but the phantom parameter is in the contravariant position, and the value is in covariant position.
final class	Writer<W,A>	The lazy writer monad, a monad capturing some accumulation (eventually to be folded in terms of a given monoid) and a value.

Method parameters in com.jnape.palatable.lambda.functor.builtin with type arguments of type MonadRec

Modifier and Type	Method	Description
<C> Const<A,C>	Const.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, Const<A,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> Identity<B>	Identity.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, Identity<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> Lazy<B>	Lazy.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, Lazy<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<U> Market<A,B,S,U>	Market.trampolineM(Fn1<? super T, ? extends MonadRec<RecursiveResult<T,U>, Market<A,B,S,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> State<S,B>	State.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, State<S,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<C> Tagged<S,C>	Tagged.trampolineM(Fn1<? super B, ? extends MonadRec<RecursiveResult<B,C>, Tagged<S,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> Writer<W,B>	Writer.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, Writer<W,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.io

Classes in com.jnape.palatable.lambda.io that implement MonadRec

Modifier and Type	Class	Description
class	IO<A>	A Monad representing some side-effecting computation to be performed.
private static final class	IO.Compose<A>

Method parameters in com.jnape.palatable.lambda.io with type arguments of type MonadRec

Modifier and Type	Method	Description
<B> IO<B>	IO.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, IO<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.monad

Classes in com.jnape.palatable.lambda.monad with type parameters of type MonadRec

Modifier and Type	Interface	Description
interface	MonadBase<M extends MonadRec<?,M>, A, MB extends MonadBase<?,?,MB>>	A type into which a MonadRec is embedded whilst internally preserving the MonadRec structure.
interface	MonadRec<A, M extends MonadRec<?,M>>	A class of monads that offer a stack-safe interface for performing arbitrarily many flatmap-like operations via MonadRec.trampolineM(Fn1).
final class	SafeT<M extends MonadRec<?,M>, A>	A stack-safe monad transformer that can safely interpret deeply nested left- or right-associated binds for any MonadRec.
private static class	SafeT.Body<M extends MonadRec<?,M>, A>
private static final class	SafeT.Body.Done<M extends MonadRec<?,M>, A>
private static final class	SafeT.Body.More<M extends MonadRec<?,M>, A>
private static final class	SafeT.Body.Suspended<M extends MonadRec<?,M>, A, B>
private static interface	SafeT.Body.Suspended.Φ<M extends MonadRec<?,M>, B, R>

Classes in com.jnape.palatable.lambda.monad that implement MonadRec

Modifier and Type	Class	Description
final class	SafeT<M extends MonadRec<?,M>, A>	A stack-safe monad transformer that can safely interpret deeply nested left- or right-associated binds for any MonadRec.

Classes in com.jnape.palatable.lambda.monad that implement interfaces with type arguments of type MonadRec

Modifier and Type	Class	Description
private static class	SafeT.Body<M extends MonadRec<?,M>, A>

Fields in com.jnape.palatable.lambda.monad declared as MonadRec

Modifier and Type	Field	Description
private final MonadRec<SafeT.Body<M,A>, M>	SafeT.Body.More.mfa

Methods in com.jnape.palatable.lambda.monad with type parameters of type MonadRec

Modifier and Type	Method	Description
private static <M extends MonadRec<?,M>, A> SafeT.Body<M,A>	SafeT.Body.done(A a)
<C, N extends MonadRec<?,N>> MonadBase<N,C,MB>	MonadBase.lift(MonadRec<C,N> nc)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> SafeT<N,B>	SafeT.lift(MonadRec<B,N> nb)	Lift a new argument MonadRec into this MonadBase.
private static <M extends MonadRec<?,M>, A> SafeT.Body<M,A>	SafeT.Body.more(MonadRec<SafeT.Body<M,A>, M> mb)
static <M extends MonadRec<?,M>> Pure<SafeT<M,?>>	SafeT.pureSafeT(Pure<M> pureM)	The canonical Pure instance for SafeT.
<MA extends MonadRec<A,M>> MA	SafeT.runSafeT()	Recover the full structure of the embedded Monad in a stack-safe way.
static <M extends MonadRec<?,M>, A> SafeT<M,A>	SafeT.safeT(MonadRec<A,M> ma)	Lift any MonadRec<A, M> into a SafeT<M, A>.
private static <M extends MonadRec<?,M>, A, B> SafeT.Body<M,B>	SafeT.Body.suspend(SafeT.Body<M,A> freeA, Fn1<A, SafeT.Body<M,B>> fn)

Methods in com.jnape.palatable.lambda.monad that return MonadRec

Modifier and Type	Method	Description
default <B> MonadRec<B,M>	MonadRec.discardL(Applicative<B,M> appB)	Sequence both this Applicative and appB, discarding this Applicative's result and returning appB.
default <B> MonadRec<A,M>	MonadRec.discardR(Applicative<B,M> appB)	Sequence both this Applicative and appB, discarding appB's result and returning this Applicative.
<B> MonadRec<B,M>	MonadRec.flatMap(Fn1<? super A, ? extends Monad<B,M>> f)	Chain dependent computations that may continue or short-circuit based on previous results.
default <B> MonadRec<B,M>	MonadRec.fmap(Fn1<? super A, ? extends B> fn)	Covariantly transmute this functor's parameter using the given mapping function.
<B> MonadRec<B,M>	MonadRec.pure(B b)	Lift the value b into this applicative functor.
<B> MonadRec<B,M>	MonadRec.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, M>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
default <B> MonadRec<B,M>	MonadRec.zip(Applicative<Fn1<? super A, ? extends B>, M> 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 MonadRec

Modifier and Type	Method	Description
private <Z> Fn1<SafeT.Body.Suspended<M,?,Z>, RecursiveResult<SafeT.Body<M,B>, Either<MonadRec<SafeT.Body<M,B>, M>, B>>>	SafeT.Body.Suspended.associateRight(Fn1<Z, SafeT.Body<M,B>> f)
default <B> Lazy<? extends MonadRec<B,M>>	MonadRec.lazyZip(Lazy<? extends Applicative<Fn1<? super A, ? extends B>, M>> lazyAppFn)	Given a lazy instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.
Either<MonadRec<SafeT.Body<M,A>, M>, A>	SafeT.Body.Done.resume()
Either<MonadRec<SafeT.Body<M,A>, M>, A>	SafeT.Body.More.resume()
abstract Either<MonadRec<SafeT.Body<M,A>, M>, A>	SafeT.Body.resume()
Either<MonadRec<SafeT.Body<M,B>, M>, B>	SafeT.Body.Suspended.resume()

Methods in com.jnape.palatable.lambda.monad with parameters of type MonadRec

Modifier and Type	Method	Description
<C, N extends MonadRec<?,N>> MonadBase<N,C,MB>	MonadBase.lift(MonadRec<C,N> nc)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> SafeT<N,B>	SafeT.lift(MonadRec<B,N> nb)	Lift a new argument MonadRec into this MonadBase.
private static <M extends MonadRec<?,M>, A> SafeT.Body<M,A>	SafeT.Body.more(MonadRec<SafeT.Body<M,A>, M> mb)
static <M extends MonadRec<?,M>, A> SafeT<M,A>	SafeT.safeT(MonadRec<A,M> ma)	Lift any MonadRec<A, M> into a SafeT<M, A>.

Method parameters in com.jnape.palatable.lambda.monad with type arguments of type MonadRec

Modifier and Type	Method	Description
<R> R	SafeT.Body.Done.match(Fn1<? super Either<MonadRec<SafeT.Body<M,A>, M>, A>, ? extends R> aFn, Fn1<? super SafeT.Body.Suspended<M,?,A>, ? extends R> bFn)
<R> R	SafeT.Body.More.match(Fn1<? super Either<MonadRec<SafeT.Body<M,A>, M>, A>, ? extends R> aFn, Fn1<? super SafeT.Body.Suspended<M,?,A>, ? extends R> bFn)
<R> R	SafeT.Body.Suspended.match(Fn1<? super Either<MonadRec<SafeT.Body<M,B>, M>, B>, ? extends R> aFn, Fn1<? super SafeT.Body.Suspended<M,?,B>, ? extends R> bFn)
<B> MonadRec<B,M>	MonadRec.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, M>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> SafeT<M,B>	SafeT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, SafeT<M,?>>> bounce)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Constructors in com.jnape.palatable.lambda.monad with parameters of type MonadRec

Modifier	Constructor	Description
private	More(MonadRec<SafeT.Body<M,A>, M> mfa)

Uses of MonadRec in com.jnape.palatable.lambda.monad.transformer

Classes in com.jnape.palatable.lambda.monad.transformer with type parameters of type MonadRec

Modifier and Type	Interface	Description
interface	MonadT<M extends MonadRec<?,M>, A, MT extends MonadT<M,?,MT,T>, T extends MonadT<?,?,?,T>>	The generic type representing a Monad transformer, exposing the argument Monad as a type parameter.

Subinterfaces of MonadRec in com.jnape.palatable.lambda.monad.transformer

Modifier and Type	Interface	Description
interface	MonadT<M extends MonadRec<?,M>, A, MT extends MonadT<M,?,MT,T>, T extends MonadT<?,?,?,T>>	The generic type representing a Monad transformer, exposing the argument Monad as a type parameter.

Methods in com.jnape.palatable.lambda.monad.transformer with type parameters of type MonadRec

Modifier and Type	Method	Description
<B, N extends MonadRec<?,N>> MonadT<N,B,?,T>	MonadT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.

Methods in com.jnape.palatable.lambda.monad.transformer with parameters of type MonadRec

Modifier and Type	Method	Description
<B, N extends MonadRec<?,N>> MonadT<N,B,?,T>	MonadT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.

Uses of MonadRec in com.jnape.palatable.lambda.monad.transformer.builtin

Classes in com.jnape.palatable.lambda.monad.transformer.builtin with type parameters of type MonadRec

Modifier and Type	Class	Description
final class	EitherT<M extends MonadRec<?,M>, L, R>	A monad transformer for Either.
final class	IdentityT<M extends MonadRec<?,M>, A>	A monad transformer for Identity.
class	IterateT<M extends MonadRec<?,M>, A>	A monad transformer over a co-inductive, singly-linked spine of values embedded in effects.
final class	LazyT<M extends MonadRec<?,M>, A>	A monad transformer for Lazy.
final class	MaybeT<M extends MonadRec<?,M>, A>	A monad transformer for Maybe.
final class	ReaderT<R, M extends MonadRec<?,M>, A>	A monad transformer for any function from some type R to some monadic embedding MonadRec<A, M>.
final class	StateT<S, M extends MonadRec<?,M>, A>	The State monad transformer.
final class	WriterT<W, M extends MonadRec<?,M>, A>	A monad transformer for Writer.

Classes in com.jnape.palatable.lambda.monad.transformer.builtin that implement MonadRec

Modifier and Type	Class	Description
final class	EitherT<M extends MonadRec<?,M>, L, R>	A monad transformer for Either.
final class	IdentityT<M extends MonadRec<?,M>, A>	A monad transformer for Identity.
class	IterateT<M extends MonadRec<?,M>, A>	A monad transformer over a co-inductive, singly-linked spine of values embedded in effects.
final class	LazyT<M extends MonadRec<?,M>, A>	A monad transformer for Lazy.
final class	MaybeT<M extends MonadRec<?,M>, A>	A monad transformer for Maybe.
final class	ReaderT<R, M extends MonadRec<?,M>, A>	A monad transformer for any function from some type R to some monadic embedding MonadRec<A, M>.
final class	StateT<S, M extends MonadRec<?,M>, A>	The State monad transformer.
final class	WriterT<W, M extends MonadRec<?,M>, A>	A monad transformer for Writer.

Fields in com.jnape.palatable.lambda.monad.transformer.builtin declared as MonadRec

Modifier and Type	Field	Description
private final MonadRec<Either<L,R>, M>	EitherT.melr
private final MonadRec<Identity<A>, M>	IdentityT.mia
private final MonadRec<Lazy<A>,M>	LazyT.mla
private final MonadRec<Maybe<A>,M>	MaybeT.mma

Fields in com.jnape.palatable.lambda.monad.transformer.builtin with type parameters of type MonadRec

Modifier and Type	Field	Description
private final Fn1<? super R, ? extends MonadRec<A,M>>	ReaderT.f
private final ImmutableQueue<Choice2<Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>>, MonadRec<A,M>>>	IterateT.spine
private final ImmutableQueue<Choice2<Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>>, MonadRec<A,M>>>	IterateT.spine
private final Fn1<? super S, ? extends MonadRec<Tuple2<A,S>, M>>	StateT.stateFn
private final Fn1<? super Monoid<W>, ? extends MonadRec<Tuple2<A,W>, M>>	WriterT.writerFn

Methods in com.jnape.palatable.lambda.monad.transformer.builtin with type parameters of type MonadRec

Modifier and Type	Method	Description
static <R, M extends MonadRec<?,M>> ReaderT<R,M,R>	ReaderT.ask(Pure<M> pureM)	Given a Pure ask will give you access to the input within the monadic embedding
static <M extends MonadRec<?,M>, L, R> EitherT<M,L,R>	EitherT.eitherT(MonadRec<Either<L,R>, M> melr)	Static factory method for lifting a Monad<Either<L, R>, M> into an EitherT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.empty(Pure<M> pureM)	Static factory method for creating an empty IterateT.
<MA extends MonadRec<A,M>> MA	WriterT.evalWriterT(Monoid<W> monoid)	Given a Monoid for the accumulation, run the computation represented by this WriterT inside the monadic effect, ignoring the resulting accumulation, yielding the value in isolation.
<MW extends MonadRec<W,M>> MW	WriterT.execWriterT(Monoid<W> monoid)	Given a Monoid for the accumulation, run the computation represented by this WriterT inside the monadic effect, ignoring the value, yielding the accumulation in isolation.
<B, MB extends MonadRec<B,M>> MB	IterateT.fold(Fn2<? super B, ? super A, ? extends MonadRec<B,M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT by trampolining the underlying effects (for iterative folding, use trampolineM directly).
<B, MB extends MonadRec<B,M>> MB	IterateT.foldCut(Fn2<? super B, ? super A, ? extends MonadRec<RecursiveResult<B,B>, M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT (with the possibility of early termination) by trampolining the underlying effects (for iterative folding, use trampolineM directly).
<MU extends MonadRec<Unit,M>> MU	IterateT.forEach(Fn1<? super A, ? extends MonadRec<Unit,M>> fn)	Convenience method for folding the spine of this IterateT with an action to perform on each element without accumulating any results.
static <A, M extends MonadRec<?,M>> StateT<A,M,A>	StateT.get(Pure<M> pureM)	Given a pure construction of some Monad, produce a StateT that equates its output with its state.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.gets(Fn1<? super S, ? extends MonadRec<A,M>> fn)	Given a function that produces a value inside a monadic effect from a state, produce a StateT that simply passes its state to the function and applies it.
static <M extends MonadRec<?,M>, A> IdentityT<M,A>	IdentityT.identityT(MonadRec<Identity<A>, M> mia)	Static factory method for lifting a Monad<Identity<A>, M> into a IdentityT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.iterateT(MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M> unwrapped)	Static factory method for wrapping an uncons of an IterateT in an IterateT.
static <M extends MonadRec<?,M>, A> LazyT<M,A>	LazyT.lazyT(MonadRec<Lazy<A>,M> mla)	Static factory method for lifting a Monad<Lazy<A>, M> into a LazyT.
<R2, N extends MonadRec<?,N>> EitherT<N,L,R2>	EitherT.lift(MonadRec<R2,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> IdentityT<N,B>	IdentityT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> IterateT<N,B>	IterateT.lift(MonadRec<B,N> nb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> LazyT<N,B>	LazyT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> MaybeT<N,B>	MaybeT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> ReaderT<R,N,B>	ReaderT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> StateT<S,N,B>	StateT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> WriterT<W,N,B>	WriterT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
static <W, M extends MonadRec<?,M>, A> WriterT<W,M,A>	WriterT.listen(MonadRec<A,M> ma)	Lift a value embedded in a Monad into a WriterT.
<MA extends MonadRec<A,M>, N extends MonadRec<?,N>, B> ReaderT<R,N,B>	ReaderT.mapReaderT(Fn1<? super MA, ? extends MonadRec<B,N>> fn)	Map the current monadic embedding to a new one in a potentially different Monad.
<MA extends MonadRec<A,M>, N extends MonadRec<?,N>, B> ReaderT<R,N,B>	ReaderT.mapReaderT(Fn1<? super MA, ? extends MonadRec<B,N>> fn)	Map the current monadic embedding to a new one in a potentially different Monad.
<N extends MonadRec<?,N>, B> StateT<S,N,B>	StateT.mapStateT(Fn1<? super MonadRec<Tuple2<A,S>, M>, ? extends MonadRec<Tuple2<B,S>, N>> fn)	Map both the result and the final state to a new result and final state inside the Monad.
static <M extends MonadRec<?,M>, A> MaybeT<M,A>	MaybeT.maybeT(MonadRec<Maybe<A>,M> mma)	Static factory method for lifting a Monad<Maybe<A>, M> into a MaybeT.
static <S, M extends MonadRec<?,M>> StateT<S,M,Unit>	StateT.modify(Fn1<? super S, ? extends MonadRec<S,M>> updateFn)	Lift a function that makes a stateful modification inside an Monad into StateT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.of(MonadRec<A,M> ma, MonadRec<A,M>... mas)	Static factory method for creating an IterateT from a spine represented by one or more elements.
static <M extends MonadRec<?,M>, L> Pure<EitherT<M,L,?>>	EitherT.pureEitherT(Pure<M> pureM)	The canonical Pure instance for EitherT.
static <M extends MonadRec<?,M>> Pure<IdentityT<M,?>>	IdentityT.pureIdentityT(Pure<M> pureM)	The canonical Pure instance for IdentityT.
static <M extends MonadRec<?,M>> Pure<IterateT<M,?>>	IterateT.pureIterateT(Pure<M> pureM)	The canonical Pure instance for IterateT.
static <M extends MonadRec<?,M>> Pure<LazyT<M,?>>	LazyT.pureLazyT(Pure<M> pureM)	The canonical Pure instance for LazyT.
static <M extends MonadRec<?,M>> Pure<MaybeT<M,?>>	MaybeT.pureMaybeT(Pure<M> pureM)	The canonical Pure instance for MaybeT.
static <R, M extends MonadRec<?,M>> Pure<ReaderT<R,M,?>>	ReaderT.pureReaderT(Pure<M> pureM)	The canonical Pure instance for ReaderT.
static <S, M extends MonadRec<?,M>> Pure<StateT<S,M,?>>	StateT.pureStateT(Pure<M> pureM)	The canonical Pure instance for StateT.
static <W, M extends MonadRec<?,M>> Pure<WriterT<W,M,?>>	WriterT.pureWriterT(Pure<M> pureM)	The canonical Pure instance for WriterT.
static <S, M extends MonadRec<?,M>> StateT<S,M,Unit>	StateT.put(MonadRec<S,M> ms)	Lift a monadic state into StateT.
static <R, M extends MonadRec<?,M>, A> ReaderT<R,M,A>	ReaderT.readerT(Fn1<? super R, ? extends MonadRec<A,M>> fn)	Lift a function (R -> Monad<A, M>) into a ReaderT instance.
<MELR extends MonadRec<Either<L,R>, M>> MELR	EitherT.runEitherT()	Recover the full structure of the embedded Monad.
<MIA extends MonadRec<Identity<A>, M>> MIA	IdentityT.runIdentityT()	Recover the full structure of the embedded Monad.
<MMTA extends MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>> MMTA	IterateT.runIterateT()	Recover the full structure of the embedded Monad.
<MLA extends MonadRec<Lazy<A>,M>> MLA	LazyT.runLazyT()	Recover the full structure of the embedded Monad.
<MMA extends MonadRec<Maybe<A>,M>> MMA	MaybeT.runMaybeT()	Recover the full structure of the embedded Monad.
<MA extends MonadRec<A,M>> MA	ReaderT.runReaderT(R r)	Run the computation represented by this ReaderT.
<MAS extends MonadRec<Tuple2<A,S>, M>> MAS	StateT.runStateT(S s)	Run the stateful computation embedded in the Monad, returning a Tuple2 of the result and the final state.
<MStep extends MonadRec<Maybe<Tuple2<Maybe<A>, IterateT<M,A>>>, M>> MStep	IterateT.runStep()	Run a single step of this IterateT, where a step is the smallest amount of work that could possibly be productive in advancing through the IterateT.
<MAW extends MonadRec<Tuple2<A,W>, M>> MAW	WriterT.runWriterT(Monoid<W> monoid)	Given a Monoid for the accumulation, run the computation represented by this WriterT inside the monadic effect, accumulate the written output in terms of the Monoid, and produce the accumulation and the result inside the Monad.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.singleton(MonadRec<A,M> ma)	Static factory method for creating an IterateT from a single element.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.stateT(Fn1<? super S, ? extends MonadRec<Tuple2<A,S>, M>> stateFn)	Lift a state-sensitive monadically embedded computation into StateT.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.stateT(MonadRec<A,M> ma)	Lift a monadic value into StateT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.suspended(Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>> thunk, Pure<M> pureM)	Create an IterateT from a suspended computation that yields the spine of the IterateT inside the effect.
static <W, M extends MonadRec<?,M>> WriterT<W,M,Unit>	WriterT.tell(MonadRec<W,M> mw)	Lift an accumulation embedded in a Monad into a WriterT.
<C extends Collection<A>, MAS extends MonadRec<C,M>> MAS	IterateT.toCollection(Fn0<C> cFn0)	Force the underlying spine of this IterateT into a Collection of type C inside the context of the monadic effect, using the provided cFn0 to construct the initial instance.
static <M extends MonadRec<?,M>, A, B> IterateT<M,A>	IterateT.unfold(Fn1<? super B, ? extends MonadRec<Maybe<Tuple2<A,B>>, M>> fn, MonadRec<B,M> mb)	Lazily unfold an IterateT from an unfolding function fn and a starting seed value mb by successively applying fn to the latest seed value, producing maybe a value to yield out and the next seed value for the subsequent computation.
static <W, M extends MonadRec<?,M>, A> WriterT<W,M,A>	WriterT.writerT(MonadRec<Tuple2<A,W>, M> maw)	Lift a value and an accumulation embedded in a Monad into a WriterT.

Methods in com.jnape.palatable.lambda.monad.transformer.builtin with parameters of type MonadRec

Modifier and Type	Method	Description
final IterateT<M,A>	IterateT.cons(MonadRec<A,M> head)	Add an element inside an effect to the front of this IterateT.
static <M extends MonadRec<?,M>, L, R> EitherT<M,L,R>	EitherT.eitherT(MonadRec<Either<L,R>, M> melr)	Static factory method for lifting a Monad<Either<L, R>, M> into an EitherT.
<B, MB extends MonadRec<B,M>> MB	IterateT.fold(Fn2<? super B, ? super A, ? extends MonadRec<B,M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT by trampolining the underlying effects (for iterative folding, use trampolineM directly).
<B, MB extends MonadRec<B,M>> MB	IterateT.foldCut(Fn2<? super B, ? super A, ? extends MonadRec<RecursiveResult<B,B>, M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT (with the possibility of early termination) by trampolining the underlying effects (for iterative folding, use trampolineM directly).
static <M extends MonadRec<?,M>, A> IdentityT<M,A>	IdentityT.identityT(MonadRec<Identity<A>, M> mia)	Static factory method for lifting a Monad<Identity<A>, M> into a IdentityT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.iterateT(MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M> unwrapped)	Static factory method for wrapping an uncons of an IterateT in an IterateT.
static <M extends MonadRec<?,M>, A> LazyT<M,A>	LazyT.lazyT(MonadRec<Lazy<A>,M> mla)	Static factory method for lifting a Monad<Lazy<A>, M> into a LazyT.
<R2, N extends MonadRec<?,N>> EitherT<N,L,R2>	EitherT.lift(MonadRec<R2,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> IdentityT<N,B>	IdentityT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> IterateT<N,B>	IterateT.lift(MonadRec<B,N> nb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> LazyT<N,B>	LazyT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> MaybeT<N,B>	MaybeT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> ReaderT<R,N,B>	ReaderT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> StateT<S,N,B>	StateT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
<B, N extends MonadRec<?,N>> WriterT<W,N,B>	WriterT.lift(MonadRec<B,N> mb)	Lift a new argument MonadRec into this MonadBase.
static <W, M extends MonadRec<?,M>, A> WriterT<W,M,A>	WriterT.listen(MonadRec<A,M> ma)	Lift a value embedded in a Monad into a WriterT.
static <M extends MonadRec<?,M>, A> MaybeT<M,A>	MaybeT.maybeT(MonadRec<Maybe<A>,M> mma)	Static factory method for lifting a Monad<Maybe<A>, M> into a MaybeT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.of(MonadRec<A,M> ma, MonadRec<A,M>... mas)	Static factory method for creating an IterateT from a spine represented by one or more elements.
static <S, M extends MonadRec<?,M>> StateT<S,M,Unit>	StateT.put(MonadRec<S,M> ms)	Lift a monadic state into StateT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.singleton(MonadRec<A,M> ma)	Static factory method for creating an IterateT from a single element.
final IterateT<M,A>	IterateT.snoc(MonadRec<A,M> last)	Add an element inside an effect to the back of this IterateT.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.stateT(MonadRec<A,M> ma)	Lift a monadic value into StateT.
static <W, M extends MonadRec<?,M>> WriterT<W,M,Unit>	WriterT.tell(MonadRec<W,M> mw)	Lift an accumulation embedded in a Monad into a WriterT.
static <M extends MonadRec<?,M>, A, B> IterateT<M,A>	IterateT.unfold(Fn1<? super B, ? extends MonadRec<Maybe<Tuple2<A,B>>, M>> fn, MonadRec<B,M> mb)	Lazily unfold an IterateT from an unfolding function fn and a starting seed value mb by successively applying fn to the latest seed value, producing maybe a value to yield out and the next seed value for the subsequent computation.
static <W, M extends MonadRec<?,M>, A> WriterT<W,M,A>	WriterT.writerT(MonadRec<Tuple2<A,W>, M> maw)	Lift a value and an accumulation embedded in a Monad into a WriterT.

Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type MonadRec

Modifier and Type	Method	Description
<B, MB extends MonadRec<B,M>> MB	IterateT.fold(Fn2<? super B, ? super A, ? extends MonadRec<B,M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT by trampolining the underlying effects (for iterative folding, use trampolineM directly).
<B, MB extends MonadRec<B,M>> MB	IterateT.foldCut(Fn2<? super B, ? super A, ? extends MonadRec<RecursiveResult<B,B>, M>> fn, MonadRec<B,M> acc)	Monolithically fold the spine of this IterateT (with the possibility of early termination) by trampolining the underlying effects (for iterative folding, use trampolineM directly).
<MU extends MonadRec<Unit,M>> MU	IterateT.forEach(Fn1<? super A, ? extends MonadRec<Unit,M>> fn)	Convenience method for folding the spine of this IterateT with an action to perform on each element without accumulating any results.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.gets(Fn1<? super S, ? extends MonadRec<A,M>> fn)	Given a function that produces a value inside a monadic effect from a state, produce a StateT that simply passes its state to the function and applies it.
<MA extends MonadRec<A,M>, N extends MonadRec<?,N>, B> ReaderT<R,N,B>	ReaderT.mapReaderT(Fn1<? super MA, ? extends MonadRec<B,N>> fn)	Map the current monadic embedding to a new one in a potentially different Monad.
<N extends MonadRec<?,N>, B> StateT<S,N,B>	StateT.mapStateT(Fn1<? super MonadRec<Tuple2<A,S>, M>, ? extends MonadRec<Tuple2<B,S>, N>> fn)	Map both the result and the final state to a new result and final state inside the Monad.
<N extends MonadRec<?,N>, B> StateT<S,N,B>	StateT.mapStateT(Fn1<? super MonadRec<Tuple2<A,S>, M>, ? extends MonadRec<Tuple2<B,S>, N>> fn)	Map both the result and the final state to a new result and final state inside the Monad.
static <S, M extends MonadRec<?,M>> StateT<S,M,Unit>	StateT.modify(Fn1<? super S, ? extends MonadRec<S,M>> updateFn)	Lift a function that makes a stateful modification inside an Monad into StateT.
static <R, M extends MonadRec<?,M>, A> ReaderT<R,M,A>	ReaderT.readerT(Fn1<? super R, ? extends MonadRec<A,M>> fn)	Lift a function (R -> Monad<A, M>) into a ReaderT instance.
static <S, M extends MonadRec<?,M>, A> StateT<S,M,A>	StateT.stateT(Fn1<? super S, ? extends MonadRec<Tuple2<A,S>, M>> stateFn)	Lift a state-sensitive monadically embedded computation into StateT.
static <M extends MonadRec<?,M>, A> IterateT<M,A>	IterateT.suspended(Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>> thunk, Pure<M> pureM)	Create an IterateT from a suspended computation that yields the spine of the IterateT inside the effect.
<R2> EitherT<M,L,R2>	EitherT.trampolineM(Fn1<? super R, ? extends MonadRec<RecursiveResult<R,R2>, EitherT<M,L,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> IdentityT<M,B>	IdentityT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, IdentityT<M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> IterateT<M,B>	IterateT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, IterateT<M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> LazyT<M,B>	LazyT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, LazyT<M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> MaybeT<M,B>	MaybeT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, MaybeT<M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> ReaderT<R,M,B>	ReaderT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, ReaderT<R,M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> StateT<S,M,B>	StateT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, StateT<S,M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
<B> WriterT<W,M,B>	WriterT.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, WriterT<W,M,?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
static <M extends MonadRec<?,M>, A, B> IterateT<M,A>	IterateT.unfold(Fn1<? super B, ? extends MonadRec<Maybe<Tuple2<A,B>>, M>> fn, MonadRec<B,M> mb)	Lazily unfold an IterateT from an unfolding function fn and a starting seed value mb by successively applying fn to the latest seed value, producing maybe a value to yield out and the next seed value for the subsequent computation.
StateT<S,M,A>	StateT.withStateT(Fn1<? super S, ? extends MonadRec<S,M>> fn)	Map the final state to a new final state inside the same monadic effect using the provided function.

Constructors in com.jnape.palatable.lambda.monad.transformer.builtin with parameters of type MonadRec

Modifier	Constructor	Description
private	EitherT(MonadRec<Either<L,R>, M> melr)
private	IdentityT(MonadRec<Identity<A>, M> mia)
private	LazyT(MonadRec<Lazy<A>,M> mla)
private	MaybeT(MonadRec<Maybe<A>,M> mma)

Constructor parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type MonadRec

Modifier	Constructor	Description
private	IterateT(Pure<M> pureM, ImmutableQueue<Choice2<Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>>, MonadRec<A,M>>> spine)
private	IterateT(Pure<M> pureM, ImmutableQueue<Choice2<Fn0<MonadRec<Maybe<Tuple2<A, IterateT<M,A>>>, M>>, MonadRec<A,M>>> spine)
private	ReaderT(Fn1<? super R, ? extends MonadRec<A,M>> f)
private	StateT(Fn1<? super S, ? extends MonadRec<Tuple2<A,S>, M>> stateFn)
private	WriterT(Pure<M> pureM, Fn1<? super Monoid<W>, ? extends MonadRec<Tuple2<A,W>, M>> writerFn)

Uses of MonadRec in com.jnape.palatable.lambda.monoid

Subinterfaces of MonadRec in com.jnape.palatable.lambda.monoid

Modifier and Type	Interface	Description
interface	Monoid<A>	A Monoid is the pairing of a Semigroup with an identity element.

Uses of MonadRec in com.jnape.palatable.lambda.monoid.builtin

Classes in com.jnape.palatable.lambda.monoid.builtin with type parameters of type MonadRec

Modifier and Type	Class	Description
final class	EndoK<M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>>	The monoid formed under monadic endomorphism.
final class	EndoK<M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>>	The monoid formed under monadic endomorphism.

Classes in com.jnape.palatable.lambda.monoid.builtin that implement MonadRec

Modifier and Type	Class	Description
final class	AddAll<A, C extends Collection<A>>	The Monoid instance formed under mutative concatenation for an arbitrary Collection.
final class	And	A Monoid instance formed by Boolean.
final class	Collapse<_1,_2>	A Monoid instance formed by a Tuple2<_1, _2> and monoids over _1 and _2.
final class	Compose<A>	A Monoid instance formed by CompletableFuture<A> and a monoid over A.
final class	Concat<A>	The Monoid instance formed under concatenation for an arbitrary Iterable.
final class	Endo<A>	A Monoid formed by Fn1 under composition.
final class	EndoK<M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>>	The monoid formed under monadic endomorphism.
final class	First<A>	A Monoid instance formed by Maybe<A>.
final class	Join	A Monoid instance formed by String that concats two strings together.
final class	Last<A>	A Monoid instance formed by Maybe<A>.
final class	LeftAll<L,R>	A Monoid instance formed by Either<L,R> and a monoid over L.
final class	LeftAny<L,R>	A Monoid instance formed by Either<L,R> and a monoid over L.
final class	Merge<L,R>	A Monoid instance formed by Either.merge(Fn2, Fn2, Either...), a semigroup over L, and a monoid over R.
final class	MergeHMaps	A Monoid instance formed by merging HMaps using the chosen TypeSafeKey -> Semigroup mappings, defaulting to Last in case no Semigroup has been chosen for a given TypeSafeKey.
final class	MergeMaps<K,V>	A Monoid instance formed by Map.merge(Object, Object, BiFunction) and a semigroup over V.
final class	Or	A Monoid instance formed by Boolean.
final class	Present<A>	A Monoid instance formed by Maybe<A> and a semigroup over A.
final class	PutAll	A Monoid instance formed by HMap that simply combines all the mappings.
final class	RightAll<L,R>	A Monoid instance formed by Either<L,R> and a monoid over R.
final class	RightAny<L,R>	A Monoid instance formed by Either<L,R> and a monoid over R.
final class	RunAll<A>	Run IO operations, aggregating their results in terms of the provided Monoid.
final class	Trivial	The trivial Unit Monoid formed under constantly.
final class	Union<A>	Given two Iterables xs and ys, return the concatenation of the distinct elements of both xs and ys.
final class	Xor	Logical exclusive-or.

Methods in com.jnape.palatable.lambda.monoid.builtin with type parameters of type MonadRec

Modifier and Type	Method	Description
static <M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>> EndoK<M,A,MA>	EndoK.endoK()
static <M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>> EndoK<M,A,MA>	EndoK.endoK()
static <M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>> Monoid<Fn1<A,MA>>	EndoK.endoK(Pure<M> pureM)
static <M extends MonadRec<?,M>, A, MA extends MonadRec<A,M>> Monoid<Fn1<A,MA>>	EndoK.endoK(Pure<M> pureM)

Uses of MonadRec in com.jnape.palatable.lambda.optics

Subinterfaces of MonadRec in com.jnape.palatable.lambda.optics

Modifier and Type	Interface	Description
interface	Iso<S,T,A,B>	An Iso (short for "isomorphism") is an invertible Lens: an Optic encoding of a bi-directional focusing of two types, and like Lenses, can be Viewed, Set, and updated.
static interface	Iso.Simple<S,A>	A convenience type with a simplified type signature for common isos with both unified "larger" values and unified "smaller" values.
interface	Lens<S,T,A,B>	An approximation of van Laarhoven lenses.
static interface	Lens.Simple<S,A>	A convenience type with a simplified type signature for common lenses with both unified "larger" values and unified "smaller" values.
interface	Prism<S,T,A,B>	Prisms are Isos that can fail in one direction.
static interface	Prism.Simple<S,A>	A convenience type with a simplified type signature for common prism with unified S/T and A/B types.

Method parameters in com.jnape.palatable.lambda.optics with type arguments of type MonadRec

Modifier and Type	Method	Description
default <U> Iso<S,U,A,B>	Iso.trampolineM(Fn1<? super T, ? extends MonadRec<RecursiveResult<T,U>, Iso<S,?,A,B>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
default <U> Lens<S,U,A,B>	Lens.trampolineM(Fn1<? super T, ? extends MonadRec<RecursiveResult<T,U>, Lens<S,?,A,B>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.
default <U> Prism<S,U,A,B>	Prism.trampolineM(Fn1<? super T, ? extends MonadRec<RecursiveResult<T,U>, Prism<S,?,A,B>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.

Uses of MonadRec in com.jnape.palatable.lambda.optics.functions

Classes in com.jnape.palatable.lambda.optics.functions that implement MonadRec

Modifier and Type	Class	Description
final class	Matching<S,T,A,B>
final class	Over<S,T,A,B>	Given an Optic, a function from A to B, and a "larger" value S, produce a T by retrieving the A from the S, applying the function, and updating the S with the B resulting from the function.
final class	Pre<P extends Profunctor<?, ?, ? extends P>, S, T, A, B>	Turn an Optic with a unary mapping that can be used for viewing some number of values into an Optic that views the first value, if it exists.
final class	Re<S,T,A,B>	Turn an Optic with a unary mapping that can be used for setting (e.g.
final class	Set<S,T,A,B>	Given an Optic, a "smaller" value B, and a "larger" value S, produce a T by lifting the Optic into the Identity functor.
final class	Under<S,T,A,B>	The inverse of Over: given an Iso, a function from T to S, and a "smaller" value B, return a "smaller" value A by traversing around the type ring (B -> T -> S -> A).
final class	View<S,T,A,B>	Given an Optic and a "larger" value S, retrieve a "smaller" value A by lifting the Optic into the Const functor.

Uses of MonadRec in com.jnape.palatable.lambda.semigroup

Subinterfaces of MonadRec in com.jnape.palatable.lambda.semigroup

Modifier and Type	Interface	Description
interface	Semigroup<A>	A Semigroup is a closed, associative category.

Uses of MonadRec in com.jnape.palatable.lambda.semigroup.builtin

Classes in com.jnape.palatable.lambda.semigroup.builtin that implement MonadRec

Modifier and Type	Class	Description
final class	Absent<A>	A Semigroup instance formed by Maybe<A> and a semigroup over A.
final class	Collapse<_1,_2>	A Semigroup instance formed by a Tuple2<_1, _2> and semigroups over _1 and _2.
final class	Compose<A>	A Semigroup instance formed by CompletableFuture<A> and a semigroup over A.
final class	Intersection<A>	Given two Iterables xs and ys, return the distinct elements of xs that are also in ys in order of their unique occurrence in xs.
final class	LeftAll<L,R>	A Semigroup instance formed by Either<L,R> and a semigroup over L.
final class	LeftAny<L,R>	A Semigroup instance formed by Either<L,R> and a semigroup over L.
final class	Max<A extends Comparable<A>>	A Semigroup over A that chooses between two values x and y via the following rules: If x is strictly less than y, return y Otherwise, return x
final class	MaxBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B, produce a Semigroup over A that chooses between two values x and y via the following rules: If x is strictly less than y in terms of B, return y Otherwise, return x
final class	MaxWith<A>	Given a comparator for some type A, produce a Semigroup over A that chooses between two values x and y via the following rules: If x is strictly less than y in terms of B, return y Otherwise, return x
final class	Merge<L,R>	A Semigroup instance formed by Either.merge(Fn2, Fn2, Either...) and semigroups over L and R.
final class	Min<A extends Comparable<A>>	A Semigroup over A that chooses between two values x and y via the following rules: If x is strictly greater than y, return y Otherwise, return x
final class	MinBy<A, B extends Comparable<B>>	Given a mapping function from some type A to some Comparable type B, produce a Semigroup over A that chooses between two values x and y via the following rules: If x is strictly greater than y in terms of B, return y Otherwise, return x
final class	MinWith<A>	Given a comparator for some type A, produce a Semigroup over A that chooses between two values x and y via the following rules: If x is strictly greater than y in terms of B, return y Otherwise, return x
final class	RightAll<L,R>	A Semigroup instance formed by Either<L,R> and a semigroup over R.
final class	RightAny<L,R>	A Semigroup instance formed by Either<L,R> and a semigroup over R.
final class	RunAll<A>	Run IO operations, aggregating their results in terms of the provided Semigroup.

Uses of MonadRec in com.jnape.palatable.lambda.traversable

Classes in com.jnape.palatable.lambda.traversable that implement MonadRec

Modifier and Type	Class	Description
final class	LambdaIterable<A>	Extension point for Iterable to adapt lambda core types like Monad and Traversable.

Method parameters in com.jnape.palatable.lambda.traversable with type arguments of type MonadRec

Modifier and Type	Method	Description
<B> LambdaIterable<B>	LambdaIterable.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A,B>, LambdaIterable<?>>> fn)	Given some operation yielding a RecursiveResult inside this MonadRec, internally trampoline the operation until it yields a termination instruction.