3 ms·
Succinct data structures. Finished the indexable bit vector, with nanosecond rank/select operations. Working on the range min max tree based balanced parenthese
by ww520 2mo ago
Succinct data structures. Finished the indexable bit vector, with nanosecond rank/select operations. Working on the range min max tree based balanced parentheses succinct tree structure, with support for the usual tree navigation and operations.
- chicagobuss 2mo agowhat a cool answer