arrow-core / arrow.core.extensions.sequencek.foldable / arrow.Kind
Extensions for arrow.Kind
| all | fun <A> Kind<ForSequenceK, A>.~~all~~(arg1: (A) -> Boolean): Boolean |
| combineAll | fun <A> Kind<ForSequenceK, A>.~~combineAll~~(arg1: Monoid<A>): A |
| exists | fun <A> Kind<ForSequenceK, A>.~~exists~~(arg1: (A) -> Boolean): Boolean |
| find | fun <A> Kind<ForSequenceK, A>.~~find~~(arg1: (A) -> Boolean): Option<A> |
| firstOption | fun <A> Kind<ForSequenceK, A>.~~firstOption~~(): Option<A>fun <A> Kind<ForSequenceK, A>.~~firstOption~~(arg1: (A) -> Boolean): Option<A> |
| firstOrNone | fun <A> Kind<ForSequenceK, A>.~~firstOrNone~~(): Option<A>fun <A> Kind<ForSequenceK, A>.~~firstOrNone~~(arg1: (A) -> Boolean): Option<A> |
| fold | fun <A> Kind<ForSequenceK, A>.~~fold~~(arg1: Monoid<A>): A |
| foldLeft | fun <A, B> Kind<ForSequenceK, A>.~~foldLeft~~(arg1: B, arg2: (B, A) -> B): B |
| foldM | fun <G, A, B> Kind<ForSequenceK, A>.~~foldM~~(arg1: Monad<G>, arg2: B, arg3: (B, A) -> Kind<G, B>): Kind<G, B> |
| foldMap | fun <A, B> Kind<ForSequenceK, A>.~~foldMap~~(arg1: Monoid<B>, arg2: (A) -> B): B |
| foldMapM | fun <G, A, B, MA : Monad<G>, MO : Monoid<B>> Kind<ForSequenceK, A>.~~foldMapM~~(arg1: MA, arg2: MO, arg3: (A) -> Kind<G, B>): Kind<G, B> |
| foldRight | fun <A, B> Kind<ForSequenceK, A>.~~foldRight~~(arg1: Eval<B>, arg2: (A, Eval<B>) -> Eval<B>): Eval<B> |
| forAll | fun <A> Kind<ForSequenceK, A>.~~forAll~~(arg1: (A) -> Boolean): Boolean |
| get | fun <A> Kind<ForSequenceK, A>.~~get~~(arg1: Long): Option<A> |
| isEmpty | fun <A> Kind<ForSequenceK, A>.~~isEmpty~~(): Boolean |
| isNotEmpty | fun <A> Kind<ForSequenceK, A>.~~isNotEmpty~~(): Boolean |
| nonEmpty | fun <A> Kind<ForSequenceK, A>.~~nonEmpty~~(): Boolean |
| reduceLeftOption | fun <A> Kind<ForSequenceK, A>.~~reduceLeftOption~~(arg1: (A, A) -> A): Option<A> |
| reduceLeftToOption | fun <A, B> Kind<ForSequenceK, A>.~~reduceLeftToOption~~(arg1: (A) -> B, arg2: (B, A) -> B): Option<B> |
| reduceRightOption | fun <A> Kind<ForSequenceK, A>.~~reduceRightOption~~(arg1: (A, Eval<A>) -> Eval<A>): Eval<Option<A>> |
| reduceRightToOption | fun <A, B> Kind<ForSequenceK, A>.~~reduceRightToOption~~(arg1: (A) -> B, arg2: (A, Eval<B>) -> Eval<B>): Eval<Option<B>> |
| sequence_ | fun <G, A> Kind<ForSequenceK, Kind<G, A>>.~~sequence_~~(arg1: Applicative<G>): Kind<G, Unit> |
| size | fun <A> Kind<ForSequenceK, A>.~~size~~(arg1: Monoid<Long>): Long |
| toList | fun <A> Kind<ForSequenceK, A>.~~toList~~(): List<A> |
| traverse_ | fun <G, A, B> Kind<ForSequenceK, A>.~~traverse_~~(arg1: Applicative<G>, arg2: (A) -> Kind<G, B>): Kind<G, Unit> |