Index of values

SetHash.add h x adds x to the set h, resizing the set when the number of elements is equal or more than the size of the set.

SetHash.add_unsafe h x adds x to the set h, without resizing the set.

SetHash.capacity is the size of the set, i.e.

Empty a set.

The comparison function used to compare elements.

SetHash.copy h returns a copy of h

SetHash.copy_resize h n return a new set with the same elements as h and with size n

SetHash.create n k creates a new, empty set with initial size n.

SetHash.empty() creates an empty set of zero size.

SetHash.equal h1 h2 tests whether the sets h1 and h2 are equal, that is, contain equal elements.

SetHash.exists p h checks if at least one element of the set satisfies the predicate p.

SetHash.fold f h a computes (f xN ... (f x2 (f x1 a))...), where x1 ... xN are the elements in s.

SetHash.for_all p h checks if all elements of the set h satisfy the predicate p.

A hashing function on elements.

SetHash.iter f h applies f to all elements of the set.

SetHash.keys h returns an array with the elements of the set in unspecified order.

SetHash.length h returns the number of elements in the set.

SetHash.mem h x checks if x is a member of h.

SetHash.remove h x removes the element x from the set h.