We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 2a65173 commit b90196cCopy full SHA for b90196c
readme.md
@@ -16,7 +16,7 @@ since the intrinsics speed up both `rank` and `select` operations by a factor of
16
- An Elias-Fano encoding of monotone sequences supporting constant-time predecessor/successor queries.
17
- Two Range Minimum Query vector structures for constant-time range minimum queries.
18
- A Wavelet Matrix supporting `O(k)` rank, select, statistical, predecessor, and successor queries.
19
-- A succinct tree structure supporting level-ordered and depth-first-ordered tree navigation and subtree queries.
+- A succinct tree structure (BP Tree) supporting level-ordered and depth-first-ordered tree navigation and subtree queries.
20
21
## Why Vers?
22
- Vers is among the fastest publicly available bit vector implementations for rank and select operations.
0 commit comments