This is a presentation of and call for participation in development and testing of Python bindings to Succinct Data Structure Library.
From Wikipedia: Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical.
Currently bindings are provided for:
Original library: https://github.com/simongog/sdsl-lite Most of examples from SDSL cheat sheet and SDSL tutorial are implemented.
I am looking for editors/curators to help with branches of the tree. Please send me an email if you are interested.