Parameter GenMapTop.M

type key = Domain.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val idempotent_union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val nonidempotent_union : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val idempotent_inter : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val nonidempotent_inter : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val idempotent_inter_filter : ('a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val nonidempotent_inter_filter : ('a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val difference : ('a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val reflexive_compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val reflexive_equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val reflexive_subset_domain_for_all2 : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val choose : 'a t -> key * 'a
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val map : ('a -> 'a) -> 'a t -> 'a t
val mapi : (key -> 'a -> 'a) -> 'a t -> 'a t