package travesty

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Parameters
Signature

Monadically traversable containers

Install

dune-project

Dependency

mattwindsor91.github.io Readme Changelog Edit opam file Versions (8)

Authors

M

Matt Windsor <m.windsor@imperial.ac.uk>

Maintainers

M

Matt Windsor <m.windsor@imperial.ac.uk>

Sources

travesty-v0.5.1.tbz

sha256=6096bfedbab2044c6372c918712bc5e71ffba5a373cdab37398787712c9c83af

sha512=a7a1cd7981af2c16111323cdf72ac6a45a5e58a3701376fdb3d7f3ee15fbf4003e71f94ad882ccea0d308bb229f3ac0b2c9861a231a498c22e44551f1fcf802d

doc/travesty.base_exts/Travesty_base_exts/Option/On_monad/index.html

Module `Option.On_monad`Source

On_monad implements monadic folding and mapping operators for a given monad M, including arity-1 specific operators.

Parameters

module M : Base.Monad.S

Signature

include Travesty.Traversable.Generic_on_monad
  with type 'a t := 'a t
   and type 'a elt := 'a
  with module M := M

include Travesty.Traversable.Basic_generic_on_monad
  with type 'a t := 'a t
  with type 'a elt := 'a
  with module M := M

Generic refers to the container type as 'a t, and the element type as 'a elt; substitute t/elt (arity-0) or 'a t/'a (arity-1) accordingly below.

include Travesty.Types_intf.Generic
  with type 'a t := 'a t
  with type 'a elt := 'a

Sourceval map_m : 'a t -> f:('a -> 'b M.t) -> 'b t M.t

map_m c ~f maps f over every t in c, threading through monadic state.

Example:

  (* Travesty_base_exts.List adds monadic traversals to a list;
     With_errors (in S1_container) implements them on the On_error
     monad. *)

  let f x =
    Or_error.(if 0 < x then error_string "negative!" else ok x)
  in
  List.With_errors.map_m integers ~f

Source

val fold_map_m : 
  'a t ->
  f:('acc -> 'a -> ('acc * 'b) M.t) ->
  init:'acc ->
  ('acc * 'b t) M.t

fold_map_m c ~f ~init folds f monadically over every t in c, threading through an accumulator with initial value init.

Sourceval fold_m : 'a t -> init:'acc -> f:('acc -> 'a -> 'acc M.t) -> 'acc M.t

fold_m x ~init ~f folds the monadic computation f over x, starting with initial value init, and returning the final value inside the monadic effect.

Sourceval iter_m : 'a t -> f:('a -> Base.unit M.t) -> Base.unit M.t

iter_m x ~f iterates the monadic computation f over x, returning the final monadic effect.

Sourceval mapi_m : f:(Base.int -> 'a -> 'b M.t) -> 'a t -> 'b t M.t

mapi_m ~f x behaves as mapM, but also supplies f with the index of the element. This index should match the actual position of the element in the container x.

Sourceval sequence_m : 'a M.t t -> 'a t M.t

sequence_m x lifts a container of monads x to a monad containing a container, by sequencing the monadic effects from left to right.