package core_kernel

  1. Overview
  2. Docs
package core_kernel
Legend:
Library
Module
Module type
Parameter
Class
Class type
include Core_map_intf.Make_S_plain_tree(Core_kernel__.Core_int63.Map.Key).S
type 'a t = (Base__.Int63_backends.Dynamic.t, 'a, Core_kernel__.Core_int63.comparator_witness) Base.Map.Using_comparator.Tree.t
include sig ... end
include Core_map_intf.Creators_and_accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Base__.Int63_backends.Dynamic.t
include Core_map_intf.Creators1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Base__.Int63_backends.Dynamic.t
include Base.Map_intf.Creators1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Base__.Int63_backends.Dynamic.t
val empty : _ t
val singleton : Base__.Int63_backends.Dynamic.t -> 'a -> 'a t
val of_alist : (Base__.Int63_backends.Dynamic.t * 'a) list -> [ `Ok of 'a t | `Duplicate_key of Base__.Int63_backends.Dynamic.t ]
val of_alist_or_error : (Base__.Int63_backends.Dynamic.t * 'a) list -> 'a t Base.Or_error.t
val of_alist_exn : (Base__.Int63_backends.Dynamic.t * 'a) list -> 'a t
val of_alist_multi : (Base__.Int63_backends.Dynamic.t * 'a) list -> 'a list t
val of_alist_fold : (Base__.Int63_backends.Dynamic.t * 'a) list -> init:'b -> f:('b -> 'a -> 'b) -> 'b t
val of_alist_reduce : (Base__.Int63_backends.Dynamic.t * 'a) list -> f:('a -> 'a -> 'a) -> 'a t
val of_sorted_array : (Base__.Int63_backends.Dynamic.t * 'a) array -> 'a t Base.Or_error.t
val of_sorted_array_unchecked : (Base__.Int63_backends.Dynamic.t * 'a) array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:(int -> Base__.Int63_backends.Dynamic.t * 'a) -> 'a t
val of_iteri : iteri:(f:(key:Base__.Int63_backends.Dynamic.t -> data:'v -> unit) -> unit) -> [ `Ok of 'v t | `Duplicate_key of Base__.Int63_backends.Dynamic.t ]
val of_tree : 'a t -> 'a t
val of_hashtbl_exn : (Base__.Int63_backends.Dynamic.t, 'a) Base.Hashtbl.t -> 'a t
val gen : Base__.Int63_backends.Dynamic.t Quickcheck.Generator.t -> 'a Quickcheck.Generator.t -> 'a t Quickcheck.Generator.t
include Core_map_intf.Accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Base__.Int63_backends.Dynamic.t
include Base.Map_intf.Accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Base__.Int63_backends.Dynamic.t
val invariants : _ t -> bool
val is_empty : _ t -> bool
val length : _ t -> int
val add : 'a t -> key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'a t
val add_multi : 'a list t -> key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'a list t
val remove_multi : 'a list t -> Base__.Int63_backends.Dynamic.t -> 'a list t
val change : 'a t -> Base__.Int63_backends.Dynamic.t -> f:('a option -> 'a option) -> 'a t
val update : 'a t -> Base__.Int63_backends.Dynamic.t -> f:('a option -> 'a) -> 'a t
val find : 'a t -> Base__.Int63_backends.Dynamic.t -> 'a option
val find_exn : 'a t -> Base__.Int63_backends.Dynamic.t -> 'a
val remove : 'a t -> Base__.Int63_backends.Dynamic.t -> 'a t
val mem : _ t -> Base__.Int63_backends.Dynamic.t -> bool
val iter_keys : _ t -> f:(Base__.Int63_backends.Dynamic.t -> unit) -> unit
val iter : 'a t -> f:('a -> unit) -> unit
val iteri : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> unit) -> unit
val iter2 : 'a t -> 'b t -> f: (key:Base__.Int63_backends.Dynamic.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> unit) -> unit
val map : 'a t -> f:('a -> 'b) -> 'b t
val mapi : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'b) -> 'b t
val fold : 'a t -> init:'b -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'b -> 'b) -> 'b
val fold_right : 'a t -> init:'b -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'b -> 'b) -> 'b
val fold2 : 'a t -> 'b t -> init:'c -> f: (key:Base__.Int63_backends.Dynamic.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c -> 'c) -> 'c
val filter_keys : 'a t -> f:(Base__.Int63_backends.Dynamic.t -> bool) -> 'a t
val filter : 'a t -> f:('a -> bool) -> 'a t
val filteri : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> bool) -> 'a t
val filter_map : 'a t -> f:('a -> 'b option) -> 'b t
val filter_mapi : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'b option) -> 'b t
val partition_mapi : 'a t -> f: (key:Base__.Int63_backends.Dynamic.t -> data:'a -> [ `Fst of 'b | `Snd of 'c ]) -> 'b t * 'c t
val partition_map : 'a t -> f:('a -> [ `Fst of 'b | `Snd of 'c ]) -> 'b t * 'c t
val partitioni_tf : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> bool) -> 'a t * 'a t
val partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a t
val compare_direct : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val keys : _ t -> Base__.Int63_backends.Dynamic.t list
val data : 'a t -> 'a list
val to_alist : ?key_order:[ `Increasing | `Decreasing ] -> 'a t -> (Base__.Int63_backends.Dynamic.t * 'a) list
val validate : name:(Base__.Int63_backends.Dynamic.t -> string) -> 'a Base.Validate.check -> 'a t Base.Validate.check
val merge : 'a t -> 'b t -> f: (key:Base__.Int63_backends.Dynamic.t -> [ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c option) -> 'c t
val symmetric_diff : 'a t -> 'a t -> data_equal:('a -> 'a -> bool) -> (Base__.Int63_backends.Dynamic.t, 'a) Base.Map_intf.Symmetric_diff_element.t Base.Sequence.t
val min_elt : 'a t -> (Base__.Int63_backends.Dynamic.t * 'a) option
val min_elt_exn : 'a t -> Base__.Int63_backends.Dynamic.t * 'a
val max_elt : 'a t -> (Base__.Int63_backends.Dynamic.t * 'a) option
val max_elt_exn : 'a t -> Base__.Int63_backends.Dynamic.t * 'a
val for_all : 'a t -> f:('a -> bool) -> bool
val for_alli : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> bool) -> bool
val exists : 'a t -> f:('a -> bool) -> bool
val existsi : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> bool) -> bool
val count : 'a t -> f:('a -> bool) -> int
val counti : 'a t -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> bool) -> int
val split : 'a t -> Base__.Int63_backends.Dynamic.t -> 'a t * (Base__.Int63_backends.Dynamic.t * 'a) option * 'a t
val append : lower_part:'a t -> upper_part:'a t -> [ `Ok of 'a t | `Overlapping_key_ranges ]
val subrange : 'a t -> lower_bound:Base__.Int63_backends.Dynamic.t Base.Maybe_bound.t -> upper_bound:Base__.Int63_backends.Dynamic.t Base.Maybe_bound.t -> 'a t
val fold_range_inclusive : 'a t -> min:Base__.Int63_backends.Dynamic.t -> max:Base__.Int63_backends.Dynamic.t -> init:'b -> f:(key:Base__.Int63_backends.Dynamic.t -> data:'a -> 'b -> 'b) -> 'b
val range_to_alist : 'a t -> min:Base__.Int63_backends.Dynamic.t -> max:Base__.Int63_backends.Dynamic.t -> (Base__.Int63_backends.Dynamic.t * 'a) list
val closest_key : 'a t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> Base__.Int63_backends.Dynamic.t -> (Base__.Int63_backends.Dynamic.t * 'a) option
val nth : 'a t -> int -> (Base__.Int63_backends.Dynamic.t * 'a) option
val nth_exn : 'a t -> int -> Base__.Int63_backends.Dynamic.t * 'a
val rank : _ t -> Base__.Int63_backends.Dynamic.t -> int option
val to_tree : 'a t -> 'a t
val to_sequence : ?order:[ `Increasing_key | `Decreasing_key ] -> ?keys_greater_or_equal_to:Base__.Int63_backends.Dynamic.t -> ?keys_less_or_equal_to:Base__.Int63_backends.Dynamic.t -> 'a t -> (Base__.Int63_backends.Dynamic.t * 'a) Base.Sequence.t
val obs : Base__.Int63_backends.Dynamic.t Quickcheck.Observer.t -> 'v Quickcheck.Observer.t -> 'v t Quickcheck.Observer.t
val shrinker : Base__.Int63_backends.Dynamic.t Quickcheck.Shrinker.t -> 'v Quickcheck.Shrinker.t -> 'v t Quickcheck.Shrinker.t
module Provide_of_sexp (K : sig ... end) : sig ... end
include Sexpable.S1 with type 'a t := 'a t
include sig ... end
val t_of_sexp : (Base.Sexp.t -> 'a) -> Base.Sexp.t -> 'a t
val sexp_of_t : ('a -> Base.Sexp.t) -> 'a t -> Base.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