Module `Pair.Map`

type key = Dwarf_low.Address_index.Pair.T.t

type !'a t = 'a Stdlib.Map.Make(Dwarf_low.Address_index.Pair.T).t

val empty : 'a Dwarf_low.Address_index.Pair.Map.t

val add : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val add_to_list : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a ->
  'a list Dwarf_low.Address_index.Pair.Map.t ->
  'a list Dwarf_low.Address_index.Pair.Map.t

val update : 
  Dwarf_low.Address_index.Pair.Map.key ->
  ('a option -> 'a option) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val singleton : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a ->
  'a Dwarf_low.Address_index.Pair.Map.t

val remove : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

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

val union : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> 'a -> 'a option) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val cardinal : 'a Dwarf_low.Address_index.Pair.Map.t -> int

val bindings : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) list

val min_binding : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key * 'a

val min_binding_opt : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) option

val max_binding : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key * 'a

val max_binding_opt : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) option

val choose : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key * 'a

val choose_opt : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) option

val find : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a

val find_opt : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a option

val find_first : 
  (Dwarf_low.Address_index.Pair.Map.key -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key * 'a

val find_first_opt : 
  (Dwarf_low.Address_index.Pair.Map.key -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) option

val find_last : 
  (Dwarf_low.Address_index.Pair.Map.key -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key * 'a

val find_last_opt : 
  (Dwarf_low.Address_index.Pair.Map.key -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) option

val iter : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> unit) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  unit

val fold : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> 'acc -> 'acc) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'acc ->
  'acc

val map : 
  ('a -> 'b) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'b Dwarf_low.Address_index.Pair.Map.t

val mapi : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> 'b) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'b Dwarf_low.Address_index.Pair.Map.t

val filter : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val filter_map : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> 'b option) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'b Dwarf_low.Address_index.Pair.Map.t

val partition : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t * 'a Dwarf_low.Address_index.Pair.Map.t

val split : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t
  * 'a option
  * 'a Dwarf_low.Address_index.Pair.Map.t

val is_empty : 'a Dwarf_low.Address_index.Pair.Map.t -> bool

val mem : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  bool

val equal : 
  ('a -> 'a -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  bool

val compare : 
  ('a -> 'a -> int) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  int

val for_all : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  bool

val exists : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a -> bool) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  bool

val to_list : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) list

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

val to_rev_seq : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) Stdlib.Seq.t

val to_seq_from : 
  Dwarf_low.Address_index.Pair.Map.key ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  (Dwarf_low.Address_index.Pair.Map.key * 'a) Stdlib.Seq.t

val add_seq : 
  (Dwarf_low.Address_index.Pair.Map.key * 'a) Stdlib.Seq.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val of_seq : 
  (Dwarf_low.Address_index.Pair.Map.key * 'a) Stdlib.Seq.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val of_list : 
  (Dwarf_low.Address_index.Pair.Map.key * 'a) list ->
  'a Dwarf_low.Address_index.Pair.Map.t

type !'a duplicate =

| Duplicate of {
1. key : Dwarf_low.Address_index.Pair.Map.key;
2. value1 : 'a;
3. value2 : 'a;
}

val of_list_checked : 
  (Dwarf_low.Address_index.Pair.Map.key * 'a) list ->
  ('a Dwarf_low.Address_index.Pair.Map.t,
    'a Dwarf_low.Address_index.Pair.Map.duplicate)
    Stdlib.Result.t

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

val union_right : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val union_left : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val union_merge : 
  ('a -> 'a -> 'a) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val rename : 
  Dwarf_low.Address_index.Pair.Map.key Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key ->
  Dwarf_low.Address_index.Pair.Map.key

val map_keys : 
  (Dwarf_low.Address_index.Pair.Map.key ->
    Dwarf_low.Address_index.Pair.Map.key) ->
  'a Dwarf_low.Address_index.Pair.Map.t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val keys : 
  'a Dwarf_low.Address_index.Pair.Map.t ->
  Stdlib.Set.Make(Dwarf_low.Address_index.Pair.T).t

val data : 'a Dwarf_low.Address_index.Pair.Map.t -> 'a list

val of_set : 
  (Dwarf_low.Address_index.Pair.Map.key -> 'a) ->
  Stdlib.Set.Make(Dwarf_low.Address_index.Pair.T).t ->
  'a Dwarf_low.Address_index.Pair.Map.t

val transpose_keys_and_data : 
  Dwarf_low.Address_index.Pair.Map.key Dwarf_low.Address_index.Pair.Map.t ->
  Dwarf_low.Address_index.Pair.Map.key Dwarf_low.Address_index.Pair.Map.t

val transpose_keys_and_data_set : 
  Dwarf_low.Address_index.Pair.Map.key Dwarf_low.Address_index.Pair.Map.t ->
  Stdlib.Set.Make(Dwarf_low.Address_index.Pair.T).t
    Dwarf_low.Address_index.Pair.Map.t

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

Module Pair.Map

Module `Pair.Map`