You can search for identifiers within the package.
in-package search v0.2.0
include module type of struct include Stdlib.List end
type !'a t = 'a list =
| []
| :: of 'a * 'a list
val length : 'a list -> int
val compare_lengths : 'a list -> 'b list -> int
val compare_length_with : 'a list -> int -> int
val cons : 'a -> 'a list -> 'a list
val hd : 'a list -> 'a
val tl : 'a list -> 'a list
val nth : 'a list -> int -> 'a
val nth_opt : 'a list -> int -> 'a option
val rev : 'a list -> 'a list
val init : int -> (int -> 'a) -> '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 equal : ('a -> 'a -> bool) -> 'a list -> 'a list -> bool
val compare : ('a -> 'a -> int) -> 'a list -> 'a list -> int
val iter : ('a -> unit) -> 'a list -> unit
val iteri : (int -> 'a -> unit) -> 'a list -> unit
val rev_map : ('a -> 'b) -> 'a list -> 'b list
val filter_map : ('a -> 'b option) -> 'a list -> 'b list
val concat_map : ('a -> 'b list) -> 'a list -> 'b list
val fold_left_map : ('a -> 'b -> 'a * 'c) -> 'a -> 'b list -> 'a * 'c list
val fold_left : ('a -> 'b -> 'a) -> 'a -> 'b list -> 'a
val fold_right : ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b
val iter2 : ('a -> 'b -> unit) -> 'a list -> 'b list -> unit
val rev_map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list
val fold_left2 : ('a -> 'b -> 'c -> 'a) -> 'a -> 'b list -> 'c list -> 'a
val fold_right2 : ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c
val for_all : ('a -> bool) -> 'a list -> bool
val exists : ('a -> bool) -> 'a list -> bool
val for_all2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val exists2 : ('a -> 'b -> bool) -> 'a list -> 'b list -> bool
val mem : 'a -> 'a list -> bool
val memq : 'a -> 'a list -> bool
val find : ('a -> bool) -> 'a list -> 'a
val find_opt : ('a -> bool) -> 'a list -> 'a option
val find_map : ('a -> 'b option) -> 'a list -> 'b option
val filter : ('a -> bool) -> 'a list -> 'a list
val find_all : ('a -> bool) -> 'a list -> 'a list
val filteri : (int -> 'a -> bool) -> 'a list -> 'a list
val partition : ('a -> bool) -> 'a list -> 'a list * 'a list
val partition_map : ('a -> ('b, 'c) Stdlib.Either.t) -> 'a list -> 'b list * 'c list
val assoc : 'a -> ('a * 'b) list -> 'b
val assoc_opt : 'a -> ('a * 'b) list -> 'b option
val assq : 'a -> ('a * 'b) list -> 'b
val assq_opt : 'a -> ('a * 'b) list -> 'b option
val mem_assoc : 'a -> ('a * 'b) list -> bool
val mem_assq : 'a -> ('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 : ('a -> 'a -> int) -> 'a list -> 'a list
val stable_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val fast_sort : ('a -> 'a -> int) -> 'a list -> 'a list
val sort_uniq : ('a -> 'a -> int) -> 'a list -> 'a list
val merge : ('a -> 'a -> int) -> 'a list -> 'a list -> 'a list
val to_seq : 'a list -> 'a Stdlib.Seq.t
val of_seq : 'a Stdlib.Seq.t -> 'a list
module List = Stdlib.List
val get_heads_and_tails : 'a t t -> 'a list * 'a list list
val mapn : ('a list -> 'b) -> 'a t t -> 'c t
val fold_left2_opt : ('a -> 'b -> 'c -> 'd) -> 'e -> 'f t -> 'g t -> 'h
val fold_left3 : ('a -> 'b -> 'c -> 'd -> 'e) -> 'f -> 'g t -> 'h t -> 'i t -> 'j
val fold_left4 : ('a -> 'b -> 'c -> 'd -> 'e -> 'f) -> 'g -> 'h t -> 'i t -> 'j t -> 'k t -> 'l
val fold_left5 : ('a -> 'b -> 'c -> 'd -> 'e -> 'f -> 'g) -> 'h -> 'i t -> 'j t -> 'k t -> 'l t -> 'm t -> 'n
val fold_left6 : ('a -> 'b -> 'c -> 'd -> 'e -> 'f -> 'g -> 'h) -> 'i -> 'j t -> 'k t -> 'l t -> 'm t -> 'n t -> 'o t -> 'p
val split_n : int -> 'a t -> 'a list * 'a t
val split_in_half : 'a t -> 'a list * 'a t
val map : ('a -> 'b) -> 'a list -> 'c list
val map2 : ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'd list
val rev_mapi : (int -> 'a -> 'b) -> 'c t -> 'd t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'c list
val map2_opt : ('a -> 'b -> 'c) -> 'd t -> 'e t -> 'e t
val safe_combine : 'a t -> 'b t -> ('a * 'b) list
exception Internal
val rev_flatten : 'a list t -> 'b t
val flatten : 'a list t -> 'b list
val shuffle : ?seed:int -> 'a list -> 'b list
val transpose : 'a list t -> 'a list list