Gen_map.Mmakemodule K : sig ... endmodule Ordered : sig ... endmodule Map : sig ... endmodule Facts : sig ... endtype 't t = 't Map.tval empty : 'a1 tval is_empty : 'a1 t -> boolval get : 'a1 t -> Eqtype.Equality.sort -> 'a1 optionval set : 'a1 t -> Eqtype.Equality.sort -> 'a1 -> 'a1 Map.tval remove : 'a1 t -> Eqtype.Equality.sort -> 'a1 Map.tval raw_map2 :
(Eqtype.Equality.sort -> 'a1 option -> 'a2 option -> 'a3 option) ->
'a1 Map.Raw.tree ->
'a2 Map.Raw.tree ->
'a3 Map.Raw.treeval all_t : (Eqtype.Equality.sort -> 'a1 -> bool) -> 'a1 Map.Raw.tree -> boolval has_t : (Eqtype.Equality.sort -> 'a1 -> bool) -> 'a1 Map.Raw.tree -> boolval incl_t :
(Eqtype.Equality.sort -> 'a1 -> bool) ->
(Eqtype.Equality.sort -> 'a1 -> 'a2 -> bool) ->
'a1 Map.Raw.tree ->
'a2 Map.Raw.tree ->
boolval all : (Eqtype.Equality.sort -> 'a1 -> bool) -> 'a1 t -> boolval has : (Eqtype.Equality.sort -> 'a1 -> bool) -> 'a1 t -> boolval incl_def :
(Eqtype.Equality.sort -> 'a1 -> bool) ->
(Eqtype.Equality.sort -> 'a1 -> 'a2 -> bool) ->
'a1 Map.bst ->
'a2 Map.bst ->
boolval incl :
(Eqtype.Equality.sort -> 'a1 -> 'a2 -> bool) ->
'a1 Map.bst ->
'a2 Map.bst ->
boolval in_codom :
Eqtype.Equality.coq_type ->
Eqtype.Equality.sort ->
Eqtype.Equality.sort t ->
boolval map2 :
(Eqtype.Equality.sort -> 'a1 option -> 'a2 option -> 'a3 option) ->
'a1 t ->
'a2 t ->
'a3 tval filter_map : (Eqtype.Equality.sort -> 'a1 -> 'a2 option) -> 'a1 t -> 'a2 tval is_emptyP : 'a1 t -> Bool.reflectval elementsP :
Eqtype.Equality.coq_type ->
(Eqtype.Equality.sort * Eqtype.Equality.sort) ->
Eqtype.Equality.sort t ->
Bool.reflect