package melange

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

Belt.MutableMap

The top level provides generic mutable map operations.

It also has two specialized inner modules Belt.MutableMap.Int and Belt.MutableMap.String

module Int : sig ... end
module String : sig ... end
module N : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

type ('key, 'id) id = (module Belt__.Belt_Id.Comparable with type identity = 'id and type t = 'key)
type ('key, 'id) cmp = ('key -> 'key -> int) Js.Fn.arity2
type ('k, 'v, 'id) t = {
  1. cmp : ('k, 'id) cmp;
  2. mutable data : ('k, 'v) N.t;
}
val removeMutateAux : ('a, 'b) N.node -> 'c -> cmp:('d -> 'd -> int) Js.Fn.arity2 -> ('f, 'g) N.t
val remove : ('a, 'b, 'c) t -> 'd -> unit
val removeArrayMutateAux : ('a, 'b) N.node -> 'c A.t -> int -> int -> cmp:('a -> 'a -> int) Js.Fn.arity2 -> ('a, 'b) N.node option
val removeMany : ('a, 'b, 'c) t -> 'd A.t -> unit
val updateDone : ('a, 'b) N.t -> 'c -> ('d option -> 'e option) Js.Fn.arity1 -> cmp:('f -> 'f -> int) Js.Fn.arity2 -> ('a, 'b) N.t
val updateU : ('a, 'b, 'c) t -> 'd -> ('e option -> 'e option) Js.Fn.arity1 -> unit
val update : ('a, 'b, 'c) t -> 'd -> ('b option -> 'b option) -> unit
val make : id:('key, 'identity) id -> ('key0, 'a, 'identity0) t
val clear : ('a, 'b, 'c) t -> unit
val isEmpty : ('a, 'b, 'c) t -> bool
val minKey : ('a, 'b, 'c) t -> 'd option
val minKeyUndefined : ('a, 'b, 'c) t -> 'd Js.undefined
val maxKey : ('a, 'b, 'c) t -> 'd option
val maxKeyUndefined : ('a, 'b, 'c) t -> 'd Js.undefined
val minimum : ('a, 'b, 'c) t -> ('d * 'e) option
val minUndefined : ('a, 'b, 'c) t -> ('d * 'e) Js.undefined
val maximum : ('a, 'b, 'c) t -> ('d * 'e) option
val maxUndefined : ('a, 'b, 'c) t -> ('d * 'e) Js.undefined
val forEachU : ('a, 'b, 'c) t -> ('d -> 'e -> unit) Js.Fn.arity2 -> unit
val forEach : ('a, 'b, 'c) t -> ('d -> 'e -> unit) -> unit
val reduceU : ('a, 'b, 'c) t -> 'd -> ('e -> 'f -> 'g -> 'e) Js.Fn.arity3 -> 'h
val reduce : ('a, 'b, 'c) t -> 'd -> ('e -> 'f -> 'g -> 'h) -> 'i
val everyU : ('a, 'b, 'c) t -> ('d -> 'e -> bool) Js.Fn.arity2 -> bool
val every : ('a, 'b, 'c) t -> ('d -> 'e -> bool) -> bool
val someU : ('a, 'b, 'c) t -> ('d -> 'e -> bool) Js.Fn.arity2 -> bool
val some : ('a, 'b, 'c) t -> ('d -> 'e -> bool) -> bool
val size : ('a, 'b, 'c) t -> int
val toList : ('a, 'b, 'c) t -> ('d * 'e) list
val toArray : ('a, 'b, 'c) t -> ('d * 'e) array
val keysToArray : ('a, 'b, 'c) t -> 'd array
val valuesToArray : ('a, 'b, 'c) t -> 'd array
val checkInvariantInternal : ('a, 'b, 'c) t -> unit
val cmpU : ('a, 'b, 'c) t -> ('d, 'e, 'f) t -> ('g -> 'h -> int) Js.Fn.arity2 -> int
val cmp : ('a, 'b, 'c) t -> ('a, 'd, 'e) t -> ('f -> 'g -> int) -> int
val eqU : ('a, 'b, 'c) t -> ('d, 'e, 'f) t -> ('g -> 'h -> bool) Js.Fn.arity2 -> bool
val eq : ('a, 'b, 'c) t -> ('a, 'd, 'e) t -> ('f -> 'g -> bool) -> bool
val mapU : ('a, 'b, 'c) t -> ('d -> 'e) Js.Fn.arity1 -> ('f, 'g, 'h) t
val map : ('a, 'b, 'c) t -> ('d -> 'e) -> ('a, 'f, 'c) t
val mapWithKeyU : ('a, 'b, 'c) t -> ('d -> 'e -> 'f) Js.Fn.arity2 -> ('g, 'h, 'i) t
val mapWithKey : ('a, 'b, 'c) t -> ('d -> 'e -> 'f) -> ('a, 'g, 'c) t
val get : ('a, 'b, 'c) t -> 'd -> 'e option
val getUndefined : ('a, 'b, 'c) t -> 'd -> 'e Js.undefined
val getWithDefault : ('a, 'b, 'c) t -> 'd -> 'e -> 'f
val getExn : ('a, 'b, 'c) t -> 'd -> 'e
val has : ('a, 'b, 'c) t -> 'd -> bool
val fromArray : ('k * 'a) array -> id:('k0, 'identity) id -> ('k, 'b, 'identity0) t
val set : ('a, 'b, 'c) t -> 'd -> 'e -> unit
val mergeManyAux : ('a, 'b) N.t -> ('c * 'd) A.t -> cmp:('a, 'e) N.cmp -> ('a, 'b) N.t
val mergeMany : ('a, 'b, 'c) t -> ('d * 'e) A.t -> unit
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