module T : Preface_specs.Types.T0type 'a t = (T.t, 'a) Bifunctor.tThe type held by the Foldable.
val fold_map' : 'a -> ('a -> 'a -> 'a) -> ('b -> 'a) -> 'b t -> 'aMap each element of the Foldable to a Monoid an combine the result.
val fold_right : ('a -> 'b -> 'b) -> 'a t -> 'b -> 'bSame of List.fold_right for Foldable.
val reduce : (module Preface_specs.Monoid.CORE with type t = 'm) -> 'm t -> 'mReduce a Foldable using combine of the given monoid.
val fold_map :
(module Preface_specs.Monoid.CORE with type t = 'm) ->
('a -> 'm) ->
'a t ->
'mSame of CORE.fold_map' but using a monoid module instead of giving explicitely neutral and combine.
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b t -> 'aSame of List.fold_left for Foldable.
val for_all : ('a -> bool) -> 'a t -> boolChecks if all elements of the Foldable satisfy the given predicate.
val exists : ('a -> bool) -> 'a t -> boolChecks if at least on element of the Foldable satisfy the given predicate.
val length : 'a t -> intCount the number of elements in the Foldable.