package ocaml-webworker

  1. Overview
  2. Docs
include module type of struct include ListLabels end
val length : 'a list -> int
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val rev : 'a list -> 'a list
val append : 'a list -> 'a list -> 'a list
val rev_append : 'a list -> 'a list -> 'a list
val concat : 'a list list -> 'a list
val flatten : 'a list list -> 'a list
val iter : f:('a -> unit) -> 'a list -> unit
val iteri : f:(int -> 'a -> unit) -> 'a list -> unit
val map : f:('a -> 'b) -> 'a list -> 'b list
val mapi : f:(int -> 'a -> 'b) -> 'a list -> 'b list
val rev_map : f:('a -> 'b) -> 'a list -> 'b list
val fold_left : f:('a -> 'b -> 'a) -> init:'a -> 'b list -> 'a
val fold_right : f:('a -> 'b -> 'b) -> 'a list -> init:'b -> 'b
val iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val rev_map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val fold_left2 : f:('a -> 'b -> 'c -> 'a) -> init:'a -> 'b list -> 'c list -> 'a
val fold_right2 : f:('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> init:'c -> 'c
val for_all : f:('a -> bool) -> 'a list -> bool
val exists : f:('a -> bool) -> 'a list -> bool
val for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val mem : 'a -> set:'a list -> bool
val memq : 'a -> set:'a list -> bool
val find : f:('a -> bool) -> 'a list -> 'a
val filter : f:('a -> bool) -> 'a list -> 'a list
val find_all : f:('a -> bool) -> 'a list -> 'a list
val partition : f:('a -> bool) -> 'a list -> 'a list * 'a list
val assoc : 'a -> ('a * 'b) list -> 'b
val assq : 'a -> ('a * 'b) list -> 'b
val mem_assoc : 'a -> map:('a * 'b) list -> bool
val mem_assq : 'a -> map:('a * 'b) list -> bool
val remove_assoc : 'a -> ('a * 'b) list -> ('a * 'b) list
val remove_assq : 'a -> ('a * 'b) list -> ('a * 'b) list
val split : ('a * 'b) list -> 'a list * 'b list
val combine : 'a list -> 'b list -> ('a * 'b) list
val sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val init : f:(int -> 'a) -> int -> 'a list
val index : f:('a -> bool) -> 'a list -> int
val find_some : f:('a -> bool) -> 'a list -> 'a option
val rev_scan_left : 'a list -> f:('a -> 'b -> 'a) -> 'b list -> init:'a -> 'a list
val scan_left : f:('a -> 'b -> 'a) -> 'b list -> init:'a -> 'a list
val rev_filter : f:('a -> bool) -> 'a list -> 'a list
val filter_map : f:('a -> 'b option) -> 'a list -> 'b list
val find_map : f:('a -> 'b option) -> 'a list -> 'b
val map_end : f:('a -> 'b) -> 'a list -> 'b list -> 'b list
val concat_map : f:('a -> 'b list) -> 'a list -> 'b list
val replicate : 'a -> int -> 'a list
val remove : ?phys:bool -> 'a -> 'a list -> 'a list
val remove_all : 'a -> 'a list -> 'a list
val same : f:('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val length_lessthan : int -> 'a list -> int option
val filter_dup' : equiv:('a -> 'b) -> 'a list -> 'a list
val filter_dup : 'a list -> 'a list
val merge_cons : f:('a -> 'a -> 'a option) -> 'a list -> 'a list
val take_while : f:('a -> bool) -> 'a list -> 'a list
val drop_while : f:('a -> bool) -> 'a list -> 'a list
val take_n : int -> 'a list -> 'a list
val drop_n : int -> 'a list -> 'a list
val split_n : int -> 'a list -> 'a list * 'a list
val split3 : ('a * 'b * 'c) list -> 'a list * 'b list * 'c list
val unfold : f:('a -> 'a option) -> 'a -> 'a list
val rev_unfold : 'a list -> f:('a -> 'a option) -> 'a -> 'a list
val fold_n_map : f:('a -> 'b -> 'a * 'c) -> init:'a -> 'b list -> 'a * 'c list
module Lazy : sig ... end
val last : 'a list -> 'a option
val group_by : ('a -> 'a -> bool) -> 'a list -> 'a list list
val merge : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a list
val print : (unit -> 'a -> string) -> unit -> 'a list -> string
OCaml

Innovation. Community. Security.