Module MutableSet.String

Specalized when key type is string, 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

type value = string

type value = string;

The type of the set elements.

type t

type t;

The type of sets.

val make : unit -> t

let make: unit => t;

val fromArray : value array -> t

let fromArray: array(value) => t;

val fromSortedArrayUnsafe : value array -> t

let fromSortedArrayUnsafe: array(value) => t;

val copy : t -> t

let copy: t => t;

val isEmpty : t -> bool

let isEmpty: t => bool;

val has : t -> value -> bool

let has: t => value => bool;

val add : t -> value -> unit

let add: t => value => unit;

val addCheck : t -> value -> bool

let addCheck: t => value => bool;

val mergeMany : t -> value array -> unit

let mergeMany: t => array(value) => unit;

val remove : t -> value -> unit

let remove: t => value => unit;

val removeCheck : t -> value -> bool

let removeCheck: t => value => bool;

val removeMany : t -> value array -> unit

let removeMany: t => array(value) => unit;

val union : t -> t -> t

let union: t => t => t;

val intersect : t -> t -> t

let intersect: t => t => t;

val diff : t -> t -> t

let diff: t => t => t;

val subset : t -> t -> bool

let subset: t => t => bool;

val cmp : t -> t -> int

let cmp: t => t => int;

val eq : t -> t -> bool

let eq: t => t => bool;

val forEachU : t -> (value -> unit) Js.Fn.arity1 -> unit

let forEachU: t => Js.Fn.arity1((value => unit)) => unit;

val forEach : t -> (value -> unit) -> unit

let forEach: t => (value => unit) => unit;

In increasing order

val reduceU : t -> 'a -> ('a -> value -> 'a) Js.Fn.arity2 -> 'a

let reduceU: t => 'a => Js.Fn.arity2(('a => value => 'a)) => 'a;

val reduce : t -> 'a -> ('a -> value -> 'a) -> 'a

let reduce: t => 'a => ('a => value => 'a) => 'a;

Iterate in increasing order.

val everyU : t -> (value -> bool) Js.Fn.arity1 -> bool

let everyU: t => Js.Fn.arity1((value => bool)) => bool;

val every : t -> (value -> bool) -> bool

let every: t => (value => bool) => 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

let someU: t => Js.Fn.arity1((value => bool)) => bool;

val some : t -> (value -> bool) -> bool

let some: t => (value => bool) => 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

let keepU: t => Js.Fn.arity1((value => bool)) => t;

val keep : t -> (value -> bool) -> t

let keep: t => (value => bool) => 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

let partitionU: t => Js.Fn.arity1((value => bool)) => (t, t);

val partition : t -> (value -> bool) -> t * t

let partition: t => (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.

val size : t -> int

let size: t => int;

val toList : t -> value list

let toList: t => list(value);

In increasing order with respect

val toArray : t -> value array

let toArray: t => array(value);

In increasing order with respect

val minimum : t -> value option

let minimum: t => option(value);

val minUndefined : t -> value Js.undefined

let minUndefined: t => Js.undefined(value);

val maximum : t -> value option

let maximum: t => option(value);

val maxUndefined : t -> value Js.undefined

let maxUndefined: t => Js.undefined(value);

val get : t -> value -> value option

let get: t => value => option(value);

val getUndefined : t -> value -> value Js.undefined

let getUndefined: t => value => Js.undefined(value);

val getExn : t -> value -> value

let getExn: t => value => value;

val split : t -> value -> (t * t) * bool

let split: t => value => ((t, t), bool);

split s key return a fresh copy of each

val checkInvariantInternal : t -> unit

let checkInvariantInternal: t => unit;

raise when invariant is not held