Module Unit.Map
type key = Flambda2_term_basics.Unit.tmodule Set = Flambda2_term_basics.Unit.Setval empty : 'a Flambda2_term_basics.Unit.Map.tval is_empty : 'a Flambda2_term_basics.Unit.Map.t -> boolval mem :
Flambda2_term_basics.Unit.Map.key ->
'a Flambda2_term_basics.Unit.Map.t ->
boolval add :
Flambda2_term_basics.Unit.Map.key ->
'a ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval update :
Flambda2_term_basics.Unit.Map.key ->
('a option -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval singleton :
Flambda2_term_basics.Unit.Map.key ->
'a ->
'a Flambda2_term_basics.Unit.Map.tval remove :
Flambda2_term_basics.Unit.Map.key ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval merge :
(Flambda2_term_basics.Unit.Map.key -> 'a option -> 'b option -> 'c option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'c Flambda2_term_basics.Unit.Map.tval union :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'a -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval union_sharing :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'a -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tunion_sharing f m1 m2 is a version of union f m1 m2 that maximizes sharing of the result with m1.
union_shared f m1 m2 is a version of union_sharing f m1 m2 that also exploits sharing of m1 and m2 to avoid calling f when possible, assuming that f x x = Some x for all xs.
val update_many :
(Flambda2_term_basics.Unit.Map.key -> 'a option -> 'b -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval compare :
('a -> 'a -> int) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
intval equal :
('a -> 'a -> bool) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
boolval iter :
(Flambda2_term_basics.Unit.Map.key -> 'a -> unit) ->
'a Flambda2_term_basics.Unit.Map.t ->
unitval fold :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b -> 'b) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b ->
'bval for_all :
(Flambda2_term_basics.Unit.Map.key -> 'a -> bool) ->
'a Flambda2_term_basics.Unit.Map.t ->
boolval exists :
(Flambda2_term_basics.Unit.Map.key -> 'a -> bool) ->
'a Flambda2_term_basics.Unit.Map.t ->
boolval filter :
(Flambda2_term_basics.Unit.Map.key -> 'a -> bool) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval filter_map :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.tval filter_map_sharing :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval partition :
(Flambda2_term_basics.Unit.Map.key -> 'a -> bool) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t * 'a Flambda2_term_basics.Unit.Map.tval cardinal : 'a Flambda2_term_basics.Unit.Map.t -> intval bindings :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) listval min_binding :
'a Flambda2_term_basics.Unit.Map.t ->
Flambda2_term_basics.Unit.Map.key * 'aval min_binding_opt :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) optionval max_binding :
'a Flambda2_term_basics.Unit.Map.t ->
Flambda2_term_basics.Unit.Map.key * 'aval max_binding_opt :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) optionval choose :
'a Flambda2_term_basics.Unit.Map.t ->
Flambda2_term_basics.Unit.Map.key * 'aval choose_opt :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) optionval split :
Flambda2_term_basics.Unit.Map.key ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t
* 'a option
* 'a Flambda2_term_basics.Unit.Map.tval find :
Flambda2_term_basics.Unit.Map.key ->
'a Flambda2_term_basics.Unit.Map.t ->
'aval find_opt :
Flambda2_term_basics.Unit.Map.key ->
'a Flambda2_term_basics.Unit.Map.t ->
'a optionval map :
('a -> 'b) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.tval mapi :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.tval to_seq :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) Stdlib.Seq.tval print_debug :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a Flambda2_term_basics.Unit.Map.t ->
unitval of_list :
(Flambda2_term_basics.Unit.Map.key * 'a) list ->
'a Flambda2_term_basics.Unit.Map.tval disjoint_union :
?eq:('a -> 'a -> bool) ->
?print:(Stdlib.Format.formatter -> 'a -> unit) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval map_keys :
(Flambda2_term_basics.Unit.Map.key -> Flambda2_term_basics.Unit.Map.key) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval keys : 'a Flambda2_term_basics.Unit.Map.t -> Set.tval data : 'a Flambda2_term_basics.Unit.Map.t -> 'a listval of_set :
(Flambda2_term_basics.Unit.Map.key -> 'a) ->
Set.t ->
'a Flambda2_term_basics.Unit.Map.tval print :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a Flambda2_term_basics.Unit.Map.t ->
unitval diff_domains :
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval inter :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b -> 'c) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'c Flambda2_term_basics.Unit.Map.tval diff :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tdiff f m1 m2 computes a map whose keys are a subset of the keys of m1. When a binding is defined in both m1 and m2, the function f is used to combine them. Bindings that are only present in m1 are preserved. This is a special case of merge: diff f m1 m2 is equivalent to merge f' m1 m2, where
f' _key None _ = Nonef' _key (Some v) None = Some vf' key (Some v1) (Some v2) = f key v1 v2
val diff_sharing :
(Flambda2_term_basics.Unit.Map.key -> 'a -> 'b -> 'a option) ->
'a Flambda2_term_basics.Unit.Map.t ->
'b Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tdiff_sharing f m1 m2 is a version of diff f m1 m2 that maximizes sharing of the result with m1.
diff_shared f m1 m2 is a version of diff_sharing f m1 m2 that further exploits sharing of m1 and m2 to avoid calling f when possible, assuming that f x x always returns None.
val inter_domain_is_non_empty :
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t ->
boolval get_singleton :
'a Flambda2_term_basics.Unit.Map.t ->
(Flambda2_term_basics.Unit.Map.key * 'a) optionval replace :
Flambda2_term_basics.Unit.Map.key ->
('a -> 'a) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.tval map_sharing :
('a -> 'a) ->
'a Flambda2_term_basics.Unit.Map.t ->
'a Flambda2_term_basics.Unit.Map.t