CCListLabels.Traverse
module M : MONAD
val sequence_m : 'a M.t t -> 'a t M.t
val fold_m : f:( 'b -> 'a -> 'b M.t ) -> init:'b -> 'a t -> 'b M.t
val map_m : f:( 'a -> 'b M.t ) -> 'a t -> 'b t M.t
val map_m_par : f:( 'a -> 'b M.t ) -> 'a t -> 'b t M.t
map_m_par ~f (x :: l) is like map_m but f x and f l are evaluated "in parallel" before combining their result (for instance in Lwt).
map_m_par ~f (x :: l)
map_m
f x
f l