Dynamic searchable sequence is very similar to Dynamic Vector except that it uses packed searchable sequences in leaf nodes and has additional indexes in balanced partial sum tree, one for each symbol in the target alphabet.

All operations (insert/update/access/rank/select) have O(log N) time complexity.

Currently Memoria provides dynamic sequences for 1 and 8 bit symbols, 2-7-bit sequences are planed for next releases. For larger alphabets use Walelet Trees.