Uses of Class
com.jnape.palatable.lambda.traversable.LambdaIterable
Packages that use LambdaIterable
-
Uses of LambdaIterable in com.jnape.palatable.lambda.traversable
Classes in com.jnape.palatable.lambda.traversable that implement interfaces with type arguments of type LambdaIterableModifier and TypeClassDescriptionfinal classfinal classMethods in com.jnape.palatable.lambda.traversable with type parameters of type LambdaIterableModifier and TypeMethodDescription<B, App extends Applicative<?,App>, TravB extends Traversable<B, LambdaIterable<?>>, AppTrav extends Applicative<TravB, App>>
AppTravLambdaIterable.traverse(Fn1<? super A, ? extends Applicative<B, App>> fn, Fn1<? super TravB, ? extends AppTrav> pure) Applyfnto 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 LambdaIterableModifier and TypeMethodDescription<B> LambdaIterable<B> LambdaIterable.discardL(Applicative<B, LambdaIterable<?>> appB) Sequence both thisApplicativeandappB, discarding thisApplicative'sresult and returningappB.<B> LambdaIterable<A> LambdaIterable.discardR(Applicative<B, LambdaIterable<?>> appB) Sequence both thisApplicativeandappB, discardingappB'sresult and returning thisApplicative.static <A> LambdaIterable<A> LambdaIterable.empty()Construct an emptyLambdaIterableby wrappingCollections.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> Covariantly transmute this functor's parameter using the given mapping function.<B> LambdaIterable<B> LambdaIterable.pure(B b) Lift the valuebinto this applicative functor.<B> LambdaIterable<B> LambdaIterable.trampolineM(Fn1<? super A, ? extends MonadRec<RecursiveResult<A, B>, LambdaIterable<?>>> fn) Given some operation yielding aRecursiveResultinside thisMonadRec, internally trampoline the operation until it yields aterminationinstruction.static <A> LambdaIterable<A> Wrap anIterablein aLambdaIterable.<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 LambdaIterableModifier and TypeMethodDescription<B> Lazy<LambdaIterable<B>> LambdaIterable.lazyZip(Lazy<? extends Applicative<Fn1<? super A, ? extends B>, LambdaIterable<?>>> lazyAppFn) Given alazyinstance 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 canonicalPureinstance forLambdaIterable.Method parameters in com.jnape.palatable.lambda.traversable with type arguments of type LambdaIterableModifier and TypeMethodDescription<B> LambdaIterable<B> LambdaIterable.discardL(Applicative<B, LambdaIterable<?>> appB) Sequence both thisApplicativeandappB, discarding thisApplicative'sresult and returningappB.<B> LambdaIterable<A> LambdaIterable.discardR(Applicative<B, LambdaIterable<?>> appB) Sequence both thisApplicativeandappB, discardingappB'sresult and returning thisApplicative.<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 alazyinstance 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 aRecursiveResultinside thisMonadRec, internally trampoline the operation until it yields aterminationinstruction.<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.