pertique

It's very common in the US, at least the parts I've been. It depends on the restaurant, of course, but most places will provide a takeout box to take home uneaten food if you ask.

In fact, it's not uncommon for the waiter to offer a box unprompted if you have a fair amount of leftover food.

Not to knock Pat Finnerty (his content might be comparatively good) but I thought this was a satirical recommendation. Between the fluff, 8 minute intro, and unrelated sponsorships (for hot sauce too! which was also called out in the thread) he's quite the Youtuber.

I see a few use cases depending on the password manager. For local, it probably doesn't add too much.

For cloud-based solutions, it mitigates the risk of having your master password snooped when typing it in public.

It looks like the author either confused about this argument, or are refuting an argument I've never heard.

They're refuting the argument that each and every letter should be pronounced according to the word it represents. Their take on pronouncing 'JPEG' makes this the most clear; they believe if this argument were true then 'JPEG' would be pronounced 'JEG' due to the silent/'F' sounding 'P' in 'Photographic.'

Honestly, I've never heard someone argue this, and it's a bit ridiculous for all the reasons the author put forward. I've heard this argument for just the first letter ('Graphical' > hard 'G') before which, as you pointed out, fits every example they've given.

A good high-level breakdown of H.264: https://sidbala.com/h-264-is-magic/

Associated HN post, although there have been a few: https://news.ycombinator.com/item?id=30710574

More technical look at video codecs in general with sources: https://github.com/leandromoreira/digital_video_introduction...

Perhaps I'm misunderstanding you, but doesn't the existence of collisions guarantee that h(1)== h(some_real_data) unless the hash function is hilariously broken?

Cryptographically secure hash functions state that it's unlikely to occur, but the fact that you can take data a greater size than the output will guarantee that you'll have collisions. If you have collisions and the hash function is generating output that is uniformly distributed across the possible output space, you will hit h(1)==h(some_real_data) at some point (edit: given that "some point" is a mathematical concept, not an actual point in time. Of course, there's no guarantee that we'll ever get collisions for hash functions with massive output spaces. But I'd argue that's a limit of computing, not of the math behind the functions themselves)