Module `Shape.Cache`

type key = Shape.t

type !'a t

val create : int -> 'a Shape.Cache.t

val clear : 'a Shape.Cache.t -> unit

val reset : 'a Shape.Cache.t -> unit

val copy : 'a Shape.Cache.t -> 'a Shape.Cache.t

val add : 'a Shape.Cache.t -> Shape.Cache.key -> 'a -> unit

val remove : 'a Shape.Cache.t -> Shape.Cache.key -> unit

val find : 'a Shape.Cache.t -> Shape.Cache.key -> 'a

val find_opt : 'a Shape.Cache.t -> Shape.Cache.key -> 'a option

val find_all : 'a Shape.Cache.t -> Shape.Cache.key -> 'a list

val replace : 'a Shape.Cache.t -> Shape.Cache.key -> 'a -> unit

val mem : 'a Shape.Cache.t -> Shape.Cache.key -> bool

val iter : (Shape.Cache.key -> 'a -> unit) -> 'a Shape.Cache.t -> unit

val filter_map_inplace : 
  (Shape.Cache.key -> 'a -> 'a option) ->
  'a Shape.Cache.t ->
  unit

val fold : 
  (Shape.Cache.key -> 'a -> 'acc -> 'acc) ->
  'a Shape.Cache.t ->
  'acc ->
  'acc

val length : 'a Shape.Cache.t -> int

val stats : 'a Shape.Cache.t -> Stdlib.Hashtbl.statistics

val to_seq : 'a Shape.Cache.t -> (Shape.Cache.key * 'a) Stdlib.Seq.t

val to_seq_keys : _ Shape.Cache.t -> Shape.Cache.key Stdlib.Seq.t

val to_seq_values : 'a Shape.Cache.t -> 'a Stdlib.Seq.t

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

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

val of_seq : (Shape.Cache.key * 'a) Stdlib.Seq.t -> 'a Shape.Cache.t

Module Shape.Cache