239 karma · joined August 29, 2020
No hint feathre though, the hints are the letters going away. You'll probably have to use a scrabble search or something.
c $> pwd
/a/b/c
c $> dir1
dir1 $> ..
c $> ../..
/ $>Time complexity may be O(lines), but a compiler can be faster or slower based on how long it takes. And for incremental updates, compilers can do significantly better than O(lines).
In debug mode, zig uses llvm with no optimization passes. On linux x86_64, it uses its own native backend. This backend can be significantly faster to compile (2x or more) than llvm.
Zig's own native backend is designed for incremental compilation. This means, after the initial build, there will be very little work that has to be done for the next emit. It needs to rebuild the affected function, potentially rebuild other functions which depend on it, and then directly update the one part of the output binary that changed. This will be significantly faster than O(n) for edits.
This exists and it's called SponsorBlock. It automatically skips past sponsored segments. Debatable if that is altering content though
It's clear to a moderator who sees the comment, but the user asking for a summary could easily have not seen it.