You can search for identifiers within the package.
in-package search v0.2.0
module M : Map.S
type 'a map = 'a M.t
type key = M.key
val empty : 'a map
val is_empty : 'a map -> bool
val mem : key -> 'a map -> bool
val add : key -> 'a -> 'a map -> 'a map
val update : key -> ('a option -> 'a option) -> 'a map -> 'a map
val singleton : key -> 'a -> 'a map
val remove : key -> 'a map -> 'a map
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a map -> 'b map -> 'c map
val union : (key -> 'a -> 'a -> 'a option) -> 'a map -> 'a map -> 'a map
val compare : ('a -> 'a -> int) -> 'a map -> 'a map -> int
val equal : ('a -> 'a -> bool) -> 'a map -> 'a map -> bool
val iter : (key -> 'a -> unit) -> 'a map -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a map -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a map -> bool
val exists : (key -> 'a -> bool) -> 'a map -> bool
val filter : (key -> 'a -> bool) -> 'a map -> 'a map
val partition : (key -> 'a -> bool) -> 'a map -> 'a map * 'a map
val cardinal : 'a map -> int
val bindings : 'a map -> (key * 'a) list
val min_binding : 'a map -> key * 'a
val min_binding_opt : 'a map -> (key * 'a) option
val max_binding : 'a map -> key * 'a
val max_binding_opt : 'a map -> (key * 'a) option
val choose : 'a map -> key * 'a
val choose_opt : 'a map -> (key * 'a) option
val split : key -> 'a map -> 'a map * 'a option * 'a map
val find : key -> 'a map -> 'a
val find_opt : key -> 'a map -> 'a option
val find_first : (key -> bool) -> 'a map -> key * 'a
val find_first_opt : (key -> bool) -> 'a map -> (key * 'a) option
val find_last : (key -> bool) -> 'a map -> key * 'a
val find_last_opt : (key -> bool) -> 'a map -> (key * 'a) option
val map : ('a -> 'b) -> 'a map -> 'b map
val mapi : (key -> 'a -> 'b) -> 'a map -> 'b map
val to_seq : 'a map -> (key * 'a) t
val of_seq : (key * 'a) t -> 'a map
val keys : 'a map -> key t
val values : 'a map -> 'a t