Module `Signal.Hash_queue`

module Key : sig ... end

type 'a t = 'a Core__Signal.Hash_queue.t

val sexp_of_t : ('a -> Ppx_sexp_conv_lib.Sexp.t) -> 'a t -> Ppx_sexp_conv_lib.Sexp.t
val length : 'a t -> int
val is_empty : 'a t -> bool
val iter : 'a t -> f:('a -> unit) -> unit
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.t
val 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 -> bool) -> bool
val for_all : 'a t -> f:('a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val sum : (module Base__.Container_intf.Summable with type t = 'sum) -> 'a t -> f:('a -> 'sum) -> 'sum
val find : 'a t -> f:('a -> bool) -> 'a option
val find_map : 'a t -> f:('a -> 'b option) -> 'b option
val to_list : 'a t -> 'a list
val to_array : 'a t -> 'a array
val min_elt : 'a t -> compare:('a -> 'a -> int) -> 'a option
val max_elt : 'a t -> compare:('a -> 'a -> int) -> 'a option
val invariant : 'a t -> Core_kernel__.Import.unit
val create : ?⁠growth_allowed:Core_kernel__.Import.bool -> ?⁠size:Core_kernel__.Import.int -> Core_kernel__.Import.unit -> 'a t
val clear : 'a t -> Core_kernel__.Import.unit
val mem : 'a t -> Key.t -> Core_kernel__.Import.bool
val lookup : 'a t -> Key.t -> 'a Core_kernel__.Import.option
val lookup_exn : 'a t -> Key.t -> 'a
val enqueue : 'a t -> [ `back | `front ] -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_exn : 'a t -> [ `back | `front ] -> Key.t -> 'a -> Core_kernel__.Import.unit
val enqueue_back : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_back_exn : 'a t -> Key.t -> 'a -> Core_kernel__.Import.unit
val enqueue_front : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_front_exn : 'a t -> Key.t -> 'a -> Core_kernel__.Import.unit
val lookup_and_move_to_back : 'a t -> Key.t -> 'a Core_kernel__.Import.option
val lookup_and_move_to_back_exn : 'a t -> Key.t -> 'a
val lookup_and_move_to_front : 'a t -> Key.t -> 'a Core_kernel__.Import.option
val lookup_and_move_to_front_exn : 'a t -> Key.t -> 'a
val first : 'a t -> 'a Core_kernel__.Import.option
val first_with_key : 'a t -> (Key.t * 'a) Core_kernel__.Import.option
val keys : 'a t -> Key.t Core_kernel__.Import.list
val dequeue : 'a t -> [ `back | `front ] -> 'a Core_kernel__.Import.option
val dequeue_exn : 'a t -> [ `back | `front ] -> 'a
val dequeue_back : 'a t -> 'a Core_kernel__.Import.option
val dequeue_back_exn : 'a t -> 'a
val dequeue_front : 'a t -> 'a Core_kernel__.Import.option
val dequeue_front_exn : 'a t -> 'a
val dequeue_with_key : 'a t -> [ `back | `front ] -> (Key.t * 'a) Core_kernel__.Import.option
val dequeue_with_key_exn : 'a t -> [ `back | `front ] -> Key.t * 'a
val dequeue_back_with_key : 'a t -> (Key.t * 'a) Core_kernel__.Import.option
val dequeue_back_with_key_exn : 'a t -> Key.t * 'a
val dequeue_front_with_key : 'a t -> (Key.t * 'a) Core_kernel__.Import.option
val dequeue_front_with_key_exn : 'a t -> Key.t * 'a
val dequeue_all : 'a t -> f:('a -> Core_kernel__.Import.unit) -> Core_kernel__.Import.unit
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val remove_exn : 'a t -> Key.t -> Core_kernel__.Import.unit
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val replace_exn : 'a t -> Key.t -> 'a -> Core_kernel__.Import.unit
val drop : ?⁠n:Core_kernel__.Import.int -> 'a t -> [ `back | `front ] -> Core_kernel__.Import.unit
val drop_front : ?⁠n:Core_kernel__.Import.int -> 'a t -> Core_kernel__.Import.unit
val drop_back : ?⁠n:Core_kernel__.Import.int -> 'a t -> Core_kernel__.Import.unit
val iteri : 'a t -> f:(key:Key.t -> data:'a -> Core_kernel__.Import.unit) -> Core_kernel__.Import.unit
val foldi : 'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b