Belt_MutableSetInt
This module is Belt.MutableSet
specialized with key type to be a primitive type.
It is more efficient in general, the API is the same with Belt.MutableSet
except its key type is fixed, and identity is not needed(using the built-in one)
See Belt.MutableSet
The type of the set elements.
let make: unit => t;
let isEmpty: t => bool;
let forEachU: t => Js.Fn.arity1((value => unit)) => unit;
let reduceU: t => 'a => Js.Fn.arity2(('a => value => 'a)) => 'a;
let everyU: t => Js.Fn.arity1((value => bool)) => bool;
every p s
checks if all elements of the set satisfy the predicate p
. Order unspecified.
let someU: t => Js.Fn.arity1((value => bool)) => bool;
some p s
checks if at least one element of the set satisfies the predicate p
. Oder unspecified.
let keepU: t => Js.Fn.arity1((value => bool)) => t;
keep s p
returns a fresh copy of the set of all elements in s
that satisfy predicate p
.
let partitionU: t => Js.Fn.arity1((value => bool)) => (t, t);
partition s p
returns a fresh copy pair of sets (s1, s2)
, where s1
is the set of all the elements of s
that satisfy the predicate p
, and s2
is the set of all the elements of s
that do not satisfy p
.
let size: t => int;
let minUndefined: t => Js.undefined(value);
let maxUndefined: t => Js.undefined(value);
let getUndefined: t => value => Js.undefined(value);
let checkInvariantInternal: t => unit;
raise when invariant is not held