package monads

  1. Overview
  2. Docs
package monads
Legend:
Library
Module
Module type
Parameter
Class
Class type

Eager(C) derives Monad.Collection.S for container C

Parameters

Signature

val all : 'a M.t T.t -> 'a T.t M.t

all cs performs all computations in cs and returns a list of results in the same order. The order of evaluation is unspecified.

val all_ignore : 'a M.t T.t -> unit M.t

all_ignore cs performs all computations in cs in an unspecified order, and discards the results.

val sequence : unit M.t T.t -> unit M.t

sequence cs performs all computations in cs from left to right.

val map : 'a T.t -> f:('a -> 'b M.t) -> 'b T.t M.t

map xs ~f returns a container where n'th element is a result of computation f x_n, where x_n is the n'th element of the input container. It is unspecified, in which order the computations are evaluated, and whether all computations are performed.

val iter : 'a T.t -> f:('a -> unit M.t) -> unit M.t

iter xs ~f performs f x for each x in xs in the left to right order.

val fold : 'a T.t -> init:'b -> f:('b -> 'a -> 'b M.t) -> 'b M.t

fold xs ~init:s0 ~f folds f over xs in the given monad.

Effectively computes a chain:

              f s0 x0 >>= fun s1 ->
              f s1 x1 >>= fun s2 ->
              ...
              f sN xN

Except that the computation uses a constant stack size.

val fold_left : 'a T.t -> init:'b -> f:('b -> 'a -> 'b M.t) -> 'b M.t

fold_left is a synonym for fold.

val fold_right : 'a T.t -> f:('a -> 'b -> 'b M.t) -> init:'b -> 'b M.t

fold_right xs ~f ~init:s0 folds f over xs from right to left in the given monad.

Effectively computes a chain:

              f x_N s0     >>= fun s1 ->
              f x_(N-1) s1 >>= fun s2 ->
              ...
              f x0 s_N

Except that the computation uses a constant stack size.

val reduce : 'a T.t -> f:('a -> 'a -> 'a M.t) -> 'a option M.t

reduce xs ~f same as fold except that the initial state is obtained from the first element of the container, i.e., computes a sequence

              f x0 x1 >>= fun s1 ->
              f s1 x2 >>= fun s2 ->
              ...
              f sN xN
val exists : 'a T.t -> f:('a -> bool M.t) -> bool M.t

exists xs ~f returns a computation that results in true iff there exists an element x in xs such that f x evaluates to true

val for_all : 'a T.t -> f:('a -> bool M.t) -> bool M.t

for_all xs ~f returns a computation that results in true iff for all x in xs f x evaluates to true.

val count : 'a T.t -> f:('a -> bool M.t) -> int M.t

count xs ~f returns a computation that results to a number of elements of xs for which f evaluates to true. The order of application of f is unspecified.

val map_reduce : (module Monoid.S with type t = 'a) -> 'b T.t -> f:('b -> 'a M.t) -> 'a M.t

map_reduce (module Monoid) xs ~f a composition of map and reduce. Effectively the same as map xs ~f and then reduce in Monoid except that no intermediate collections are created.

val find : 'a T.t -> f:('a -> bool M.t) -> 'a option M.t

find xs ~f returns the first element x of xs for which f x evaluates to true.

val find_map : 'a T.t -> f:('a -> 'b option M.t) -> 'b option M.t

find_map xs ~f returns the first computation f x for x in xs which will result in non None.

val filter : 'a T.t -> f:('a -> bool M.t) -> 'a T.t M.t

filter xs ~f returns a computation that contains all the elements of xs for which f evaluated to true. The order of the elements is the same.

val filter_map : 'a T.t -> f:('a -> 'b option M.t) -> 'b T.t M.t

filter_map xs ~f is a partial mapping from xs to a collection ys, such that all the elements of xs for which f returned Some value are mapped, while the rest are omitted.

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct