S -> A.monad transformer that can safely interpret deeply nested left- or right-associated
binds for any MonadRec.Iterable of As, a starting value B, and a
Fn2<B, A, B>Iterable, collecting each
function application result, finally returning an Iterable of all the results.heterogeneous list of values pointed at by one or more
typesafe keys that must all exist in the same HMap to be collectively extracted.Schema from a single TypeSafeKey.Schema from two TypeSafeKeys.Schema from three TypeSafeKeys.Schema from four TypeSafeKeys.Schema from five TypeSafeKeys.Schema from six TypeSafeKeys.Schema from seven TypeSafeKeys.Schema from eight TypeSafeKeys.Semigroup is a closed, associative category.Traversable of Applicatives and a pure Applicative constructor, traverse the
elements from left to right, zipping the Applicatives together and collecting the results.HList.Sets.Iso from a function and its inverse.Prism from a function and its potentially failing inverse.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.Iterable and a Comparator over the Iterable element type, produce a
sorted List of the original elements based on sorting applied by the Comparator.S -> Either<T, A>.Monad, useful for iteratively building up state and state-contextualized result.State that returns a as its result and its initial state as its final state.State from stateFn, a function that maps an initial state into a result and a final
state.State monad transformer.monadic value into StateT.monadically embedded computation into StateT.