A hash-queue, where the values are of type 'a.
val sexp_of_t :
('a -> Ppx_sexp_conv_lib .Sexp.t) -> 'a t -> Ppx_sexp_conv_lib .Sexp.tval is_empty : 'a t -> val iter : 'a t -> f :('a -> -> val fold : 'a t -> init :'accum -> f :('accum -> 'a -> 'accum ) -> 'accum val fold_result :
'a t -> init :'accum -> f :('accum -> 'a -> ('accum , 'e ) Base__ .Result.t -> ('accum , 'e ) Base__ .Result.tval fold_until :
'a t -> init :'accum -> f :('accum -> 'a -> ('accum , 'final ) Base__ .Container_intf.Continue_or_stop.t -> finish :('accum -> 'final ) -> 'final val exists : 'a t -> f :('a -> -> val for_all : 'a t -> f :('a -> -> val count : 'a t -> f :('a -> -> val sum :
(module Base__ .Commutative_group.S with type t = 'sum ) -> 'a t -> f :('a -> 'sum ) -> 'sum val find : 'a t -> f :('a -> -> 'a optionval find_map : 'a t -> f :('a -> 'b option -> 'b optionval to_list : 'a t -> 'a listval to_array : 'a t -> 'a arrayval min_elt : 'a t -> compare :('a -> 'a -> -> 'a optionval max_elt : 'a t -> compare :('a -> 'a -> -> 'a optioninvariant t checks the invariants of the queue.
val invariant : 'a t -> Base .Unit.tval create :
?growth_allowed :Base .Bool.t -> ?size :Base .Int.t -> Base .Unit.t -> 'a t create () returns an empty queue. The arguments growth_allowed and size are referring to the underlying hashtable.
val clear : 'a t -> Base .Unit.tval mem : 'a t -> Key .t -> Base .Bool.tmem q k returns true iff there is some (k, v) in the queue.
val lookup : 'a t -> Key .t -> 'a Base .Option.tlookup t k returns the value of the key-value pair in the queue with key k, if there is one.
val lookup_exn : 'a t -> Key .t -> 'a Note that even the non-*_exn versions can raise, but only if there is an ongoing iteration.
val enqueue : 'a t -> Key .t -> 'a -> [ `Ok | `Key_already_present ] enqueue t k v adds the key-value pair (k, v) to the end of the queue, returning `Ok if the pair was added, or `Key_already_present if there is already a (k, v') in the queue.
val enqueue_exn : 'a t -> Key .t -> 'a -> Base .Unit.tval lookup_and_move_to_back : 'a t -> Key .t -> 'a Base .Option.tval lookup_and_move_to_back_exn : 'a t -> Key .t -> 'a val first : 'a t -> 'a Base .Option.tfirst t returns the front element of the queue, without removing it.
val first_with_key : 'a t -> (Key .t * 'a ) Base .Option.tfirst_with_key t returns the front element of the queue and its key, without removing it.
val keys : 'a t -> Key .t Base .List.tkeys t returns the keys in the order of the queue.
val dequeue : 'a t -> 'a Base .Option.tdequeue t returns the front element of the queue.
val dequeue_exn : 'a t -> 'a val dequeue_with_key : 'a t -> (Key .t * 'a ) Base .Option.tdequeue_with_key t returns the front element of the queue and its key.
val dequeue_with_key_exn : 'a t -> Key .t * 'a val dequeue_all : 'a t -> f :('a -> Base .Unit.t) -> Base .Unit.tdequeue_all t ~f dequeues every element of the queue and applies f to each one.
val remove : 'a t -> Key .t -> [ `Ok | `No_such_key ] remove q k removes the key-value pair with key k from the queue.
val remove_exn : 'a t -> Key .t -> Base .Unit.tval replace : 'a t -> Key .t -> 'a -> [ `Ok | `No_such_key ] replace q k v changes the value of key k in the queue to v.
val replace_exn : 'a t -> Key .t -> 'a -> Base .Unit.tval iteri : 'a t -> f :(key :Key .t -> data :'a -> Base .Unit.t) -> Base .Unit.titer t ~f applies f to each key and element of the queue.
val foldi : 'a t -> init :'b -> f :('b -> key :Key .t -> data :'a -> 'b ) -> 'b