So it has the intended effect.
Log files themselves don't, but I'm just comparing it with simpler files with simpler structure with simpler algorithms with better complexity.
It's not necessarily about the load, it's about the algorithmic complexity. Going from lists (lines in a file, characters in a line) to trees introduces a potentially exponential increase in complexity due to the number of ways the same list of elements can be organized into a tree.
Also, you're underestimating the amount of processing. It's not about pure CPU computations but RAM access or even I/O. Even existing non-semantic diff implementations are unexpectedly inadequate in terms of performance. You clearly haven't tried diffing multi-GB log files.
Just means it's a shit charger that can't handle multiple devices at once because that requires higher quality electronic components.
How do you expect it to be shown though?
Because text is text and all } are the same.
Diffing algorithms on trees might not be as efficient, especially if they have to find arbitrary node moves.
But where's the start?
Clearly not enough active ones for each and every project out there.
Most translations are contributed by external users for languages that the project developers don't speak themselves, so they can't always check everything unless there's multiple active translators for one language.
That wasn't my statement... Stop intentionally misinterpreting what people say!
Or you could just write your backend in JS and save a lot according to this table.
The big inefficiency of PHP is that every request is handled in a new instance as opposed to one process running the server continuously.