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

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

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

    Methods in com.jnape.palatable.lambda.monad.transformer.builtin that return IdentityT
    Modifier and Type | Method and Description
    --- | ---
    `<B> IdentityT<M,B>` | IdentityT.`discardL(Applicative<B,IdentityT<M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<B> IdentityT<M,A>` | IdentityT.`discardR(Applicative<B,IdentityT<M,?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<B> IdentityT<M,B>` | IdentityT.`flatMap(Fn1<? super A,? extends Monad<B,IdentityT<M,?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<B> IdentityT<M,B>` | IdentityT.`fmap(Fn1<? super A,? extends B> fn)` Covariantly transmute this functor's parameter using the given mapping function.
    `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`.
    `<B,N extends MonadRec<?,N>> IdentityT<N,B>` | IdentityT.`lift(MonadRec<B,N> mb)` Lift a new argument `MonadRec` into this `MonadBase`.
    `<B> IdentityT<M,B>` | IdentityT.`pure(B b)` Lift the value `b` into this applicative functor.
    `<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> IdentityT<M,B>` | IdentityT.`zip(Applicative<Fn1<? super A,? extends B>,IdentityT<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 IdentityT
    Modifier and Type | Method and Description
    --- | ---
    `<B> Lazy<IdentityT<M,B>>` | IdentityT.`lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,IdentityT<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 Lift<IdentityT<?,?>>` | IdentityT.`liftIdentityT()` `Lift` for `IdentityT`.
    `static <M extends MonadRec<?,M>> Pure<IdentityT<M,?>>` | IdentityT.`pureIdentityT(Pure<M> pureM)` The canonical `Pure` instance for `IdentityT`.

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