Using tree data structures to implement terminal split panes
blog.warp.dev
blog.warp.dev
Its always smelt to me as a "we can, so we will" rather than a genuine need.
I find the longer the lag, the harder I press the keys, and the more it hurts my hands. So lower latency helps me a lot and I immediately notice lag.
As for why trees seem to be a novel concept: the code is written in Rust, and tree algorithms specifically are hard to do in the traditional way (pointers to pointers being moved around) without unsafe code. While you're at it, you may just as well explain trees I guess.
Of course Rust trees can be done, but the resulting data structure is often unwieldy and ugly. When I'm writing Rust, I tend to avoid writing structures like that because I don't want to deal with Box<Arc<RefCell<X>>> or whatever the correct type is for writing mutable tree structures.
I'll admit that this being Rust is likely the cause, but this is a simple binary tree. There's no need for backpointers or any troublesome algorithms or anything.
It's just a tad annoying that Rust pushes people towards crappy solutions by making the better solution _spooky and dangerous_ when said solution doesn't even involve the _spooky and dangerous_ `unsafe` keyword.
On a side note, I wasn't able to figure out what problem this company is trying to solve. I've been using nvim+tmux+kitty and it does all the things they sell, while being open source.
The blog author thinks copying a smaller than 10x10 array of pointers, less than once per minute, is a memory-intensive, performance-sensitive operation, so it's pretty clear that they don't know what they are doing.