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 Description <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)
Applyfn
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 Description <B> LambdaIterable<B>
LambdaIterable. discardL(Applicative<B,LambdaIterable<?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<B> LambdaIterable<A>
LambdaIterable. discardR(Applicative<B,LambdaIterable<?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result and returning thisApplicative
.static <A> LambdaIterable<A>
LambdaIterable. empty()
Construct an emptyLambdaIterable
by 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>
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 valueb
into this applicative functor.<B> LambdaIterable<B>
LambdaIterable. trampolineM(Fn1<? super A,? extends MonadRec<RecursiveResult<A,B>,LambdaIterable<?>>> fn)
Given some operation yielding aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
instruction.static <A> LambdaIterable<A>
LambdaIterable. wrap(java.lang.Iterable<? extends A> as)
Wrap anIterable
in 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 LambdaIterable Modifier and Type Method Description <B> Lazy<LambdaIterable<B>>
LambdaIterable. lazyZip(Lazy<? extends Applicative<Fn1<? super A,? extends B>,LambdaIterable<?>>> lazyAppFn)
Given alazy
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 canonicalPure
instance forLambdaIterable
.Method parameters in com.jnape.palatable.lambda.traversable with type arguments of type LambdaIterable Modifier and Type Method Description <B> LambdaIterable<B>
LambdaIterable. discardL(Applicative<B,LambdaIterable<?>> appB)
Sequence both thisApplicative
andappB
, discarding thisApplicative's
result and returningappB
.<B> LambdaIterable<A>
LambdaIterable. discardR(Applicative<B,LambdaIterable<?>> appB)
Sequence both thisApplicative
andappB
, discardingappB's
result 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 alazy
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 aRecursiveResult
inside thisMonadRec
, internally trampoline the operation until it yields atermination
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.
-