What these data structures do is generalize rank/select over "arbitrary alphabets". They can store text or DNA in a compact way while still allowing important query operations such as count and locate. The FM-index crate provides this functionality, originally using the fid crate but recently ported to use vers. A balanced parentheses tree allows navigation within a tree of data using only 2 bits per node.