package melange

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

Belt.HashMap

The top level provides generic mutable hash map operations.

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

module N : sig ... end
module C : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

type ('a, 'id) eq
type ('a, 'id) hash
type ('a, 'id) id = (module Belt__.Belt_Id.Hashable with type identity = 'id and type t = 'a)
type ('a, 'b, 'id) t = (('a, 'id) hash, ('a, 'id) eq, 'a, 'b) N.t
val clear : ('a, 'b, 'c) C.container -> unit
val size : ('a, 'b, 'c) C.container -> int
val forEach : ('a, 'b, 'c, 'd) N.t -> ('c -> 'd -> 'e) -> unit
val forEachU : ('a, 'b, 'c, 'd) N.t -> ('c -> 'd -> 'e) Js.Fn.arity2 -> unit
val reduce : ('a, 'b, 'c, 'd) N.t -> 'e -> ('e -> 'c -> 'd -> 'e) -> 'e
val reduceU : ('a, 'b, 'c, 'd) N.t -> 'e -> ('e -> 'c -> 'd -> 'e) Js.Fn.arity3 -> 'e
val logStats : ('a, 'b, 'c, 'd) N.t -> unit
val keepMapInPlaceU : ('a, 'b, 'c, 'd) N.t -> ('c -> 'd -> 'd option) Js.Fn.arity2 -> unit
val keepMapInPlace : ('a, 'b, 'c, 'd) N.t -> ('c -> 'd -> 'd option) -> unit
val toArray : ('a, 'b, 'c, 'd) N.t -> ('c * 'd) array
val copy : ('a, 'b, 'c, 'd) N.t -> ('a, 'b, 'c, 'd) N.t
val keysToArray : ('a, 'b, 'c, 'd) N.t -> 'c array
val valuesToArray : ('a, 'b, 'c, 'd) N.t -> 'd array
val getBucketHistogram : ('a, 'b, 'c, 'd) N.t -> int array
val isEmpty : ('a, 'b, 'c) C.container -> bool
val copyBucketReHash : hash:('a -> int) Js.Fn.arity1 -> h_buckets:('a, 'b) N.bucket C.opt A.t -> ndata_tail:('a, 'b) N.bucket C.opt A.t -> ('a, 'b) N.bucket C.opt -> unit
val resize : hash:('a -> int) Js.Fn.arity1 -> ('b, 'c, ('a, 'd) N.bucket) C.container -> unit
val replaceInBucket : eq:('a -> 'b -> bool) Js.Fn.arity2 -> 'b -> 'c -> ('a, 'c) N.bucket -> bool
val set0 : ('a, 'b, ('c, 'd) N.bucket) C.container -> 'c -> 'd -> eq:('c -> 'c -> bool) Js.Fn.arity2 -> hash:('c -> int) Js.Fn.arity1 -> unit
val set : (('a, 'b) Belt__.Belt_Id.hash, ('a, 'c) Belt__.Belt_Id.eq, ('a, 'd) N.bucket) C.container -> 'a -> 'd -> unit
val removeInBucket : ('a, 'b, 'c) C.container -> 'd -> 'e -> 'f -> ('g, 'h) N.bucket -> ('g, 'h) N.bucket C.opt -> eq:('g -> 'f -> bool) Js.Fn.arity2 -> unit
val remove : (('a, 'b) Belt__.Belt_Id.hash, ('a, 'c) Belt__.Belt_Id.eq, ('a, 'd) N.bucket) C.container -> 'a -> unit
val getAux : eq:('a -> 'b -> bool) Js.Fn.arity2 -> 'a -> ('b, 'c) N.bucket C.opt -> 'c option
val get : (('a, 'b) Belt__.Belt_Id.hash, ('a, 'c) Belt__.Belt_Id.eq, ('a, 'd) N.bucket) C.container -> 'a -> 'd option
val memInBucket : 'a -> ('b, 'c) N.bucket -> eq:('b -> 'a -> bool) Js.Fn.arity2 -> bool
val has : (('a, 'b) Belt__.Belt_Id.hash, ('a, 'c) Belt__.Belt_Id.eq, ('a, 'd) N.bucket) C.container -> 'a -> bool
val make : hintSize:int -> id:('key, 'identity) id -> (('key, 'identity) Belt__Belt_Id.hash, ('key, 'identity) Belt__Belt_Id.eq, 'a) C.container
val fromArray : ('a * 'b) A.t -> id:('a, 'identity) id -> (('a, 'identity) Belt__Belt_Id.hash, ('a, 'identity) Belt__Belt_Id.eq, ('a, 'b) N.bucket) C.container
val mergeMany : (('a, 'b) Belt__.Belt_Id.hash, ('a, 'c) Belt__.Belt_Id.eq, ('a, 'd) N.bucket) C.container -> ('a * 'd) A.t -> unit
module Int : sig ... end

Adapted by Hongbo Zhang, Authors of ReScript 2017

module String : sig ... end

Adapted by Hongbo Zhang, Authors of ReScript 2017

OCaml

Innovation. Community. Security.