melange 4.0.0-51 · OCaml Package

Belt.HashSet

The top level provides generic mutable hash set operations.

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

module Int : sig ... end

This module is Belt.HashSet specialized with key type to be a primitive type.

module String : sig ... end

module N : sig ... end

module C : sig ... end

module A : sig ... end

Belt.Array Utililites for Array functions

type ('a, 'id) eq = ('a -> 'a -> bool) Js.Fn.arity2

type ('a, 'id) hash = ('a -> int) Js.Fn.arity1

type ('a, 'id) id =
  (module Belt__.Belt_Id.Hashable
  with type identity = 'id
   and type t = 'a)

type ('a, 'id) t = (('a, 'id) hash, ('a, 'id) eq, 'a) N.t

val copyBucket : 
  hash:('a -> int) Js.Fn.arity1 ->
  h_buckets:'c N.bucket C.opt A.t ->
  ndata_tail:'d N.bucket C.opt A.t ->
  'c N.bucket C.opt ->
  unit

val tryDoubleResize : 
  hash:('a -> int) Js.Fn.arity1 ->
  ('c, 'd, 'a N.bucket) C.container ->
  unit

val removeBucket : 
  eq:('a -> 'a -> bool) Js.Fn.arity2 ->
  ('c, 'd, 'e) C.container ->
  'f ->
  'g ->
  'h ->
  'i N.bucket ->
  'j N.bucket ->
  unit

val remove : 
  (('a -> int) Js.Fn.arity1, ('c -> 'c -> bool) Js.Fn.arity2, 'e N.bucket)
    C.container ->
  'f ->
  unit

val addBucket : 
  ('a, 'b, 'c) C.container ->
  'd ->
  'e N.bucket ->
  eq:('f -> 'f -> bool) Js.Fn.arity2 ->
  unit

val add0 : 
  ('a, 'b, 'c N.bucket) C.container ->
  'd ->
  hash:('e -> int) Js.Fn.arity1 ->
  eq:('g -> 'g -> bool) Js.Fn.arity2 ->
  unit

val add : 
  (('a -> int) Js.Fn.arity1, ('a -> 'a -> bool) Js.Fn.arity2, 'a N.bucket)
    C.container ->
  'd ->
  unit

val memInBucket : 
  eq:('a -> 'a -> bool) Js.Fn.arity2 ->
  'c ->
  'd N.bucket ->
  bool

val has : 
  (('a -> int) Js.Fn.arity1, ('c -> 'c -> bool) Js.Fn.arity2, 'c N.bucket)
    C.container ->
  'e ->
  bool

val make : 
  hintSize:int ->
  id:('value, 'identity) id ->
  (('value0 -> int) Js.Fn.arity1,
    ('value0 -> 'value0 -> bool) Js.Fn.arity2,
    'a)
    C.container

val clear : ('a, 'b, 'c) C.container -> unit

val size : ('a, 'b, 'c) C.container -> int

val forEachU : ('a, 'b, 'c) N.t -> ('c -> unit) Js.Fn.arity1 -> unit

val forEach : ('a, 'b, 'c) N.t -> ('c -> unit) -> unit

val reduceU : ('a, 'b, 'c) N.t -> 'd -> ('d -> 'c -> 'd) Js.Fn.arity2 -> 'd

val reduce : ('a, 'b, 'c) N.t -> 'd -> ('d -> 'c -> 'd) -> 'd

val logStats : ('a, 'b, 'c) N.t -> unit

val toArray : ('a, 'b, 'c) N.t -> 'c array

val copy : ('a, 'b, 'c) N.t -> ('a, 'b, 'c) N.t

val getBucketHistogram : ('a, 'b, 'c) N.t -> int array

val isEmpty : ('a, 'b, 'c) C.container -> bool

val fromArray : 
  'a A.t ->
  id:('a0, 'identity) id ->
  (('a1 -> int) Js.Fn.arity1, ('a1 -> 'a1 -> bool) Js.Fn.arity2, 'a N.bucket)
    C.container

val mergeMany : 
  (('a -> int) Js.Fn.arity1, ('a -> 'a -> bool) Js.Fn.arity2, 'a N.bucket)
    C.container ->
  'd A.t ->
  unit

package melange