package seqes

  1. Overview
  2. Docs

M is a module which contains a specialised subset of the functions from the Stdlib.Seq module. Specifically, it contains those functions which take a function as parameter (e.g., map but not length). Moreover, those parameter functions' return type is specialised to be within the mon monad. E.g., given module SeqMon = Make(Mon) then SeqMon.M.map has type ('a -> 'b Mon.t) -> 'a t -> 'b t and SeqMon.M.iter has type ('a -> unit mon) -> 'a t -> unit mon.

See the documentation of Sigs1.SEQMON1TRANSFORMERS for more details.

Any monad that we can use to produce transformers, we can also use to produce traversors. Thus, SEQMON1TRANSFORMERS includes SEQMON1TRAVERSORS and all the functors producing transformer also produce traversors.

val iter : ('a -> unit Mon.t) -> 'a t -> unit Mon.t

See Stdlib.Seq.iter

val fold_left : ('a -> 'b -> 'a Mon.t) -> 'a -> 'b t -> 'a Mon.t

See Stdlib.Seq.fold_left

val iteri : (int -> 'a -> unit Mon.t) -> 'a t -> unit Mon.t

See Stdlib.Seq.iteri

val fold_lefti : ('b -> int -> 'a -> 'b Mon.t) -> 'b -> 'a t -> 'b Mon.t

See Stdlib.Seq.fold_lefti

val for_all : ('a -> bool Mon.t) -> 'a t -> bool Mon.t

See Stdlib.Seq.for_all

val exists : ('a -> bool Mon.t) -> 'a t -> bool Mon.t

See Stdlib.Seq.exists

val find : ('a -> bool Mon.t) -> 'a t -> 'a option Mon.t

See Stdlib.Seq.find

val find_map : ('a -> 'b option Mon.t) -> 'a t -> 'b option Mon.t

See Stdlib.Seq.find_map

val iter2 : ('a -> 'b -> unit Mon.t) -> 'a t -> 'b t -> unit Mon.t

See Stdlib.Seq.iter2

val fold_left2 : ('a -> 'b -> 'c -> 'a Mon.t) -> 'a -> 'b t -> 'c t -> 'a Mon.t

See Stdlib.Seq.fold_left2

val for_all2 : ('a -> 'b -> bool Mon.t) -> 'a t -> 'b t -> bool Mon.t

See Stdlib.Seq.for_all2

val exists2 : ('a -> 'b -> bool Mon.t) -> 'a t -> 'b t -> bool Mon.t

See Stdlib.Seq.exists2

val init : int -> (int -> 'a Mon.t) -> 'a t

See Stdlib.Seq.init

val unfold : ('b -> ('a * 'b) option Mon.t) -> 'b -> 'a t

See Stdlib.Seq.unfold

val forever : (unit -> 'a Mon.t) -> 'a t

See Stdlib.Seq.forever

val iterate : ('a -> 'a Mon.t) -> 'a -> 'a t

See Stdlib.Seq.iterate

val map : ('a -> 'b Mon.t) -> 'a t -> 'b t

See Stdlib.Seq.map

val mapi : (int -> 'a -> 'b Mon.t) -> 'a t -> 'b t

See Stdlib.Seq.mapi

val filter : ('a -> bool Mon.t) -> 'a t -> 'a t

See Stdlib.Seq.filter

val filter_map : ('a -> 'b option Mon.t) -> 'a t -> 'b t

See Stdlib.Seq.filter_map

val scan : ('b -> 'a -> 'b Mon.t) -> 'b -> 'a t -> 'b t

See Stdlib.Seq.scan

val take_while : ('a -> bool Mon.t) -> 'a t -> 'a t

See Stdlib.Seq.take_while

val drop_while : ('a -> bool Mon.t) -> 'a t -> 'a t

See Stdlib.Seq.drop_while

val group : ('a -> 'a -> bool Mon.t) -> 'a t -> 'a t t

See Stdlib.Seq.group

val map2 : ('a -> 'b -> 'c Mon.t) -> 'a t -> 'b t -> 'c t

See Stdlib.Seq.map2

val map_product : ('a -> 'b -> 'c Mon.t) -> 'a t -> 'b t -> 'c t

See Stdlib.Seq.map_product

val partition_map : ('a -> ('b, 'c) Either.t Mon.t) -> 'a t -> 'b t * 'c t

See Stdlib.Seq.partition_map

val partition : ('a -> bool Mon.t) -> 'a t -> 'a t * 'a t

See Stdlib.Seq.partition