`sig
module Key : Key
type 'a t
val create : ?min_size:int -> ('a -> 'a -> int) -> 'a Hash_heap.S.t
val copy : 'a Hash_heap.S.t -> 'a Hash_heap.S.t
val push :
'a Hash_heap.S.t ->
key:Key.t -> data:'a -> [ `Key_already_present | `Ok ]
val push_exn : 'a Hash_heap.S.t -> key:Key.t -> data:'a -> unit
val replace : 'a Hash_heap.S.t -> key:Key.t -> data:'a -> unit
val remove : 'a Hash_heap.S.t -> Key.t -> unit
val mem : 'a Hash_heap.S.t -> Key.t -> bool
val top : 'a Hash_heap.S.t -> 'a option
val top_exn : 'a Hash_heap.S.t -> 'a
val top_with_key : 'a Hash_heap.S.t -> (Key.t * 'a) option
val top_with_key_exn : 'a Hash_heap.S.t -> Key.t * 'a
val pop_with_key : 'a Hash_heap.S.t -> (Key.t * 'a) option
val pop_with_key_exn : 'a Hash_heap.S.t -> Key.t * 'a
val pop : 'a Hash_heap.S.t -> 'a option
val pop_exn : 'a Hash_heap.S.t -> 'a
val pop_if_with_key :
'a Hash_heap.S.t -> (key:Key.t -> data:'a -> bool) -> (Key.t * 'a) option
val pop_if : 'a Hash_heap.S.t -> ('a -> bool) -> 'a option
val find : 'a Hash_heap.S.t -> Key.t -> 'a option
val find_pop : 'a Hash_heap.S.t -> Key.t -> 'a option
val find_exn : 'a Hash_heap.S.t -> Key.t -> 'a
val find_pop_exn : 'a Hash_heap.S.t -> Key.t -> 'a
val iter : 'a Hash_heap.S.t -> f:(key:Key.t -> data:'a -> unit) -> unit
val iter_vals : 'a Hash_heap.S.t -> f:('a -> unit) -> unit
val to_alist : 'a Hash_heap.S.t -> (Key.t * 'a) list
val length : 'a Hash_heap.S.t -> int
end`