Module Ser_names.MindmapSource
include CSig.MapS with type key = MutInd.t with type 'a t = 'a Names.Mindmap.t
Sourcetype 'a t = 'a Names.Mindmap.t val is_empty : 'a t -> boolval mem : key -> 'a t -> boolval add : key -> 'a -> 'a t -> 'a tval update : key -> ('a option -> 'a option) -> 'a t -> 'a tval singleton : key -> 'a -> 'a tval remove : key -> 'a t -> 'a tval merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t ->
'b t ->
'c tval union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a tval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> boolval iter : (key -> 'a -> unit) -> 'a t -> unitval fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'bval for_all : (key -> 'a -> bool) -> 'a t -> boolval exists : (key -> 'a -> bool) -> 'a t -> boolval filter : (key -> 'a -> bool) -> 'a t -> 'a tval partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a tval cardinal : 'a t -> intval bindings : 'a t -> (key * 'a) listval min_binding : 'a t -> key * 'aval max_binding : 'a t -> key * 'aval choose : 'a t -> key * 'aval choose_opt : 'a t -> (key * 'a) optionval split : key -> 'a t -> 'a t * 'a option * 'a tval find : key -> 'a t -> 'aval find_opt : key -> 'a t -> 'a optionval map : ('a -> 'b) -> 'a t -> 'b tval mapi : (key -> 'a -> 'b) -> 'a t -> 'b tinclude SerType.SJHC1 with type 'a t := 'a t
include Ppx_hash_lib.Hashable.S1 with type 'a t := 'a t
Sourceval hash_fold_t :
'a Base__Ppx_hash_lib.hash_fold ->
'a t Base__Ppx_hash_lib.hash_fold include Ppx_compare_lib.Comparable.S1 with type 'a t := 'a t
Sourceval compare :
'a Base__Ppx_compare_lib.compare ->
'a t Base__Ppx_compare_lib.compare