sig
module Key : Key
type 'a t
type 'a container = 'a t
val length : 'a container -> int
val is_empty : 'a container -> bool
val iter : 'a container -> f:('a -> unit) -> unit
val fold : 'a container -> init:'b -> f:('b -> 'a -> 'b) -> 'b
val exists : 'a container -> f:('a -> bool) -> bool
val for_all : 'a container -> f:('a -> bool) -> bool
val find : 'a container -> f:('a -> bool) -> 'a option
val to_list : 'a container -> 'a list
val to_array : 'a container -> 'a array
val invariant : 'a Hash_queue.S.t -> unit
val create : unit -> 'a Hash_queue.S.t
val clear : 'a Hash_queue.S.t -> unit
val mem : 'a Hash_queue.S.t -> Key.t -> bool
val find_opt : 'a Hash_queue.S.t -> Key.t -> 'a option
val enqueue :
'a Hash_queue.S.t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val dequeue : 'a Hash_queue.S.t -> 'a option
val dequeue_with_key : 'a Hash_queue.S.t -> (Key.t * 'a) option
val dequeue_all : 'a Hash_queue.S.t -> f:('a -> unit) -> unit
val remove : 'a Hash_queue.S.t -> Key.t -> [ `No_such_key | `Ok ]
val replace : 'a Hash_queue.S.t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val iter_keys :
'a Hash_queue.S.t -> f:(key:Key.t -> data:'a -> unit) -> unit
val fold_keys :
'a Hash_queue.S.t ->
init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b
end