package sek

  1. Overview
  2. Docs

Module Emulated.ListSource

The submodule List is a replacement for OCaml's standard List module, where a list is implemented as a persistent sequence.

Sourcetype 'a t = 'a P.t
Sourcetype 'a list = 'a t
Sourceval length : 'a list -> length
Sourceval compare_lengths : 'a list -> 'b list -> comparison
Sourceval compare_length_with : 'a list -> length -> comparison
Sourceval cons : 'a -> 'a list -> 'a list
Sourceval hd : 'a list -> 'a
Sourceval tl : 'a list -> 'a list
Sourceval nth : 'a list -> index -> 'a
Sourceval nth_opt : 'a list -> index -> 'a option
Sourceval rev : 'a list -> 'a list
Sourceval init : 'a -> length -> (index -> 'a) -> 'a list
Sourceval append : 'a list -> 'a list -> 'a list
Sourceval (@) : 'a list -> 'a list -> 'a list
Sourceval rev_append : 'a list -> 'a list -> 'a list
Sourceval concat : 'a list list -> 'a list
Sourceval flatten : 'a list list -> 'a list
Sourceval iter : ('a -> unit) -> 'a list -> unit
Sourceval iteri : (index -> 'a -> unit) -> 'a list -> unit
Sourceval map : 'b -> ('a -> 'b) -> 'a list -> 'b list
Sourceval mapi : 'b -> (index -> 'a -> 'b) -> 'a list -> 'b list
Sourceval rev_map : 'b -> ('a -> 'b) -> 'a list -> 'b list
Sourceval filter_map : 'b -> ('a -> 'b option) -> 'a list -> 'b list
Sourceval concat_map : 'b -> ('a -> 'b list) -> 'a list -> 'b list
Sourceval fold_left_map : 'c -> ('a -> 'b -> 'a * 'c) -> 'a -> 'b list -> 'a * 'c list
Sourceval fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a
Sourceval fold_right : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
Sourceval iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit
Sourceval map2 : 'c -> ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
Sourceval rev_map2 : 'c -> ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
Sourceval fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a
Sourceval fold_right2 : ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
Sourceval for_all : ('a -> bool) -> 'a list -> bool
Sourceval exists : ('a -> bool) -> 'a list -> bool
Sourceval for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
Sourceval exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
Sourceval mem : 'a -> 'a list -> bool
Sourceval memq : 'a -> 'a list -> bool
Sourceval find : ('a -> bool) -> 'a list -> 'a
Sourceval find_opt : ('a -> bool) -> 'a list -> 'a option
Sourceval find_map : ('a -> 'b option) -> 'a list -> 'b option
Sourceval filter : ('a -> bool) -> 'a list -> 'a list
Sourceval find_all : ('a -> bool) -> 'a list -> 'a list
Sourceval filteri : (int -> 'a -> bool) -> 'a list -> 'a list
Sourceval partition : ('a -> bool) -> 'a list -> 'a list * 'a list
Sourceval assoc : 'a -> ('a * 'b) list -> 'b
Sourceval assoc_opt : 'a -> ('a * 'b) list -> 'b option
Sourceval assq : 'a -> ('a * 'b) list -> 'b
Sourceval assq_opt : 'a -> ('a * 'b) list -> 'b option
Sourceval mem_assoc : 'a -> ('a * 'b) list -> bool
Sourceval mem_assq : 'a -> ('a * 'b) list -> bool
Sourceval split : ('a * 'b) list -> 'a list * 'b list
Sourceval combine : 'a list -> 'b list -> ('a * 'b) list
Sourceval sort : ('a -> 'a -> comparison) -> 'a list -> 'a list
Sourceval stable_sort : ('a -> 'a -> comparison) -> 'a list -> 'a list
Sourceval fast_sort : ('a -> 'a -> comparison) -> 'a list -> 'a list
Sourceval uniq : ('a -> 'a -> comparison) -> 'a list -> 'a list
Sourceval sort_uniq : ('a -> 'a -> comparison) -> 'a list -> 'a list
Sourceval merge : ('a -> 'a -> comparison) -> 'a list -> 'a list -> 'a list
Sourceval to_seq : 'a list -> 'a Seq.t
Sourceval of_seq : 'a -> 'a Seq.t -> 'a list
OCaml

Innovation. Community. Security.