package core

  1. Overview
  2. Docs
package core
Legend:
Library
Module
Module type
Parameter
Class
Class type
type key = Base.Float.t
val length : ('a, 'b) Core__Hash_queue.t -> int
val is_empty : ('a, 'b) Core__Hash_queue.t -> bool
val iter : ('b, 'a) Core__Hash_queue.t -> f:('a -> unit) -> unit
val fold : ('b, 'a) Core__Hash_queue.t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum
val fold_result : ('b, 'a) Core__Hash_queue.t -> init:'accum -> f:('accum -> 'a -> ('accum, 'e) Base__.Result.t) -> ('accum, 'e) Base__.Result.t
val fold_until : ('b, 'a) Core__Hash_queue.t -> init:'accum -> f:('accum -> 'a -> ('accum, 'final) Base__Container_intf.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final
val exists : ('b, 'a) Core__Hash_queue.t -> f:('a -> bool) -> bool
val for_all : ('b, 'a) Core__Hash_queue.t -> f:('a -> bool) -> bool
val count : ('b, 'a) Core__Hash_queue.t -> f:('a -> bool) -> int
val sum : (module Base__Container_intf.Summable with type t = 'sum) -> ('b, 'a) Core__Hash_queue.t -> f:('a -> 'sum) -> 'sum
val find : ('b, 'a) Core__Hash_queue.t -> f:('a -> bool) -> 'a option
val find_map : ('c, 'a) Core__Hash_queue.t -> f:('a -> 'b option) -> 'b option
val to_list : ('b, 'a) Core__Hash_queue.t -> 'a list
val to_array : ('b, 'a) Core__Hash_queue.t -> 'a array
val min_elt : ('b, 'a) Core__Hash_queue.t -> compare:('a -> 'a -> int) -> 'a option
val max_elt : ('b, 'a) Core__Hash_queue.t -> compare:('a -> 'a -> int) -> 'a option
val invariant : ('key, 'data) Core__Hash_queue.t -> Base.Unit.t
val create : ?growth_allowed:Base.Bool.t -> ?size:Base.Int.t -> Base.Unit.t -> (key, 'data) Core__Hash_queue.t
val clear : ('key, 'data) Core__Hash_queue.t -> Base.Unit.t
val copy : ('key, 'data) Core__Hash_queue.t -> ('key, 'data) Core__Hash_queue.t
val mem : ('key, 'data) Core__Hash_queue.t -> 'key -> Base.Bool.t
val lookup : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data Base.Option.t
val lookup_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data
val enqueue : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> 'key -> 'data -> [ `Key_already_present | `Ok ]
val enqueue_exn : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> 'key -> 'data -> Base.Unit.t
val enqueue_back : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> [ `Key_already_present | `Ok ]
val enqueue_back_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> Base.Unit.t
val enqueue_front : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> [ `Key_already_present | `Ok ]
val enqueue_front_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> Base.Unit.t
val lookup_and_move_to_back : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data Base.Option.t
val lookup_and_move_to_back_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data
val lookup_and_move_to_front : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data Base.Option.t
val lookup_and_move_to_front_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data
val last : ('key, 'data) Core__Hash_queue.t -> 'data Base.Option.t
val last_with_key : ('key, 'data) Core__Hash_queue.t -> ('key * 'data) Base.Option.t
val first : ('key, 'data) Core__Hash_queue.t -> 'data Base.Option.t
val first_with_key : ('key, 'data) Core__Hash_queue.t -> ('key * 'data) Base.Option.t
val keys : ('key, 'data) Core__Hash_queue.t -> 'key Base.List.t
val dequeue : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> 'data Base.Option.t
val dequeue_exn : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> 'data
val dequeue_back : ('key, 'data) Core__Hash_queue.t -> 'data Base.Option.t
val dequeue_back_exn : ('key, 'data) Core__Hash_queue.t -> 'data
val dequeue_front : ('key, 'data) Core__Hash_queue.t -> 'data Base.Option.t
val dequeue_front_exn : ('key, 'data) Core__Hash_queue.t -> 'data
val dequeue_with_key : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> ('key * 'data) Base.Option.t
val dequeue_with_key_exn : ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> 'key * 'data
val dequeue_back_with_key : ('key, 'data) Core__Hash_queue.t -> ('key * 'data) Base.Option.t
val dequeue_back_with_key_exn : ('key, 'data) Core__Hash_queue.t -> 'key * 'data
val dequeue_front_with_key : ('key, 'data) Core__Hash_queue.t -> ('key * 'data) Base.Option.t
val dequeue_front_with_key_exn : ('key, 'data) Core__Hash_queue.t -> 'key * 'data
val dequeue_all : ('key, 'data) Core__Hash_queue.t -> f:('data -> Base.Unit.t) -> Base.Unit.t
val remove : ('key, 'data) Core__Hash_queue.t -> 'key -> [ `No_such_key | `Ok ]
val remove_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> Base.Unit.t
val lookup_and_remove : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data Base.Option.t
val replace : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> [ `No_such_key | `Ok ]
val replace_exn : ('key, 'data) Core__Hash_queue.t -> 'key -> 'data -> Base.Unit.t
val drop : ?n:Base.Int.t -> ('key, 'data) Core__Hash_queue.t -> [ `back | `front ] -> Base.Unit.t
val drop_front : ?n:Base.Int.t -> ('key, 'data) Core__Hash_queue.t -> Base.Unit.t
val drop_back : ?n:Base.Int.t -> ('key, 'data) Core__Hash_queue.t -> Base.Unit.t
val iteri : ('key, 'data) Core__Hash_queue.t -> f:(key:'key -> data:'data -> Base.Unit.t) -> Base.Unit.t
val foldi : ('key, 'data) Core__Hash_queue.t -> init:'b -> f:('b -> key:'key -> data:'data -> 'b) -> 'b
type 'data t
val sexp_of_t : ('data -> Sexplib0.Sexp.t) -> 'data t -> Sexplib0.Sexp.t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct