Ficus is a library of Fast, Immutable Collections, mostly based on trees. Currently it contains just one data structure, RRBVector, a list-like collection with efficient splitting, concatenation, and inserting and removing anywhere in the list.
TODO: Write an explanation of why RRBVector is an efficient data structure.
TODO: Write this.
Step-by-step guides to using Ficus collections.
Guides you through the steps involved in addressing key problems and use-cases.
How the RRBVector structure works internally, in more detail.
API reference for the RRBVector namespace.