Regalloc_interf_graph.EdgeSet
Legacy representation for edge sets.
The implementation is based on a hash table built by applying `Hashtbl.Make` to the `Edge` module above.
type t
val make : num_registers:int -> t
val clear : t -> unit
val mem : t -> Edge.t -> bool
val add : t -> Edge.t -> unit
val capacity : t -> int
module For_debug : sig ... end