package async_rpc_kernel

  1. Overview
  2. Docs
package async_rpc_kernel
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Key : sig ... end
type 'a 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 -> Base.Unit.t
val create : ?growth_allowed:Base.Bool.t -> ?size:Base.Int.t -> Base.Unit.t -> 'a t
val clear : 'a t -> Base.Unit.t
val mem : 'a t -> Key.t -> Base.Bool.t
val lookup : 'a t -> Key.t -> 'a Base.Option.t
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 -> Base.Unit.t
val enqueue_back : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_back_exn : 'a t -> Key.t -> 'a -> Base.Unit.t
val enqueue_front : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]
val enqueue_front_exn : 'a t -> Key.t -> 'a -> Base.Unit.t
val lookup_and_move_to_back : 'a t -> Key.t -> 'a Base.Option.t
val lookup_and_move_to_back_exn : 'a t -> Key.t -> 'a
val lookup_and_move_to_front : 'a t -> Key.t -> 'a Base.Option.t
val lookup_and_move_to_front_exn : 'a t -> Key.t -> 'a
val first : 'a t -> 'a Base.Option.t
val first_with_key : 'a t -> (Key.t * 'a) Base.Option.t
val keys : 'a t -> Key.t Base.List.t
val dequeue : 'a t -> [ `back | `front ] -> 'a Base.Option.t
val dequeue_exn : 'a t -> [ `back | `front ] -> 'a
val dequeue_back : 'a t -> 'a Base.Option.t
val dequeue_back_exn : 'a t -> 'a
val dequeue_front : 'a t -> 'a Base.Option.t
val dequeue_front_exn : 'a t -> 'a
val dequeue_with_key : 'a t -> [ `back | `front ] -> (Key.t * 'a) Base.Option.t
val dequeue_with_key_exn : 'a t -> [ `back | `front ] -> Key.t * 'a
val dequeue_back_with_key : 'a t -> (Key.t * 'a) Base.Option.t
val dequeue_back_with_key_exn : 'a t -> Key.t * 'a
val dequeue_front_with_key : 'a t -> (Key.t * 'a) Base.Option.t
val dequeue_front_with_key_exn : 'a t -> Key.t * 'a
val dequeue_all : 'a t -> f:('a -> Base.Unit.t) -> Base.Unit.t
val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]
val remove_exn : 'a t -> Key.t -> Base.Unit.t
val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]
val replace_exn : 'a t -> Key.t -> 'a -> Base.Unit.t
val drop : ?n:Base.Int.t -> 'a t -> [ `back | `front ] -> Base.Unit.t
val drop_front : ?n:Base.Int.t -> 'a t -> Base.Unit.t
val drop_back : ?n:Base.Int.t -> 'a t -> Base.Unit.t
val iteri : 'a t -> f:(key:Key.t -> data:'a -> Base.Unit.t) -> Base.Unit.t
val foldi : 'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b