package stdcompat

  1. Overview
  2. Docs

Parameters

module Ord : OrderedType

Signature

include sig ... end
type key = Ord.t
type 'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val update : key -> ('a option -> 'a option) -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge : (key -> 'a option -> 'b option -> 'c option) -> 'a t -> 'b t -> 'c t
val union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val min_binding_opt : 'a t -> (key * 'a) option
val max_binding : 'a t -> key * 'a
val max_binding_opt : 'a t -> (key * 'a) option
val choose : 'a t -> key * 'a
val choose_opt : 'a t -> (key * 'a) option
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val find_opt : key -> 'a t -> 'a option
val find_first : (key -> bool) -> 'a t -> key * 'a
val find_first_opt : (key -> bool) -> 'a t -> (key * 'a) option
val find_last : (key -> bool) -> 'a t -> key * 'a
val find_last_opt : (key -> bool) -> 'a t -> (key * 'a) option
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val to_seq : 'a t -> (key * 'a) Seq.t
val to_seq_from : key -> 'a t -> (key * 'a) Seq.t
val add_seq : (key * 'a) Seq.t -> 'a t -> 'a t
val of_seq : (key * 'a) Seq.t -> 'a t
type 'a internal =
  1. | Empty
  2. | Node of 'a internal * key * 'a * 'a internal * int
val t_of_internal : 'a internal -> 'a t
val internal_of_t : 'a t -> 'a internal
val height : 'a internal -> int
val create : 'a internal -> key -> 'a -> 'a internal -> 'a internal
val destruct : 'a internal -> 'a internal * key * 'a * 'a internal * int
val bal : 'a internal -> key -> 'a -> 'a internal -> 'a internal
val add_min_binding : key -> 'a -> 'a internal -> 'a internal
val add_max_binding : key -> 'a -> 'a internal -> 'a internal
val remove_min_binding : 'a internal -> 'a internal
val join : 'a internal -> key -> 'a -> 'a internal -> 'a internal
val concat : 'a internal -> 'a internal -> 'a internal
val filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b t
type 'a enumeration =
  1. | End
  2. | More of key * 'a * 'a internal * 'a enumeration
val snoc_enum : 'a internal -> 'a enumeration -> 'a enumeration
val rev_seq_of_enum_ : 'a enumeration -> unit -> (key * 'a) Seq.node
val to_rev_seq : 'a t -> unit -> (key * 'a) Seq.node
OCaml

Innovation. Community. Security.