If someone eats 3 sandwiches, they were hungry.

If someone eats 6 slices of plain bread, they’re weird.

You’re the idiot hand writing HTML into a system that takes Markdown.

Stupid AND rude. You must really struggle in life.

My point is how could you ever count on deletion when the content is being federated?

Even if Lemmy devs made account deletion easy and cascade deletes your content, all it takes is one server run by an archivist and that content is never going away.

It seems inherently unfixable in a federated system, like trying to unsend an email.

Nothing is ever really deleted on the internet, especially if it was automatically replicated to dozens of other servers.

MD always felt like a ripoff to me because you had to buy a bunch of overpriced disks from the sole supplier and then carry them all around in a little wallet.

As soon as the first hard drive MP3 players like the Rio came out, MD was a dead end.

Not always but often. You could even say almost always. 😉

Prepaying a mortgage is almost always a worse investment than anything else because mortgage interest is tax deductible.

Slow your roll buddy. I didn’t say it’s meaningless to everyone, only that it wouldn’t change my life.

To your example, I already own a house but $93k won’t pay off my mortgage, or let me retire early, or cover my kids’ college costs.

The article is discussing how to reduce the constant time factor which depends on the filling fraction, which is a speed-memory tradeoff when creating the hash table.

The innovation described allows for the use of fuller tables which are resized less frequently, or faster insertion/retrieval for the existing filling fraction.

You added $100k by typo.

$93,770 would be nice but not life changing.

In the article, x is not the size of the hash table, it is the inverse of the table’s filling fraction. A 1000-element table that is 90% full has x=10, N=1000.

Since they’re not discussing scaling of data sizes, would be confusing to use O(N) notation or people would make that assumption.

If you use a hash table, you search every time you retrieve an object.

If you didn’t retrieve, why would you be storing the data in the first place?

Hash tables are used in literally everything and they always need to minimize resizing because it’s a very expensive operation.

I suspect this will silently trickle into lots of things once it gets picked up by standard Python and JavaScript platforms, but that will take years.

What’s your opinion on people without strong opinions?

That’s just another monopoly. How much do you trust your government?

Reminder that the Nokia the smart phone company was spun off/renamed HMD and this Nokia sells cell network equipment to telecoms.

I don’t need wireless 1Gbps around town.

I need reliable 100kbps when I’m out in the boonies.

Fixing coverage gaps is not sexy but is way more useful.

Where TF did my family go?