Identifiable.Map(3) OCaml library Identifiable.Map(3)

# [NAME](#NAME)

Identifiable.Map - no description

# [Module type](#Module_type)

Module type Identifiable.Map

# [Documentation](#Documentation)

Module type **Map**  
\= **sig end**

*module T :* **Map.OrderedType**

*include Map.S*

*val of\_list* : **(key * 'a) list -> 'a t**

*val disjoint\_union* : **?eq:('a -> 'a -> bool) ->** **?print:(Format.formatter -> 'a -> unit) -> 'a t -> 'a t -> 'a t**

**disjoint\_union m1 m2** contains all bindings from **m1** and **m2** . If some binding is present in both and the associated value is not equal, a Fatal\_error is raised

*val union\_right* : **'a t -> 'a t -> 'a t**

**union\_right m1 m2** contains all bindings from **m1** and **m2** . If some binding is present in both, the one from **m2** is taken

*val union\_left* : **'a t -> 'a t -> 'a t**

**union\_left m1 m2 = union\_right m2 m1**

*val union\_merge* : **('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t**

*val rename* : **key t -> key -> key**

*val map\_keys* : **(key -> key) -> 'a t -> 'a t**

*val keys* : **'a t -> Stdlib.Set.Make(T).t**

*val data* : **'a t -> 'a list**

*val of\_set* : **(key -> 'a) -> Stdlib.Set.Make(T).t -> 'a t**

*val transpose\_keys\_and\_data* : **key t -> key t**

*val transpose\_keys\_and\_data\_set* : **key t -> Stdlib.Set.Make(T).t t**

*val print* : **(Format.formatter -> 'a -> unit) ->** **Format.formatter -> 'a t -> unit**

2026-10-23 OCamldoc

---

Document: Identifiable.Map(3o) from ocaml 5.5.2-r0 (Chainguard OS)
Source: https://github.com/ocaml/ocaml