## Uses of Class
com.jnape.palatable.lambda.monad.transformer.builtin.ReaderT

- Packages that use ReaderT
  Package | Description
  --- | ---
  com.jnape.palatable.lambda.monad.transformer.builtin |

- - ### Uses of ReaderT in com.jnape.palatable.lambda.monad.transformer.builtin

    Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return ReaderT
    Modifier and Type | Method and Description
    --- | ---
    `ReaderT<R,M,Tuple2<R,A>>` | ReaderT.`carry()` Pair the covariantly-positioned carrier type with the contravariantly-positioned carrier type.
    `<C> ReaderT<Tuple2<C,R>,M,Tuple2<C,A>>` | ReaderT.`cartesian()` Pair some type `C` to this profunctor's carrier types.
    `<Q> ReaderT<Q,M,A>` | ReaderT.`contraMap(Fn1<? super Q,? extends R> fn)` Contravariantly map `A <- B`.
    `<Q,B> ReaderT<Q,M,B>` | ReaderT.`diMap(Fn1<? super Q,? extends R> lFn, Fn1<? super A,? extends B> rFn)` Dually map contravariantly over the left parameter and covariantly over the right parameter.
    `<Q> ReaderT<Q,M,A>` | ReaderT.`diMapL(Fn1<? super Q,? extends R> fn)` Contravariantly map over the left parameter.
    `<B> ReaderT<R,M,B>` | ReaderT.`diMapR(Fn1<? super A,? extends B> fn)` Covariantly map over the right parameter.
    `<B> ReaderT<R,M,B>` | ReaderT.`discardL(Applicative<B,ReaderT<R,M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<B> ReaderT<R,M,A>` | ReaderT.`discardR(Applicative<B,ReaderT<R,M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<B> ReaderT<R,M,B>` | ReaderT.`flatMap(Fn1<? super A,? extends Monad<B,ReaderT<R,M,?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<B> ReaderT<R,M,B>` | ReaderT.`fmap(Fn1<? super A,? extends B> fn)` Covariantly transmute this functor's parameter using the given mapping function.
    `<B,N extends MonadRec<?,N>> ReaderT<R,N,B>` | ReaderT.`lift(MonadRec<B,N> mb)` Lift a new argument `MonadRec` into this `MonadBase`.
    `ReaderT<R,M,A>` | ReaderT.`local(Fn1<? super R,? extends R> fn)` Modify this `MonadReader's` environment after reading it but before running the effect.
    `<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`.
    `<B> ReaderT<R,M,B>` | ReaderT.`pure(B b)` Lift the value `b` into this applicative functor.
    `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.
    `<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> ReaderT<R,M,B>` | ReaderT.`zip(Applicative<Fn1<? super A,? extends B>,ReaderT<R,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.transformer.builtin that return types with arguments of type ReaderT
    Modifier and Type | Method and Description
    --- | ---
    `<B> Lazy<ReaderT<R,M,B>>` | ReaderT.`lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,ReaderT<R,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.
    `static <R> Lift<ReaderT<R,?,?>>` | ReaderT.`liftReaderT()` `Lift` for `ReaderT`.
    `static <R,M extends MonadRec<?,M>> Pure<ReaderT<R,M,?>>` | ReaderT.`pureReaderT(Pure<M> pureM)` The canonical `Pure` instance for `ReaderT`.

    Method parameters in com.jnape.palatable.lambda.monad.transformer.builtin with type arguments of type ReaderT
    Modifier and Type | Method and Description
    --- | ---
    `<B> ReaderT<R,M,B>` | ReaderT.`discardL(Applicative<B,ReaderT<R,M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<B> ReaderT<R,M,A>` | ReaderT.`discardR(Applicative<B,ReaderT<R,M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<B> ReaderT<R,M,B>` | ReaderT.`flatMap(Fn1<? super A,? extends Monad<B,ReaderT<R,M,?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<B> Lazy<ReaderT<R,M,B>>` | ReaderT.`lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,ReaderT<R,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.
    `<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> ReaderT<R,M,B>` | ReaderT.`zip(Applicative<Fn1<? super A,? extends B>,ReaderT<R,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.