There is an English dictionary of fuck called The F Word

https://en.wikipedia.org/wiki/The_F-Word_(book)

The BSDs use nvi which is a clone of vi from about 1990.

You might encounter Bill Joy’s vi on a Solaris or illumos machine.

Kessler satellites

> there's basically no reason you'd ever want an alkaline battery except cost

Rechargeable batteries are much cheaper than disposable single-use batteries.

Real hat riots in 1922 https://en.wikipedia.org/wiki/Straw_Hat_Riot

If anyone remembers Serial Mom, Kathleen Turner kills Patty Hearst, for wearing white after Labor Day.

Functions are partial in most programming languages, so the fact that arrays are best modelled as partial functions (rather than total functions) isn’t a huge obstacle.

Yeah, in languages with effects (exceptions/panics). That is a bit more than a partial function though.

Most of the performance regressions are due to lots of dynamic reconfigurability at runtime, which isn’t needed for portability to ancient systems. (Although OpenSSL is written in C it has a severe case of dynamic language envy, so it’s ironic that the pyca team want a less dynamic crypto library.)

I use https://pagefind.app/ for search on my website. It’s really easy to add to a static site.

It isn’t on-die, the ram is separate chips in the same package. See the pics about halfway down https://www.apple.com/de/newsroom/2023/10/apple-unveils-m3-m...

There are actually four variants:

• loop counts downwards vs upwards

• the processed part of the array is a uniform sample of the whole array, or it is a segment that has been uniformly shuffled

Knuth described only the downwards sampling version, which is probably why it’s the most common.

The variants are compared quite well on wikipedia https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle

It's interesting that the two forward versions of the algorithm were added to Wikipedia just a few months ago. (The OP article is from 2020.)