MutableSet.Int
Specalized when key type is int
, more efficient than the generic type
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.
val make : unit -> t
val isEmpty : t -> bool
val forEachU : t -> (value -> unit) Js.Fn.arity1 -> unit
val reduceU : t -> 'a -> ('a -> value -> 'a) Js.Fn.arity2 -> 'a
val everyU : t -> (value -> bool) Js.Fn.arity1 -> bool
every p s
checks if all elements of the set satisfy the predicate p
. Order unspecified.
val someU : t -> (value -> bool) Js.Fn.arity1 -> bool
some p s
checks if at least one element of the set satisfies the predicate p
. Oder unspecified.
val keepU : t -> (value -> bool) Js.Fn.arity1 -> t
keep s p
returns a fresh copy of the set of all elements in s
that satisfy predicate p
.
val partitionU : t -> (value -> bool) Js.Fn.arity1 -> 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
.
val size : t -> int
val minUndefined : t -> value Js.undefined
val maxUndefined : t -> value Js.undefined
val getUndefined : t -> value -> value Js.undefined
val checkInvariantInternal : t -> unit
raise when invariant is not held