it’s also an odd metric since only 20-60% of the humans completed it. Very 60% of the time they complete it everytime energy.
Ideally they’d run the bots multiple times through (with no context or training of previous run), but I guess that is cost prohibitive?
Curious if anyone knows this, does it use the same buffering system as N++? Meaning, if I open a log file in N++ that is still being written to it never has an issue with blocking the program writing to the file since (it seems) to open it in a separate buffer that can get updated as the file does. A very handy feature for the logs I use, and if Kate can do that I’m all in.
I will test it myself obv, but perhaps someone will be able to answer before I’m able to test, and then also the information will be here :)
XCom
Or I guess anything with keyboard/mouse.
gd to j(g)ump to definition.
Just to say that those features exist in nvim.