package core

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
type ('a, 'b, 'c) map = ('a, 'b, 'c) t
module Tree : sig ... end
type ('a, +'b) t = ('a, 'b, Base.Comparator.Poly.comparator_witness) map
include Bin_prot.Binable.S2 with type ('a, +'b) t := ('a, 'b) t
val bin_size_t : ('a, 'b, ('a, 'b) t) Bin_prot.Size.sizer2
val bin_write_t : ('a, 'b, ('a, 'b) t) Bin_prot.Write.writer2
val bin_read_t : ('a, 'b, ('a, 'b) t) Bin_prot.Read.reader2
val __bin_read_t__ : ('a, 'b, int -> ('a, 'b) t) Bin_prot.Read.reader2
val bin_writer_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.writer
val bin_reader_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.reader
val bin_t : ('a, 'b, ('a, 'b) t) Bin_prot.Type_class.S2.t
include Sexplib0.Sexpable.S2 with type ('a, +'b) t := ('a, 'b) t
val t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> (Sexplib0.Sexp.t -> 'b) -> Sexplib0.Sexp.t -> ('a, 'b) t
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> ('b -> Sexplib0.Sexp.t) -> ('a, 'b) t -> Sexplib0.Sexp.t
include Ppx_compare_lib.Comparable.S2 with type ('a, +'b) t := ('a, 'b) t
val compare : ('a -> 'a -> int) -> ('b -> 'b -> int) -> ('a, 'b) t -> ('a, 'b) t -> int
include Map_intf.Creators_and_accessors2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t
include Map_intf.Creators2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t
include Base.Map.Creators2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t
type comparator_witness
val empty : (_, _) t
val singleton : 'a -> 'b -> ('a, 'b) t
val map_keys : ('k1, 'v) t -> f:('k1 -> 'k2) -> [ `Ok of ('k2, 'v) t | `Duplicate_key of 'k2 ]
val map_keys_exn : ('k1, 'v) t -> f:('k1 -> 'k2) -> ('k2, 'v) t
val of_alist : ('a * 'b) list -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]
val of_alist_or_error : ('a * 'b) list -> ('a, 'b) t Base.Or_error.t
val of_alist_exn : ('a * 'b) list -> ('a, 'b) t
val of_alist_multi : ('a * 'b) list -> ('a, 'b list) t
val of_alist_fold : ('a * 'b) list -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c) t
val of_alist_reduce : ('a * 'b) list -> f:('b -> 'b -> 'b) -> ('a, 'b) t
val of_sorted_array : ('a * 'b) array -> ('a, 'b) t Base.Or_error.t
val of_sorted_array_unchecked : ('a * 'b) array -> ('a, 'b) t
val of_increasing_iterator_unchecked : len:int -> f:(int -> 'a * 'b) -> ('a, 'b) t
val of_increasing_sequence : ('a * 'b) Base.Sequence.t -> ('a, 'b) t Base.Or_error.t
val of_sequence : ('a * 'b) Base.Sequence.t -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]
val of_sequence_or_error : ('a * 'b) Base.Sequence.t -> ('a, 'b) t Base.Or_error.t
val of_sequence_exn : ('a * 'b) Base.Sequence.t -> ('a, 'b) t
val of_sequence_multi : ('a * 'b) Base.Sequence.t -> ('a, 'b list) t
val of_sequence_fold : ('a * 'b) Base.Sequence.t -> init:'c -> f:('c -> 'b -> 'c) -> ('a, 'c) t
val of_sequence_reduce : ('a * 'b) Base.Sequence.t -> f:('b -> 'b -> 'b) -> ('a, 'b) t
val of_iteri : iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> [ `Ok of ('a, 'b) t | `Duplicate_key of 'a ]
val of_iteri_exn : iteri:(f:(key:'a -> data:'b -> unit) -> unit) -> ('a, 'b) t
val of_tree : ('a, 'b) Tree.t -> ('a, 'b) t
val of_hashtbl_exn : ('a, 'b) Hashtbl.t -> ('a, 'b) t
val of_key_set : ('a, comparator_witness) Base.Set.t -> f:('a -> 'b) -> ('a, 'b) t
val quickcheck_generator : 'a Quickcheck.Generator.t -> 'b Quickcheck.Generator.t -> ('a, 'b) t Quickcheck.Generator.t
include Map_intf.Accessors2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t with type comparator_witness := comparator_witness
include Base.Map.Accessors2 with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t with type comparator_witness := comparator_witness
val invariants : (_, _) t -> bool
val is_empty : (_, _) t -> bool
val length : (_, _) t -> int
val add : ('a, 'b) t -> key:'a -> data:'b -> [ `Ok of ('a, 'b) t | `Duplicate ]
val add_exn : ('a, 'b) t -> key:'a -> data:'b -> ('a, 'b) t
val set : ('a, 'b) t -> key:'a -> data:'b -> ('a, 'b) t
val add_multi : ('a, 'b list) t -> key:'a -> data:'b -> ('a, 'b list) t
val remove_multi : ('a, 'b list) t -> 'a -> ('a, 'b list) t
val find_multi : ('a, 'b list) t -> 'a -> 'b list
val change : ('a, 'b) t -> 'a -> f:('b option -> 'b option) -> ('a, 'b) t
val update : ('a, 'b) t -> 'a -> f:('b option -> 'b) -> ('a, 'b) t
val find : ('a, 'b) t -> 'a -> 'b option
val find_exn : ('a, 'b) t -> 'a -> 'b
val remove : ('a, 'b) t -> 'a -> ('a, 'b) t
val mem : ('a, 'b) t -> 'a -> bool
val iter_keys : ('a, _) t -> f:('a -> unit) -> unit
val iter : (_, 'b) t -> f:('b -> unit) -> unit
val iteri : ('a, 'b) t -> f:(key:'a -> data:'b -> unit) -> unit
val iteri_until : ('a, 'b) t -> f:(key:'a -> data:'b -> Base.Map.Continue_or_stop.t) -> Base.Map.Finished_or_unfinished.t
val iter2 : ('a, 'b) t -> ('a, 'c) t -> f:(key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> unit) -> unit
val map : ('a, 'b) t -> f:('b -> 'c) -> ('a, 'c) t
val mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> 'c) -> ('a, 'c) t
val fold : ('a, 'b) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val fold_until : ('k, 'v) t -> init:'a -> f:(key:'k -> data:'v -> 'a -> ('a, 'final) Base.Container.Continue_or_stop.t) -> finish:('a -> 'final) -> 'final
val fold_right : ('a, 'b) t -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val fold2 : ('a, 'b) t -> ('a, 'c) t -> init:'d -> f: (key:'a -> data:[ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd -> 'd) -> 'd
val filter_keys : ('a, 'b) t -> f:('a -> bool) -> ('a, 'b) t
val filter : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) t
val filteri : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b) t
val filter_map : ('a, 'b) t -> f:('b -> 'c option) -> ('a, 'c) t
val filter_mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> 'c option) -> ('a, 'c) t
val partition_mapi : ('a, 'b) t -> f:(key:'a -> data:'b -> ('c, 'd) Base.Either.t) -> ('a, 'c) t * ('a, 'd) t
val partition_map : ('a, 'b) t -> f:('b -> ('c, 'd) Base.Either.t) -> ('a, 'c) t * ('a, 'd) t
val partitioni_tf : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> ('a, 'b) t * ('a, 'b) t
val partition_tf : ('a, 'b) t -> f:('b -> bool) -> ('a, 'b) t * ('a, 'b) t
val combine_errors : ('a, 'b Base.Or_error.t) t -> ('a, 'b) t Base.Or_error.t
val compare_direct : ('b -> 'b -> int) -> ('a, 'b) t -> ('a, 'b) t -> int
val equal : ('b -> 'b -> bool) -> ('a, 'b) t -> ('a, 'b) t -> bool
val keys : ('a, _) t -> 'a list
val data : (_, 'b) t -> 'b list
val to_alist : ?key_order:[ `Increasing | `Decreasing ] -> ('a, 'b) t -> ('a * 'b) list
val merge : ('a, 'b) t -> ('a, 'c) t -> f:(key:'a -> [ `Left of 'b | `Right of 'c | `Both of 'b * 'c ] -> 'd option) -> ('a, 'd) t
val merge_skewed : ('k, 'v) t -> ('k, 'v) t -> combine:(key:'k -> 'v -> 'v -> 'v) -> ('k, 'v) t
val symmetric_diff : ('a, 'b) t -> ('a, 'b) t -> data_equal:('b -> 'b -> bool) -> ('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) Base.Sequence.t
val fold_symmetric_diff : ('a, 'b) t -> ('a, 'b) t -> data_equal:('b -> 'b -> bool) -> init:'c -> f:('c -> ('a * [ `Left of 'b | `Right of 'b | `Unequal of 'b * 'b ]) -> 'c) -> 'c
val min_elt : ('a, 'b) t -> ('a * 'b) option
val min_elt_exn : ('a, 'b) t -> 'a * 'b
val max_elt : ('a, 'b) t -> ('a * 'b) option
val max_elt_exn : ('a, 'b) t -> 'a * 'b
val for_all : (_, 'b) t -> f:('b -> bool) -> bool
val for_alli : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> bool
val exists : (_, 'b) t -> f:('b -> bool) -> bool
val existsi : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> bool
val count : (_, 'b) t -> f:('b -> bool) -> int
val counti : ('a, 'b) t -> f:(key:'a -> data:'b -> bool) -> int
val split : ('a, 'b) t -> 'a -> ('a, 'b) t * ('a * 'b) option * ('a, 'b) t
val append : lower_part:('a, 'b) t -> upper_part:('a, 'b) t -> [ `Ok of ('a, 'b) t | `Overlapping_key_ranges ]
val subrange : ('a, 'b) t -> lower_bound:'a Base.Maybe_bound.t -> upper_bound:'a Base.Maybe_bound.t -> ('a, 'b) t
val fold_range_inclusive : ('a, 'b) t -> min:'a -> max:'a -> init:'c -> f:(key:'a -> data:'b -> 'c -> 'c) -> 'c
val range_to_alist : ('a, 'b) t -> min:'a -> max:'a -> ('a * 'b) list
val closest_key : ('a, 'b) t -> [ `Greater_or_equal_to | `Greater_than | `Less_or_equal_to | `Less_than ] -> 'a -> ('a * 'b) option
val nth : ('a, 'b) t -> int -> ('a * 'b) option
val nth_exn : ('a, 'b) t -> int -> 'a * 'b
val rank : ('a, _) t -> 'a -> int option
val to_tree : ('a, 'b) t -> ('a, 'b) Tree.t
val to_sequence : ?order:[ `Increasing_key | `Decreasing_key ] -> ?keys_greater_or_equal_to:'a -> ?keys_less_or_equal_to:'a -> ('a, 'b) t -> ('a * 'b) Base.Sequence.t
val binary_search_segmented : ('k, 'v) t -> segment_of:(key:'k -> data:'v -> [ `Left | `Right ]) -> Base.Binary_searchable.Which_target_by_segment.t -> ('k * 'v) option
val binary_search_subrange : ('k, 'v) t -> compare:(key:'k -> data:'v -> 'bound -> int) -> lower_bound:'bound Base.Maybe_bound.t -> upper_bound:'bound Base.Maybe_bound.t -> ('k, 'v) t
val key_set : ('k, 'v) t -> ('k, comparator_witness) Base.Set.t
val validate : name:('a -> Base.String.t) -> 'b Validate.check -> ('a, 'b) t Validate.check
val validatei : name:('a -> Base.String.t) -> ('a * 'b) Validate.check -> ('a, 'b) t Validate.check
val quickcheck_observer : 'k Quickcheck.Observer.t -> 'v Quickcheck.Observer.t -> ('k, 'v) t Quickcheck.Observer.t
val quickcheck_shrinker : 'k Quickcheck.Shrinker.t -> 'v Quickcheck.Shrinker.t -> ('k, 'v) t Quickcheck.Shrinker.t
OCaml

Innovation. Community. Security.