Module Num.Map
val is_empty :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
boolval update :
Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
('a option -> 'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval merge :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a option ->
'b option ->
'c option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'c Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval union :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'a ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval union_sharing :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'a ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.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_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a option ->
'b ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval compare :
('a -> 'a -> int) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
intval equal :
('a -> 'a -> bool) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
boolval iter :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
unit) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
unitval fold :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'b ->
'b) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b ->
'bval for_all :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
bool) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
boolval exists :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
bool) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
boolval filter_map :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'b option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval filter_map_sharing :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval partition :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
bool) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t
* 'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval cardinal :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
intval bindings :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
listval min_binding_opt :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
optionval max_binding_opt :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
optionval choose_opt :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
optionval split :
Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t
* 'a option
* 'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval find_opt :
Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a optionval map :
('a -> 'b) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval print_debug :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
unitval of_list :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
list ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval disjoint_union :
?eq:('a -> 'a -> bool) ->
?print:(Stdlib.Format.formatter -> 'a -> unit) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval keys :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
Set.tval data :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a listval print :
(Stdlib.Format.formatter -> 'a -> unit) ->
Stdlib.Format.formatter ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
unitval inter :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'b ->
'c) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'c Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.tval diff :
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'b ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.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_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key ->
'a ->
'b ->
'a option) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'b Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.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_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
boolval get_singleton :
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
(Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.key * 'a)
optionval map_sharing :
('a -> 'a) ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t ->
'a Flambda2_simplify.Number_adjuncts.For_naked_immediates.Num.Map.t