> That's not what the author said.

It is exactly what the author said. TFA makes a point that Windows' issues are well known and predictable. And the author would rather endure the daily nuisances infliced by Windows than fix the sporadic breakages that Linux might throw.

LLMs spit out a sequence of tokens that is the most probable continuation of the input. LLMs don't lie any more than technical analysis does when it predicts the most likely trend of stock prices. It's up to you how to use this information.

A better strategy would be to first search the given range for the first empty slot, and exclude everything after that point. Then proceed looking for tophash in the thus-limited interval. The return value has 3 possible values: 1) key found, 2) reached end of interval without finding but it might be in the other half, 3) found an empty slot so the key is not present, not even in the second half.

There's more to Linux than the kernel.

Is it considered good pactice to publish a vulnerability not yet patched in any stable branch?

1. Put them always in the same place. Especially the "back" or "exit" button!

2. Each button should do one thing, not switch between 3 or more modes that you should look to understand which one you've just activated. Negative example: one button to cycle from cuise control, to drive assist, to speed limit, and back to off.

3. The area where a tap is interpreted as a button press should not also be where a swipe is recognized. In moving vehicles it is too easy for your finger to swing just an inch before touching the screen.

4. The active area of a virtual button must be large, larger than the icon it displays, so large that you shouldn't be distracted from driving just to aim at it!

Honestly I don't see much difference between

  upb_MiniTable_FindFieldByNumber

  upb::MiniTable::FindFieldByNumber

> The popular Roaring Bitmap format uses arrays of 16-bit integers of size ranging from 1 to 4096. We sometimes have to check whether a value is present.

There's no claim that this algorithm is universal and performs equally well for other problems.

In fact, note how the compare operation on the data types involved (16-bit integers) is quite cheap for modern CPUs. A similar problem with strings instead of integers would get no benefits from the author's ideas and would actually fare worse, due to useless comparisons per cycle.

Are you sure OP belongs in the second group? He explicitly said he doesn't read all the code generated by his AI:

> I have not read most of the code, and instead focused on results, so you might say this was “vibe-coded.”

Better I or A, to mimick vim's multiple insert after a block selection.

Of course if you already have AutoHotKey running for other reasons, it fits perfectly.

Just last week I was looking for a way to move all the windows from one screen to another in a go. After evaluating many clumsy or over-complicated existing solutions, I asked copilot to write a C program to do it. It had to be minimal and not depend on any runtime framework. A few loops later I had what I wanted without installing third-party tools!

Oh wait...

As a bonus, any operation can be replaced with a lookup into a nxn table.

> Upon freeing an unreachable AllocationRecord, call filc_free on it.

I think the intention was to say: before freeing an unreachable AR, free the memory pointed to by its visible_bytes and invisible_bytes fields.