(from the title only) At first I though this was about Physics, but then I remembered I'm actually graduated in Compsci

Thank u and please continue this series

I read that paper and it seems to suggest that the method I use for allocation is actually faster than using a rope. I use a geometric allocation scheme and I retain the length of the string. As far as the example of reading in a file by lines, it's a shame I didn't read this paper sooner because it's not too dissimilar from the method I came up with independently where I create a sparse array where it's just a series of partially filled buffers in a balanced tree referenced by their indices. Unless I'm misunderstanding what they're saying where it sounds like they're saying each node in a rope would be sized specifically for whatever data it stores, while I used the same size for each node and allowed for unfilled space before and after each string piece. I used a tag to denote a partial line which actually allowed me to size the buffers in relation to the screen width in characters so that I could very easily wrap lines. It was a lazy method because words would be clipped in half in a lot of cases, but it was really fast when it came to edits. It wouldn't be too difficult to wrap by words, it would just require a slight adjustment to the buffer filling code, but maybe I should continue developing it.

Thank you. I like your channel a lot.

Why mention that an issue with char array strings is immutability and then not go into how ropes approach that at all lmao I remember as a college project trying to figure out how to make a text editor and I did end up using a rope. I still don't know how immutability comes into it, and I'm pretty sure I read this specific paper