A dense, fast Int set implemented as a 64-ary tree that covers an interval $[0, n)$.

Since: 1.1.0.0

$O(n)$ Creates an IntSet for the interval $[0, n)$.

Since: 1.1.0.0

$O(n + m \log n)$ Creates an IntSet for the interval $[0, n)$ with initial values.

Since: 1.1.0.0

$O(1)$ Returns the capacity $n$, where the interval $[0, n)$ is covered by the set.

Since: 1.1.0.0

$O(1)$ Returns the number of elements in the set.

Since: 1.1.0.0

$O(1)$ Returns whether the set is empty.

Since: 1.1.0.0

$O(\log n)$ Tests whether $k$ is in the set.

Since: 1.1.0.0

$O(\log n)$ Tests whether $k$ is not in the set.

Since: 1.1.0.0

$O(\log n)$ Looks up the smallest key $k$ such that $k \ge k_0$.

Since: 1.1.0.0

$O(\log n)$ Looks up the smallest key $k$ such that $k \gt k_0$.

Since: 1.1.0.0

$O(\log n)$ Looks up the largest key $k$ such that $k \le k_0$.

Since: 1.1.0.0

$O(\log n)$ Looks up the largest key $k$ such that $k \lt k_0$.

Since: 1.1.0.0

$O(\log n)$ Looks up the minimum key.

Since: 1.1.0.0

$O(\log n)$ Looks up the maximum key.

Since: 1.1.0.0

$O(\log n)$ Inserts a key $k$ into the set. If an entry with the same key already exists, it is overwritten.

Since: 1.1.0.0

$O(\log n)$ Deletes a key $k$ from the set. Does nothing if no such key exists. Returns whether the key existed.

Since: 1.1.0.0

$O(\log n)$ Deletes a key $k$ from the set. Does nothing if no such key exists.

Since: 1.1.0.0

$O(\log n)$ Deletes the minimum key from the set. Returns Nothing if the set is empty.

Since: 1.1.0.0

$O(\log n)$ Deletes the maximum key from the set. Returns Nothing if the set is empty.

Since: 1.1.0.0

$O(n \log n)$ Enumerates the keys in the map.

Since: 1.1.0.0