A static Wavelet Matrix without automatic index comperssion.

Since: 1.1.0.0

$O(n \log n)$ Creates a RawWaveletMatrix from a vector $a$.

Since: 1.1.0.0

$O(\log |S|)$ Returns $a[k]$ or Nothing if the index is out of the bounds. Try to use the original array if you can.

Since: 1.1.0.0

$O(\log |S|)$ Returns the number of $y$ in $[l, r) \times [0, y_0)$.

Since: 1.1.0.0

$O(\log |S|)$ Returns the number of $y$ in $[l, r)$.

Since: 1.1.0.0

$O(\log |S|)$ Returns the number of $y$ in $[l, r) \times [y_1, y_2)$.

Since: 1.1.0.0

$O(\log |S|)$ Returns the index of the first $y$ in the sequence, or Nothing if $y$ is not found.

Since: 1.1.0.0

$O(\log |S|)$ Returns the index of the $k$-th occurrence (0-based) of $y$, or Nothing if no such occurrence exists.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns the index of the first occurrence (0-based) of $y$ in the sequence, or Nothing if no such occurrence exists.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns the index of the $k$-th occurrence (0-based) of $y$ in the sequence, or Nothing if no such occurrence exists.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns the index of the $k$-th (0-based) smallest value. Note that duplicated values are counted as distinct occurrences.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns both the index and the value of the $k$-th (0-based) smallest value. Note that duplicated values are counted as distinct occurrences.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns the index of the $k$-th (0-based) largest value. Note that duplicated values are counted as distinct occurrences.

Since: 1.1.0.0

$O(\log |S|)$ Given an interval $[l, r)$, it returns both the index and the value of the $k$-th (0-based) largest value. Note that duplicated values are counted as distinct occurrences.

Since: 1.1.0.0

$O(\log a)$

Since: 1.1.0.0

$O(\log a)$

Since: 1.1.0.0

$O(\log a)$ Returns $k$-th (0-based) biggest number in $[l, r)$. Note that duplicated values are counted as distinct occurrences.

Since: 1.1.0.0

$O(\log a)$

Since: 1.1.0.0

$O(\log |S|)$ Looks up the maximum $y$ in $[l, r) \times (-\infty, y_0]$.

Since: 1.1.0.0

$O(\log a)$ Finds the maximum $x$ in $[l, r)$ s.t. $x_{0} \lt x$.

Since: 1.1.0.0

$O(\log |S|)$ Looks up the minimum $y$ in $[l, r) \times [y_0, \infty)$.

Since: 1.1.0.0

$O(\log |S|)$ Looks up the minimum $y$ in $[l, r) \times (y_0, \infty)$.

Since: 1.1.0.0

$O(\min(|S|, L) \log |S|)$ Collects $(y, \mathrm{rank}(y))$ in range $[l, r)$ in ascending order of $y$. Note that it's only fast when the $|S|$ is very small.

Since: 1.1.0.0

$O(\log A \min(|A|, L))$ Internal implementation of assocs.

Since: 1.1.0.0

$O(\min(|S|, L) \log |S|)$ Collects $(y, \mathrm{rank}(y))$ in range $[l, r)$ in descending order of $y$. Note that it's only fast when the $|S|$ is very small.

Since: 1.1.0.0

$O(\log A \min(|A|, L))$ Internal implementation of descAssoc.

Since: 1.1.0.0