include module type of struct include Stdlib.StdLabels.List end
type !'a t = 'a list = | []| :: of 'a * 'a list
val length : 'a list -> intval compare_lengths : 'a list -> 'b list -> intval compare_length_with : 'a list -> len:int -> intval cons : 'a -> 'a list -> 'a listval tl : 'a list -> 'a listval nth : 'a list -> int -> 'aval nth_opt : 'a list -> int -> 'a optionval rev : 'a list -> 'a listval rev_append : 'a list -> 'a list -> 'a listval flatten : 'a list list -> 'a listval equal : eq:('a -> 'a -> bool) -> 'a list -> 'a list -> boolval compare : cmp:('a -> 'a -> int) -> 'a list -> 'a list -> intval iteri : f:(int -> 'a -> unit) -> 'a list -> unitval rev_map : f:('a -> 'b) -> 'a list -> 'b listval fold_left_map :
f:('acc -> 'a -> 'acc * 'b) ->
init:'acc ->
'a list ->
'acc * 'b listval fold_left : f:('acc -> 'a -> 'acc) -> init:'acc -> 'a list -> 'accval iter2 : f:('a -> 'b -> unit) -> 'a list -> 'b list -> unitval rev_map2 : f:('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c listval fold_left2 :
f:('acc -> 'a -> 'b -> 'acc) ->
init:'acc ->
'a list ->
'b list ->
'accval for_all : f:('a -> bool) -> 'a list -> boolval exists : f:('a -> bool) -> 'a list -> boolval for_all2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> boolval exists2 : f:('a -> 'b -> bool) -> 'a list -> 'b list -> boolval mem : 'a -> set:'a list -> boolval memq : 'a -> set:'a list -> boolval find : f:('a -> bool) -> 'a list -> 'aval find_opt : f:('a -> bool) -> 'a list -> 'a optionval find_index : f:('a -> bool) -> 'a list -> int optionval find_mapi : f:(int -> 'a -> 'b option) -> 'a list -> 'b optionval filter : f:('a -> bool) -> 'a list -> 'a listval find_all : f:('a -> bool) -> 'a list -> 'a listval filteri : f:(int -> 'a -> bool) -> 'a list -> 'a listval take : int -> 'a list -> 'a listval drop : int -> 'a list -> 'a listval take_while : f:('a -> bool) -> 'a list -> 'a listval drop_while : f:('a -> bool) -> 'a list -> 'a listval partition : f:('a -> bool) -> 'a list -> 'a list * 'a listval assoc : 'a -> ('a * 'b) list -> 'bval assq : 'a -> ('a * 'b) list -> 'bval assq_opt : 'a -> ('a * 'b) list -> 'b optionval mem_assoc : 'a -> map:('a * 'b) list -> boolval mem_assq : 'a -> map:('a * 'b) list -> boolval sort : cmp:('a -> 'a -> int) -> 'a list -> 'a listval stable_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a listval fast_sort : cmp:('a -> 'a -> int) -> 'a list -> 'a listval sort_uniq : cmp:('a -> 'a -> int) -> 'a list -> 'a listval to_seq : 'a list -> 'a Stdlib.Seq.tval of_seq : 'a Stdlib.Seq.t -> 'a listinclude sig ... end
Sourceval merge : [> `not_tail_recursive ] Sourceval remove_assoc : [> `not_tail_recursive ] Sourceval remove_assq : [> `not_tail_recursive ] Sourceval rev_mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b t Sourceval fold_right2 :
'a list ->
'b list ->
init:'c ->
f:('a -> 'b -> 'c -> 'c) ->
'c Sourceval map : 'a list -> f:('a -> 'b) -> 'b list Sourceval mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b list Sourceval fold_right : 'a list -> init:'b -> f:('a -> 'b -> 'b) -> 'b Sourceval append : 'a list -> 'a list -> 'a list Sourceval concat : 'a list list -> 'a t Sourceval rev_combine : 'a list -> 'b list -> ('a * 'b) t Sourceval combine : 'a list -> 'b list -> ('a * 'b) list Sourceval split : ('a * 'b) list -> 'a t * 'b t Sourceval map2 : 'a list -> 'b list -> f:('a -> 'b -> 'c) -> 'c list Sourceval partition_map : ('a -> ('b, 'c) Either.t) -> 'a t -> 'b list * 'c list Sourceval init : len:int -> f:(int -> 'a) -> 'a list Sourceval rev_filter_opt : 'a option list -> 'a t Sourceval filter_opt : 'a option list -> 'a list Sourceval filter_map : 'a list -> f:('a -> 'b option) -> 'b t Sourceval concat_map : 'a list -> f:('a -> 'b list) -> 'b t Sourceval find_map : 'a t -> f:('a -> 'b option) -> 'b option Sourceval find_map_exn : 'a t -> f:('a -> 'b option) -> 'b Sourceval split_while : 'a t -> f:('a -> bool) -> 'a list * 'a t Sourceval find_a_dup : 'elt t -> compare:('elt -> 'elt -> int) -> 'elt option Sourceval assoc_opt : 'a -> ('a * 'b) list -> 'b option Sourceval iter : 'a list -> f:('a -> unit) -> unit