val length : ('a, 'b) Core_kernel__.Hash_queue.t -> intval is_empty : ('a, 'b) Core_kernel__.Hash_queue.t -> boolval iter : ('b, 'a) Core_kernel__.Hash_queue.t -> f:('a -> unit) -> unitval fold :
('b, 'a) Core_kernel__.Hash_queue.t ->
init:'accum ->
f:('accum -> 'a -> 'accum) ->
'accumval fold_result :
('b, 'a) Core_kernel__.Hash_queue.t ->
init:'accum ->
f:('accum -> 'a -> ('accum, 'e) Base__.Result.t) ->
('accum, 'e) Base__.Result.tval fold_until :
('b, 'a) Core_kernel__.Hash_queue.t ->
init:'accum ->
f:('accum -> 'a -> ('accum, 'final) Base__.Container_intf.Continue_or_stop.t) ->
finish:('accum -> 'final) ->
'finalval exists : ('b, 'a) Core_kernel__.Hash_queue.t -> f:('a -> bool) -> boolval for_all : ('b, 'a) Core_kernel__.Hash_queue.t -> f:('a -> bool) -> boolval count : ('b, 'a) Core_kernel__.Hash_queue.t -> f:('a -> bool) -> intval sum :
(module Base__.Container_intf.Summable with type t = 'sum) ->
('b, 'a) Core_kernel__.Hash_queue.t ->
f:('a -> 'sum) ->
'sumval find : ('b, 'a) Core_kernel__.Hash_queue.t -> f:('a -> bool) -> 'a optionval find_map :
('c, 'a) Core_kernel__.Hash_queue.t ->
f:('a -> 'b option) ->
'b optionval to_list : ('b, 'a) Core_kernel__.Hash_queue.t -> 'a listval to_array : ('b, 'a) Core_kernel__.Hash_queue.t -> 'a arrayval min_elt :
('b, 'a) Core_kernel__.Hash_queue.t ->
compare:('a -> 'a -> int) ->
'a optionval max_elt :
('b, 'a) Core_kernel__.Hash_queue.t ->
compare:('a -> 'a -> int) ->
'a optionval invariant :
('key, 'data) Core_kernel__.Hash_queue.t ->
Core_kernel__.Import.unitval create :
?growth_allowed:Core_kernel__.Import.bool ->
?size:Core_kernel__.Import.int ->
Core_kernel__.Import.unit ->
(key, 'data) Core_kernel__.Hash_queue.tval clear :
('key, 'data) Core_kernel__.Hash_queue.t ->
Core_kernel__.Import.unitval mem :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
Core_kernel__.Import.boolval lookup :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data Core_kernel__.Import.optionval lookup_exn : ('key, 'data) Core_kernel__.Hash_queue.t -> 'key -> 'dataval enqueue :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
'key ->
'data ->
[ `Key_already_present | `Ok ]val enqueue_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
'key ->
'data ->
Core_kernel__.Import.unitval enqueue_back :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
[ `Key_already_present | `Ok ]val enqueue_back_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
Core_kernel__.Import.unitval enqueue_front :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
[ `Key_already_present | `Ok ]val enqueue_front_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
Core_kernel__.Import.unitval lookup_and_move_to_back :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data Core_kernel__.Import.optionval lookup_and_move_to_back_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'dataval lookup_and_move_to_front :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data Core_kernel__.Import.optionval lookup_and_move_to_front_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'dataval first :
('key, 'data) Core_kernel__.Hash_queue.t ->
'data Core_kernel__.Import.optionval first_with_key :
('key, 'data) Core_kernel__.Hash_queue.t ->
('key * 'data) Core_kernel__.Import.optionval keys :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key Core_kernel__.Import.listval dequeue :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
'data Core_kernel__.Import.optionval dequeue_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
'dataval dequeue_back :
('key, 'data) Core_kernel__.Hash_queue.t ->
'data Core_kernel__.Import.optionval dequeue_back_exn : ('key, 'data) Core_kernel__.Hash_queue.t -> 'dataval dequeue_front :
('key, 'data) Core_kernel__.Hash_queue.t ->
'data Core_kernel__.Import.optionval dequeue_front_exn : ('key, 'data) Core_kernel__.Hash_queue.t -> 'dataval dequeue_with_key :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
('key * 'data) Core_kernel__.Import.optionval dequeue_with_key_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
'key * 'dataval dequeue_back_with_key :
('key, 'data) Core_kernel__.Hash_queue.t ->
('key * 'data) Core_kernel__.Import.optionval dequeue_back_with_key_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key * 'dataval dequeue_front_with_key :
('key, 'data) Core_kernel__.Hash_queue.t ->
('key * 'data) Core_kernel__.Import.optionval dequeue_front_with_key_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key * 'dataval dequeue_all :
('key, 'data) Core_kernel__.Hash_queue.t ->
f:('data -> Core_kernel__.Import.unit) ->
Core_kernel__.Import.unitval remove :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
[ `No_such_key | `Ok ]val remove_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
Core_kernel__.Import.unitval lookup_and_remove :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data Core_kernel__.Import.optionval replace :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
[ `No_such_key | `Ok ]val replace_exn :
('key, 'data) Core_kernel__.Hash_queue.t ->
'key ->
'data ->
Core_kernel__.Import.unitval drop :
?n:Core_kernel__.Import.int ->
('key, 'data) Core_kernel__.Hash_queue.t ->
[ `back | `front ] ->
Core_kernel__.Import.unitval drop_front :
?n:Core_kernel__.Import.int ->
('key, 'data) Core_kernel__.Hash_queue.t ->
Core_kernel__.Import.unitval drop_back :
?n:Core_kernel__.Import.int ->
('key, 'data) Core_kernel__.Hash_queue.t ->
Core_kernel__.Import.unitval iteri :
('key, 'data) Core_kernel__.Hash_queue.t ->
f:(key:'key -> data:'data -> Core_kernel__.Import.unit) ->
Core_kernel__.Import.unitval foldi :
('key, 'data) Core_kernel__.Hash_queue.t ->
init:'b ->
f:('b -> key:'key -> data:'data -> 'b) ->
'btype 'data t = (key, 'data) Core_kernel__.Hash_queue.tval sexp_of_t :
('data -> Ppx_sexp_conv_lib.Sexp.t) ->
'data t ->
Ppx_sexp_conv_lib.Sexp.t