package melange

  1. Overview
  2. Docs
package melange
Legend:
Library
Module
Module type
Parameter
Class
Class type

Specalized when key type is int, more efficient than the generic type, its compare behavior is fixed using the built-in comparison

type key = int
module I : sig ... end
module N : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

type 'a t = (key, 'a) N.t
val empty : 'a option
val isEmpty : ('a, 'b) N.t -> bool
val minKey : ('a, 'b) N.t -> 'a option
val minKeyUndefined : ('a, 'b) N.t -> 'a Js.undefined
val maxKey : ('a, 'b) N.t -> 'a option
val maxKeyUndefined : ('a, 'b) N.t -> 'a Js.undefined
val minimum : ('a, 'b) N.t -> ('a * 'b) option
val minUndefined : ('a, 'b) N.t -> ('a * 'b) Js.undefined
val maximum : ('a, 'b) N.t -> ('a * 'b) option
val maxUndefined : ('a, 'b) N.t -> ('a * 'b) Js.undefined
val forEachU : ('a, 'b) N.t -> ('a -> 'b -> unit) Js.Fn.arity2 -> unit
val forEach : ('a, 'b) N.t -> ('a -> 'b -> unit) -> unit
val mapU : ('a, 'b) N.t -> ('b -> 'c) Js.Fn.arity1 -> ('a, 'c) N.t
val map : ('a, 'b) N.t -> ('b -> 'c) -> ('a, 'c) N.t
val mapWithKeyU : ('a, 'b) N.t -> ('a -> 'b -> 'c) Js.Fn.arity2 -> ('a, 'c) N.t
val mapWithKey : ('a, 'b) N.t -> ('a -> 'b -> 'c) -> ('a, 'c) N.t
val reduceU : ('a, 'b) N.t -> 'c -> ('c -> 'a -> 'b -> 'c) Js.Fn.arity3 -> 'c
val reduce : ('a, 'b) N.t -> 'c -> ('c -> 'a -> 'b -> 'c) -> 'c
val everyU : ('a, 'b) N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> bool
val every : ('a, 'b) N.t -> ('a -> 'b -> bool) -> bool
val someU : ('a, 'b) N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> bool
val some : ('a, 'b) N.t -> ('a -> 'b -> bool) -> bool
val keepU : ('a, 'b) N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> ('a, 'b) N.t
val keep : ('a, 'b) N.t -> ('a -> 'b -> bool) -> ('a, 'b) N.t
val partitionU : ('a, 'b) N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> ('a, 'b) N.t * ('a, 'b) N.t
val partition : ('a, 'b) N.t -> ('a -> 'b -> bool) -> ('a, 'b) N.t * ('a, 'b) N.t
val size : ('a, 'b) N.t -> int
val toList : ('a, 'b) N.t -> ('a * 'b) list
val toArray : ('a, 'b) N.t -> ('a * 'b) array
val keysToArray : ('a, 'b) N.t -> 'a array
val valuesToArray : ('a, 'b) N.t -> 'b array
val checkInvariantInternal : ('a, 'b) N.t -> unit
val set : (key, 'a) N.t -> key -> 'a -> (key, 'a) N.t
val updateU : (key, 'a) N.t -> key -> ('a option -> 'a option) Js.Fn.arity1 -> (key, 'a) N.t
val update : (key, 'a) N.t -> key -> ('a option -> 'a option) -> (key, 'a) N.t
val removeAux : (key, 'a) N.node -> key -> (key, 'a) N.t
val remove : (key, 'a) N.node option -> key -> (key, 'a) N.t
val removeMany0 : (key, 'a) N.node -> key A.t -> int -> int -> (key, 'a) N.t
val removeMany : (key, 'a) N.node option -> key A.t -> (key, 'a) N.t
val findFirstByU : ('a, 'b) N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> ('a * 'b) option
val findFirstBy : ('a, 'b) N.t -> ('a -> 'b -> bool) -> ('a * 'b) option
val mergeMany : (key, 'a) N.t -> (key * 'a) A.t -> (key, 'a) N.t
val has : (I.key, 'a) I.N.t -> I.key -> bool
val cmpU : (I.key, 'a) I.N.t -> (I.key, 'b) I.N.t -> ('a -> 'b -> int) Js.Fn.arity2 -> int
val cmp : (I.key, 'a) I.N.t -> (I.key, 'b) I.N.t -> ('a -> 'b -> int) -> int
val eqU : (I.key, 'a) I.N.t -> (I.key, 'b) I.N.t -> ('a -> 'b -> bool) Js.Fn.arity2 -> bool
val eq : (I.key, 'a) I.N.t -> (I.key, 'b) I.N.t -> ('a -> 'b -> bool) -> bool
val get : (I.key, 'a) I.N.t -> I.key -> 'a option
val getUndefined : (I.key, 'a) I.N.t -> I.key -> 'a Js.Undefined.t
val getWithDefault : (I.key, 'a) I.N.t -> I.key -> 'a -> 'a
val getExn : (I.key, 'a) I.N.t -> I.key -> 'a
val split : I.key -> (I.key, 'a) I.N.node option -> 'a I.t * 'a option * 'a I.t
val mergeU : (I.key, 'a) I.N.t -> 'b I.t -> (I.key -> 'a option -> 'b option -> 'c option) Js.Fn.arity3 -> (I.key, 'c) I.N.t
val merge : (I.key, 'a) I.N.t -> 'b I.t -> (I.key -> 'a option -> 'b option -> 'c option) -> (I.key, 'c) I.N.t
val fromArray : (I.key * 'a) array -> (I.key, 'a) I.N.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