## Uses of Class
com.jnape.palatable.lambda.traversable.LambdaIterable

- Packages that use LambdaIterable
  Package | Description
  --- | ---
  com.jnape.palatable.lambda.traversable |

- - ### Uses of LambdaIterable in com.jnape.palatable.lambda.traversable

    Methods in com.jnape.palatable.lambda.traversable with type parameters of type LambdaIterable
    Modifier and Type | Method and Description
    --- | ---
    `<B,App extends Applicative<?,App>,TravB extends Traversable<B,LambdaIterable<?>>,AppTrav extends Applicative<TravB,App>> AppTrav` | LambdaIterable.`traverse(Fn1<? super A,? extends Applicative<B,App>> fn, Fn1<? super TravB,? extends AppTrav> pure)` Apply `fn` to each element of this traversable from left to right, and collapse the results into a single resulting applicative, potentially with the assistance of the applicative's pure function.

    Methods in com.jnape.palatable.lambda.traversable that return LambdaIterable
    Modifier and Type | Method and Description
    --- | ---
    `<B> LambdaIterable<B>` | LambdaIterable.`discardL(Applicative<B,LambdaIterable<?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<B> LambdaIterable<A>` | LambdaIterable.`discardR(Applicative<B,LambdaIterable<?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `static <A> LambdaIterable<A>` | LambdaIterable.`empty()` Construct an empty `LambdaIterable` by wrapping `Collections.emptyList()`.
    `<B> LambdaIterable<B>` | LambdaIterable.`flatMap(Fn1<? super A,? extends Monad<B,LambdaIterable<?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<B> LambdaIterable<B>` | LambdaIterable.`fmap(Fn1<? super A,? extends B> fn)` Covariantly transmute this functor's parameter using the given mapping function.
    `<B> LambdaIterable<B>` | LambdaIterable.`pure(B b)` Lift the value `b` into this applicative functor.
    `<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.
    `static <A> LambdaIterable<A>` | LambdaIterable.`wrap(Iterable<? extends A> as)` Wrap an `Iterable` in a `LambdaIterable`.
    `<B> LambdaIterable<B>` | LambdaIterable.`zip(Applicative<Fn1<? super A,? extends B>,LambdaIterable<?>> 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.traversable that return types with arguments of type LambdaIterable
    Modifier and Type | Method and Description
    --- | ---
    `<B> Lazy<LambdaIterable<B>>` | LambdaIterable.`lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,LambdaIterable<?>>> 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 Pure<LambdaIterable<?>>` | LambdaIterable.`pureLambdaIterable()` The canonical `Pure` instance for `LambdaIterable`.

    Method parameters in com.jnape.palatable.lambda.traversable with type arguments of type LambdaIterable
    Modifier and Type | Method and Description
    --- | ---
    `<B> LambdaIterable<B>` | LambdaIterable.`discardL(Applicative<B,LambdaIterable<?>> appB)` Sequence both this `Applicative` and `appB`, discarding this `Applicative's` result and returning `appB`.
    `<B> LambdaIterable<A>` | LambdaIterable.`discardR(Applicative<B,LambdaIterable<?>> appB)` Sequence both this `Applicative` and `appB`, discarding `appB's` result and returning this `Applicative`.
    `<B> LambdaIterable<B>` | LambdaIterable.`flatMap(Fn1<? super A,? extends Monad<B,LambdaIterable<?>>> f)` Chain dependent computations that may continue or short-circuit based on previous results.
    `<B> Lazy<LambdaIterable<B>>` | LambdaIterable.`lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,LambdaIterable<?>>> 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> 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.
    `<B> LambdaIterable<B>` | LambdaIterable.`zip(Applicative<Fn1<? super A,? extends B>,LambdaIterable<?>> appFn)` Given another instance of this applicative over a mapping function, "zip" the two instances together using whatever application semantics the current applicative supports.