Module `C2.Map`

include Flambda2_algorithms.Container_types_intf.Map
  with type key = C2.t
  with module Set = C2.Set

type key = C2.t

module Set = C2.Set

type !+'a t

val empty : 'a C2.Map.t

val is_empty : 'a C2.Map.t -> bool

val mem : C2.Map.key -> 'a C2.Map.t -> bool

val add : C2.Map.key -> 'a -> 'a C2.Map.t -> 'a C2.Map.t

val update : 
  C2.Map.key ->
  ('a option -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t

val singleton : C2.Map.key -> 'a -> 'a C2.Map.t

val remove : C2.Map.key -> 'a C2.Map.t -> 'a C2.Map.t

val merge : 
  (C2.Map.key -> 'a option -> 'b option -> 'c option) ->
  'a C2.Map.t ->
  'b C2.Map.t ->
  'c C2.Map.t

val union : 
  (C2.Map.key -> 'a -> 'a -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t ->
  'a C2.Map.t

val union_sharing : 
  (C2.Map.key -> 'a -> 'a -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t ->
  'a C2.Map.t

union_sharing f m1 m2 is a version of union f m1 m2 that maximizes sharing of the result with m1.

val union_shared : 
  (C2.Map.key -> 'a -> 'a -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t ->
  'a C2.Map.t

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 : 
  (C2.Map.key -> 'a option -> 'b -> 'a option) ->
  'a C2.Map.t ->
  'b C2.Map.t ->
  'a C2.Map.t

val compare : ('a -> 'a -> int) -> 'a C2.Map.t -> 'a C2.Map.t -> int

val equal : ('a -> 'a -> bool) -> 'a C2.Map.t -> 'a C2.Map.t -> bool

val iter : (C2.Map.key -> 'a -> unit) -> 'a C2.Map.t -> unit

val fold : (C2.Map.key -> 'a -> 'b -> 'b) -> 'a C2.Map.t -> 'b -> 'b

val for_all : (C2.Map.key -> 'a -> bool) -> 'a C2.Map.t -> bool

val exists : (C2.Map.key -> 'a -> bool) -> 'a C2.Map.t -> bool

val filter : (C2.Map.key -> 'a -> bool) -> 'a C2.Map.t -> 'a C2.Map.t

val filter_map : (C2.Map.key -> 'a -> 'b option) -> 'a C2.Map.t -> 'b C2.Map.t

val filter_map_sharing : 
  (C2.Map.key -> 'a -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t

val partition : 
  (C2.Map.key -> 'a -> bool) ->
  'a C2.Map.t ->
  'a C2.Map.t * 'a C2.Map.t

val cardinal : 'a C2.Map.t -> int

val bindings : 'a C2.Map.t -> (C2.Map.key * 'a) list

val min_binding : 'a C2.Map.t -> C2.Map.key * 'a

val min_binding_opt : 'a C2.Map.t -> (C2.Map.key * 'a) option

val max_binding : 'a C2.Map.t -> C2.Map.key * 'a

val max_binding_opt : 'a C2.Map.t -> (C2.Map.key * 'a) option

val choose : 'a C2.Map.t -> C2.Map.key * 'a

val choose_opt : 'a C2.Map.t -> (C2.Map.key * 'a) option

val split : C2.Map.key -> 'a C2.Map.t -> 'a C2.Map.t * 'a option * 'a C2.Map.t

val find : C2.Map.key -> 'a C2.Map.t -> 'a

val find_opt : C2.Map.key -> 'a C2.Map.t -> 'a option

val map : ('a -> 'b) -> 'a C2.Map.t -> 'b C2.Map.t

val mapi : (C2.Map.key -> 'a -> 'b) -> 'a C2.Map.t -> 'b C2.Map.t

val to_seq : 'a C2.Map.t -> (C2.Map.key * 'a) Stdlib.Seq.t

val print_debug : 
  (Stdlib.Format.formatter -> 'a -> unit) ->
  Stdlib.Format.formatter ->
  'a C2.Map.t ->
  unit

val of_list : (C2.Map.key * 'a) list -> 'a C2.Map.t

val disjoint_union : 
  ?eq:('a -> 'a -> bool) ->
  ?print:(Stdlib.Format.formatter -> 'a -> unit) ->
  'a C2.Map.t ->
  'a C2.Map.t ->
  'a C2.Map.t

val map_keys : (C2.Map.key -> C2.Map.key) -> 'a C2.Map.t -> 'a C2.Map.t

val keys : 'a C2.Map.t -> Set.t

val data : 'a C2.Map.t -> 'a list

val of_set : (C2.Map.key -> 'a) -> Set.t -> 'a C2.Map.t

val print : 
  (Stdlib.Format.formatter -> 'a -> unit) ->
  Stdlib.Format.formatter ->
  'a C2.Map.t ->
  unit

val diff_domains : 'a C2.Map.t -> 'b C2.Map.t -> 'a C2.Map.t

val inter : 
  (C2.Map.key -> 'a -> 'b -> 'c) ->
  'a C2.Map.t ->
  'b C2.Map.t ->
  'c C2.Map.t

val diff : 
  (C2.Map.key -> 'a -> 'b -> 'a option) ->
  'a C2.Map.t ->
  'b C2.Map.t ->
  'a C2.Map.t

diff 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 _ = None
f' _key (Some v) None = Some v
f' key (Some v1) (Some v2) = f key v1 v2

val diff_sharing : 
  (C2.Map.key -> 'a -> 'b -> 'a option) ->
  'a C2.Map.t ->
  'b C2.Map.t ->
  'a C2.Map.t

diff_sharing f m1 m2 is a version of diff f m1 m2 that maximizes sharing of the result with m1.

val diff_shared : 
  (C2.Map.key -> 'a -> 'a -> 'a option) ->
  'a C2.Map.t ->
  'a C2.Map.t ->
  'a C2.Map.t

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 C2.Map.t -> 'a C2.Map.t -> bool

val get_singleton : 'a C2.Map.t -> (C2.Map.key * 'a) option

val replace : C2.Map.key -> ('a -> 'a) -> 'a C2.Map.t -> 'a C2.Map.t

val map_sharing : ('a -> 'a) -> 'a C2.Map.t -> 'a C2.Map.t

type 'a iterator

An 'a iterator iterates over the values in a 'a t map in increasing order.

val iterator : 'a C2.Map.t -> 'a C2.Map.iterator

iterator t returns an iterator for all the bindings in t, initially positioned on min_binding t.

val current : 'a C2.Map.iterator -> (C2.Map.key * 'a) option

current iterator returns the key-value pair at the current position, or None if the iterator is exhausted.

val advance : 'a C2.Map.iterator -> 'a C2.Map.iterator

advance iterator position the iterator on the next key.

val seek : 'a C2.Map.iterator -> C2.Map.key -> 'a C2.Map.iterator

seek iterator key positions the iterator on the next key higher or equal to the provided key.

Note: does nothing if key is less than or equal to the current key.

Module C2.Map

Module `C2.Map`