Module `Entry.Tbl`

type key = Dwarf_low.Address_table.Entry.T.t

type !'a t = 'a Stdlib.Hashtbl.Make(Dwarf_low.Address_table.Entry.T).t

val create : int -> 'a Dwarf_low.Address_table.Entry.Tbl.t

val clear : 'a Dwarf_low.Address_table.Entry.Tbl.t -> unit

val reset : 'a Dwarf_low.Address_table.Entry.Tbl.t -> unit

val copy : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  'a Dwarf_low.Address_table.Entry.Tbl.t

val add : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a ->
  unit

val remove : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  unit

val find : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a

val find_opt : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a option

val find_all : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a list

val replace : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a ->
  unit

val mem : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  bool

val iter : 
  (Dwarf_low.Address_table.Entry.Tbl.key -> 'a -> unit) ->
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  unit

val filter_map_inplace : 
  (Dwarf_low.Address_table.Entry.Tbl.key -> 'a -> 'a option) ->
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  unit

val fold : 
  (Dwarf_low.Address_table.Entry.Tbl.key -> 'a -> 'acc -> 'acc) ->
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  'acc ->
  'acc

val length : 'a Dwarf_low.Address_table.Entry.Tbl.t -> int

val stats : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Stdlib__Hashtbl.statistics

val to_seq : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  (Dwarf_low.Address_table.Entry.Tbl.key * 'a) Stdlib.Seq.t

val to_seq_keys : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  Dwarf_low.Address_table.Entry.Tbl.key Stdlib.Seq.t

val to_seq_values : 'a Dwarf_low.Address_table.Entry.Tbl.t -> 'a Stdlib.Seq.t

val add_seq : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  (Dwarf_low.Address_table.Entry.Tbl.key * 'a) Stdlib.Seq.t ->
  unit

val replace_seq : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  (Dwarf_low.Address_table.Entry.Tbl.key * 'a) Stdlib.Seq.t ->
  unit

val of_seq : 
  (Dwarf_low.Address_table.Entry.Tbl.key * 'a) Stdlib.Seq.t ->
  'a Dwarf_low.Address_table.Entry.Tbl.t

val to_list : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  (Dwarf_low.Address_table.Entry.T.t * 'a) list

val of_list : 
  (Dwarf_low.Address_table.Entry.T.t * 'a) list ->
  'a Dwarf_low.Address_table.Entry.Tbl.t

val to_map : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  'a Stdlib.Map.Make(Dwarf_low.Address_table.Entry.T).t

val of_map : 
  'a Stdlib.Map.Make(Dwarf_low.Address_table.Entry.T).t ->
  'a Dwarf_low.Address_table.Entry.Tbl.t

val memoize : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  (Dwarf_low.Address_table.Entry.Tbl.key -> 'a) ->
  Dwarf_low.Address_table.Entry.Tbl.key ->
  'a

val map : 
  'a Dwarf_low.Address_table.Entry.Tbl.t ->
  ('a -> 'b) ->
  'b Dwarf_low.Address_table.Entry.Tbl.t

Module Entry.Tbl

Module `Entry.Tbl`