Module `Entry.Set`

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

type t = Stdlib.Set.Make(Dwarf_low.Address_table.Entry.T).t

val empty : Dwarf_low.Address_table.Entry.Set.t

val add : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val singleton : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t

val remove : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val union : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val inter : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val disjoint : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val diff : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val cardinal : Dwarf_low.Address_table.Entry.Set.t -> int

val elements : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt list

val min_elt : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val min_elt_opt : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val max_elt : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val max_elt_opt : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val choose : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val choose_opt : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val find : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val find_opt : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val find_first : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val find_first_opt : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val find_last : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt

val find_last_opt : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt option

val iter : 
  (Dwarf_low.Address_table.Entry.Set.elt -> unit) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  unit

val fold : 
  (Dwarf_low.Address_table.Entry.Set.elt -> 'acc -> 'acc) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  'acc ->
  'acc

val filter : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val filter_map : 
  (Dwarf_low.Address_table.Entry.Set.elt ->
    Dwarf_low.Address_table.Entry.Set.elt option) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val partition : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t * Dwarf_low.Address_table.Entry.Set.t

val split : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t
  * bool
  * Dwarf_low.Address_table.Entry.Set.t

val is_empty : Dwarf_low.Address_table.Entry.Set.t -> bool

val mem : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val equal : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val compare : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  int

val subset : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val for_all : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val exists : 
  (Dwarf_low.Address_table.Entry.Set.elt -> bool) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  bool

val to_list : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt list

val to_seq_from : 
  Dwarf_low.Address_table.Entry.Set.elt ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt Stdlib.Seq.t

val to_seq : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt Stdlib.Seq.t

val to_rev_seq : 
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.elt Stdlib.Seq.t

val add_seq : 
  Dwarf_low.Address_table.Entry.Set.elt Stdlib.Seq.t ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

val of_seq : 
  Dwarf_low.Address_table.Entry.Set.elt Stdlib.Seq.t ->
  Dwarf_low.Address_table.Entry.Set.t

val output : Stdlib.out_channel -> Dwarf_low.Address_table.Entry.Set.t -> unit

val print : 
  Stdlib.Format.formatter ->
  Dwarf_low.Address_table.Entry.Set.t ->
  unit

val to_string : Dwarf_low.Address_table.Entry.Set.t -> string

val of_list : 
  Dwarf_low.Address_table.Entry.Set.elt list ->
  Dwarf_low.Address_table.Entry.Set.t

val map : 
  (Dwarf_low.Address_table.Entry.Set.elt ->
    Dwarf_low.Address_table.Entry.Set.elt) ->
  Dwarf_low.Address_table.Entry.Set.t ->
  Dwarf_low.Address_table.Entry.Set.t

Module Entry.Set

Module `Entry.Set`