package melange

  1. Overview
  2. Docs
package melange
Legend:
Library
Module
Module type
Parameter
Class
Class type
type ('k, 'v) t0 =
  1. | Empty
  2. | Leaf of {
    1. v : 'k;
    2. d : 'v;
    }
  3. | Node of {
    1. h : int;
    2. v : 'k;
    3. d : 'v;
    4. l : ('k, 'v) t0;
    5. r : ('k, 'v) t0;
    }
type ('k, 'v) partial_node = {
  1. h : int;
  2. v : 'k;
  3. d : 'v;
  4. l : ('k, 'v) t0;
  5. r : ('k, 'v) t0;
}
type ('k, 'v) leaf_tuple = 'k * 'v
val (~!!) : ('k, 'v) t0 -> ('k, 'v) leaf_tuple
val (~!) : ('k, 'v) t0 -> ('k, 'v) partial_node
val height : ('a, 'b) t0 -> int
val singleton : 'a -> 'b -> ('c, 'd) t0
val sorted_two_nodes_larger : ('a, 'b) t0 -> 'c -> 'd -> ('e, 'f) t0
val sorted_two_nodes_smaller : 'a -> 'b -> ('c, 'd) t0 -> ('e, 'f) t0
val create : ('a, 'b) t0 -> 'c -> 'd -> ('e, 'f) t0 -> ('g, 'h) t0
val of_increasing_iterator_unchecked : (unit -> 'a * 'b) -> int -> ('c, 'd) t0
val of_sorted_array_unchecked : ('a * 'b) array -> ('a, 'b) t0
val node : ('a, 'b) t0 -> 'c -> 'd -> ('e, 'f) t0 -> ('g, 'h) t0
val bal : ('a, 'b) t0 -> 'c -> 'd -> ('a, 'b) t0 -> ('e, 'f) t0
val empty : ('a, 'b) t0
val is_empty : ('a, 'b) t0 -> bool
type ('key, 'a) enumeration =
  1. | End
  2. | More of 'key * 'a * ('key, 'a) t0 * ('key, 'a) enumeration
val cons_enum : ('a, 'b) t0 -> ('c, 'd) enumeration -> ('c, 'd) enumeration
val min_binding : ('a, 'b) t0 -> ('a, 'b) leaf_tuple
val min_binding_from_node_unsafe : ('a, 'b) t0 -> ('c, 'd) leaf_tuple
val min_binding_opt : ('a, 'b) t0 -> ('c * 'd) option
val max_binding : ('a, 'b) t0 -> ('a, 'b) leaf_tuple
val max_binding_opt : ('a, 'b) t0 -> ('c * 'd) option
val remove_min_binding_from_node_unsafe : ('a, 'b) t0 -> ('c, 'd) t0
val add_min_node : ('a, 'b) t0 -> ('c, 'd) t0 -> ('a, 'b) t0
val add_min_binding : 'a -> 'b -> ('c, 'd) t0 -> ('e, 'f) t0
val add_max_node : ('a, 'b) t0 -> ('c, 'd) t0 -> ('a, 'b) t0
val add_max_binding : 'a -> 'b -> ('c, 'd) t0 -> ('e, 'f) t0
val internal_merge : ('a, 'b) t0 -> ('a, 'b) t0 -> ('a, 'b) t0
val join : ('a, 'b) t0 -> 'c -> 'd -> ('a, 'b) t0 -> ('e, 'f) t0
val concat : ('a, 'b) t0 -> ('a, 'b) t0 -> ('a, 'b) t0
val concat_or_join : ('a, 'b) t0 -> 'c -> 'd option -> ('a, 'b) t0 -> ('a, 'b) t0
val iter : ('a -> 'b -> unit) -> ('c, 'd) t0 -> unit
val map : ('a -> 'b) -> ('c, 'd) t0 -> ('e, 'f) t0
val mapi : ('a -> 'b -> 'c) -> ('d, 'e) t0 -> ('f, 'g) t0
val fold : ('a -> 'b -> 'c -> 'd) -> ('e, 'f) t0 -> 'g -> 'h
val keys_aux : 'a list -> ('b, 'c) t0 -> 'a list
val keys : ('a, 'b) t0 -> 'a list
val ordered_keys : ('a, 'b) t0 -> 'a list
val for_all : ('a -> 'b -> bool) -> ('c, 'd) t0 -> bool
val exists : ('a -> 'b -> bool) -> ('c, 'd) t0 -> bool
val filter : ('a -> 'b -> bool) -> ('c, 'd) t0 -> ('c, 'd) t0
val cardinal : ('a, 'b) t0 -> int
val bindings_aux : ('a, 'b) leaf_tuple list -> ('a, 'b) t0 -> ('a, 'b) leaf_tuple list
val bindings : ('a, 'b) t0 -> ('a, 'b) leaf_tuple list
type ('k, 'v) t1 = ('k, 'v) t0 =
  1. | Empty
  2. | Leaf of {
    1. v : 'k;
    2. d : 'v;
    }
  3. | Node of {
    1. h : int;
    2. v : 'k;
    3. d : 'v;
    4. l : ('k, 'v) t0;
    5. r : ('k, 'v) t0;
    }
module type OrderedType = sig ... end
module type S = sig ... end
module Make (Ord : OrderedType) : S with type key = Ord.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