Data Structures

Rope §

This is essentially an immutable String except many operations that would be $O(n)$ with normal strings are instead $O(\log n)$ or $O(1)$

Ropes will be slower and take more memory than small Strings but they have an asymptotic advantage when working with large documents.