c-rrb | RRB-tree implemented as a library in C

c-rrb is a C library. c-rrb has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Relaxed Radix Balanced Trees (RRB-trees). An immutable vector-like data structure with very good performance characteristics for concatenation and slicing. Also provides transient (mutable-like) variants which you can convert to and from in constant time. +-----------+---------------+ | Operation | Eff. runtime | +-----------+---------------+ | Lookup | O(~1) | | Last | O(1) | | Count | O(1) | | Update | O(~1) | | Append | O(~1) | | Pop | O(~1) | | Iteration | O(n)* | | Concat | O(log n) | | Slice | O(~1) | +-----------+---------------+. For an explanation on how this data structure works in detail, read and then my thesis: This library, unmodified, depends on automake tools and Boehm GC.