String data structure from tree to linked list #3
Description
rv_strings are currently implemented as a tree, where each node either has two pointers to each child or 128 bytes of character data (i.e. actual string is stored in the leaves). This might be more efficiently implemented as a linked list, with 64 bytes of characters in each node and other data such as total length, node length, next node, prev node, head, tail, and possibly more character data.
TO-DO:
-Implement new data structure
-Re-implement existing algorithms to use new data structure
-Run unit tests to ensure functionality is not changed
-Benchmark (memory and runtime) against tree implementation?