package melange

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
module I : sig ... end
type key = int
module N : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

type 'a t = {
  1. mutable data : 'a I.t;
}
val make : unit -> 'a t
val isEmpty : 'a t -> bool
val clear : 'a t -> unit
val minKeyUndefined : 'a t -> I.key Js.undefined
val minKey : 'a t -> I.key option
val maxKeyUndefined : 'a t -> I.key Js.undefined
val maxKey : 'a t -> I.key option
val minimum : 'a t -> (I.key * 'b) option
val minUndefined : 'a t -> (I.key * 'b) Js.undefined
val maximum : 'a t -> (I.key * 'b) option
val maxUndefined : 'a t -> (I.key * 'b) Js.undefined
val set : 'a t -> I.key -> 'b -> unit
val forEachU : 'a t -> (I.key -> 'b -> unit) Js.Fn.arity2 -> unit
val forEach : 'a t -> (I.key -> 'b -> unit) -> unit
val mapU : 'a t -> ('b -> 'c) Js.Fn.arity1 -> 'd t
val map : 'a t -> ('b -> 'c) -> 'd t
val mapWithKeyU : 'a t -> (I.key -> 'b -> 'c) Js.Fn.arity2 -> 'd t
val mapWithKey : 'a t -> (I.key -> 'b -> 'c) -> 'd t
val reduceU : 'a t -> 'b -> ('c -> I.key -> 'd -> 'c) Js.Fn.arity3 -> 'e
val reduce : 'a t -> 'b -> ('c -> I.key -> 'd -> 'e) -> 'f
val everyU : 'a t -> (I.key -> 'b -> bool) Js.Fn.arity2 -> bool
val every : 'a t -> (I.key -> 'b -> bool) -> bool
val someU : 'a t -> (I.key -> 'b -> bool) Js.Fn.arity2 -> bool
val some : 'a t -> (I.key -> 'b -> bool) -> bool
val size : 'a t -> int
val toList : 'a t -> (I.key * 'b) list
val toArray : 'a t -> (I.key * 'b) array
val keysToArray : 'a t -> I.key array
val valuesToArray : 'a t -> 'b array
val checkInvariantInternal : 'a t -> unit
val has : 'a t -> I.key -> bool
val removeMutateAux : (key, 'a) N.node -> key -> (key, 'b) N.t
val remove : 'a t -> key -> unit
val updateDone : (key, 'a) N.t -> key -> ('b option -> 'c option) Js.Fn.arity1 -> (key, 'a) N.t
val updateU : 'a t -> key -> ('b option -> 'b option) Js.Fn.arity1 -> unit
val update : 'a t -> key -> ('a option -> 'a option) -> unit
val removeArrayMutateAux : (key, 'a) N.node -> key A.t -> int -> int -> (key, 'a) N.node option
val removeMany : 'a t -> key A.t -> unit
val fromArray : (I.key * 'a) array -> 'b t
val cmpU : 'a t -> 'b t -> ('c -> 'd -> int) Js.Fn.arity2 -> int
val cmp : 'a t -> 'b t -> ('c -> 'd -> int) -> int
val eqU : 'a t -> 'b t -> ('c -> 'd -> bool) Js.Fn.arity2 -> bool
val eq : 'a t -> 'b t -> ('c -> 'd -> bool) -> bool
val get : 'a t -> I.key -> 'b option
val getUndefined : 'a t -> I.key -> 'b Js.Undefined.t
val getWithDefault : 'a t -> I.key -> 'b -> 'c
val getExn : 'a t -> I.key -> 'b
OCaml

Innovation. Community. Security.