cyclops.typeclasses.foldable

Interface Foldable<CRE>

Type Parameters:

CRE - The core type of the foldable (e.g. the HKT witness type, not the generic type : ListType.µ)

All Known Implementing Classes:

General.GeneralFoldable

public interface Foldable<CRE>

Type class for foldables

Method Summary

Modifier and Type	Method and Description
default <T> boolean	allMatch(java.util.function.Predicate<? super T> pred, Higher<CRE,T> ds)
default <T> boolean	anyMatch(java.util.function.Predicate<? super T> pred, Higher<CRE,T> ds)
default <C2,T,R> Higher<C2,T>	foldK(MonoidK<C2,T> monoid, Higher<CRE,Higher<C2,T>> ds)
<T> T	foldLeft(Monoid<T> monoid, Higher<CRE,T> ds) Starting from the left combine each value in turn with an accumulator
default <T> T	foldLeft(T identity, java.util.function.BinaryOperator<T> semigroup, Higher<CRE,T> ds) Starting from the left combine each value in turn with an accumulator
<T,R> R	foldMap(Monoid<R> mb, java.util.function.Function<? super T,? extends R> fn, Higher<CRE,T> nestedA)
default <T,R> R	foldr(java.util.function.Function<T,java.util.function.Function<R,R>> fn, R b, Higher<CRE,T> ds)
<T> T	foldRight(Monoid<T> monoid, Higher<CRE,T> ds) Starting from the right combine each value in turn with an accumulator
default <T> T	foldRight(T identity, java.util.function.BinaryOperator<T> semigroup, Higher<CRE,T> ds) Starting from the right combine each value in turn with an accumulator
default <T> T	getAt(Higher<CRE,T> ds, int index)
default <T> T	intercalate(Monoid<T> monoid, T value, Higher<CRE,T> ds)
default <T> ListX<T>	listX(Higher<CRE,T> ds)
default <T> long	size(Higher<CRE,T> ds)
default <T> ReactiveSeq<T>	stream(Higher<CRE,T> ds)

Method Detail

foldRight

<T> T foldRight(Monoid<T> monoid,
                Higher<CRE,T> ds)

Starting from the right combine each value in turn with an accumulator

Parameters:

monoid - Monoid to combine values

ds - DataStructure to foldRight

Returns:

Reduced value

foldRight

default <T> T foldRight(T identity,
                        java.util.function.BinaryOperator<T> semigroup,
                        Higher<CRE,T> ds)

Starting from the right combine each value in turn with an accumulator

Parameters:

identity - Identity value & default

semigroup - Combining function

ds - DataStructure to foldRight

Returns:

reduced value

foldLeft

<T> T foldLeft(Monoid<T> monoid,
               Higher<CRE,T> ds)

Starting from the left combine each value in turn with an accumulator

Parameters:

monoid - Monoid to combine values

ds - DataStructure to foldLeft

Returns:

Reduced value

foldLeft

default <T> T foldLeft(T identity,
                       java.util.function.BinaryOperator<T> semigroup,
                       Higher<CRE,T> ds)

Starting from the left combine each value in turn with an accumulator

Parameters:

identity - Identity value & default

semigroup - Combining function

ds - DataStructure to foldLeft

Returns:

Reduced value

foldMap

<T,R> R foldMap(Monoid<R> mb,
                java.util.function.Function<? super T,? extends R> fn,
                Higher<CRE,T> nestedA)

foldr

default <T,R> R foldr(java.util.function.Function<T,java.util.function.Function<R,R>> fn,
                      R b,
                      Higher<CRE,T> ds)

foldK

default <C2,T,R> Higher<C2,T> foldK(MonoidK<C2,T> monoid,
                                    Higher<CRE,Higher<C2,T>> ds)

size

default <T> long size(Higher<CRE,T> ds)

listX

default <T> ListX<T> listX(Higher<CRE,T> ds)

stream

default <T> ReactiveSeq<T> stream(Higher<CRE,T> ds)

intercalate

default <T> T intercalate(Monoid<T> monoid,
                          T value,
                          Higher<CRE,T> ds)

getAt

default <T> T getAt(Higher<CRE,T> ds,
                    int index)

anyMatch

default <T> boolean anyMatch(java.util.function.Predicate<? super T> pred,
                             Higher<CRE,T> ds)

allMatch

default <T> boolean allMatch(java.util.function.Predicate<? super T> pred,
                             Higher<CRE,T> ds)