Module `Btype.TypeHash`

include Stdlib.Hashtbl.S with type key = Types.transient_expr

type key = Types.transient_expr

type !'a t

val create : int -> 'a Btype.TypeHash.t

val clear : 'a Btype.TypeHash.t -> unit

val reset : 'a Btype.TypeHash.t -> unit

val copy : 'a Btype.TypeHash.t -> 'a Btype.TypeHash.t

val find_all : 'a Btype.TypeHash.t -> Btype.TypeHash.key -> 'a list

val filter_map_inplace : 
  (Btype.TypeHash.key -> 'a -> 'a option) ->
  'a Btype.TypeHash.t ->
  unit

val fold : 
  (Btype.TypeHash.key -> 'a -> 'acc -> 'acc) ->
  'a Btype.TypeHash.t ->
  'acc ->
  'acc

val length : 'a Btype.TypeHash.t -> int

val stats : 'a Btype.TypeHash.t -> Stdlib.Hashtbl.statistics

val to_seq : 'a Btype.TypeHash.t -> (Btype.TypeHash.key * 'a) Stdlib.Seq.t

val to_seq_keys : _ Btype.TypeHash.t -> Btype.TypeHash.key Stdlib.Seq.t

val to_seq_values : 'a Btype.TypeHash.t -> 'a Stdlib.Seq.t

val add_seq : 
  'a Btype.TypeHash.t ->
  (Btype.TypeHash.key * 'a) Stdlib.Seq.t ->
  unit

val replace_seq : 
  'a Btype.TypeHash.t ->
  (Btype.TypeHash.key * 'a) Stdlib.Seq.t ->
  unit

val of_seq : (Btype.TypeHash.key * 'a) Stdlib.Seq.t -> 'a Btype.TypeHash.t

val mem : 'a Btype.TypeHash.t -> Types.type_expr -> bool

val add : 'a Btype.TypeHash.t -> Types.type_expr -> 'a -> unit

val replace : 'a Btype.TypeHash.t -> Types.type_expr -> 'a -> unit

val remove : 'a Btype.TypeHash.t -> Types.type_expr -> unit

val find : 'a Btype.TypeHash.t -> Types.type_expr -> 'a

val find_opt : 'a Btype.TypeHash.t -> Types.type_expr -> 'a option

val iter : (Types.type_expr -> 'a -> unit) -> 'a Btype.TypeHash.t -> unit

Module Btype.TypeHash