r/ProgrammingLanguages • • Jul 24 '25

[ Removed by moderator ]

/r/ProgrammingLanguages/comments/1m80sb3/removed_by_moderator/

[removed] — view removed post

0 Upvotes

7 comments sorted by

11

u/TheChief275 Jul 24 '25

Oh no, it’s AI slop

2

u/BerkshireKnight Jul 24 '25

It's so strange how we can tell there's something off about the writing, despite the fact it's technically very good English

2

u/Maurycy5 Jul 24 '25

It's very good English, but very poor writing. Just take a look at the first two sentences.

Imagine a young computer scientist tinkering late into the night with a concept called tiny pointers.

How am I supposed to imagine it if I don't know what tiny pointers are? How was he "playing around" with them? Supposedly they're smaller than regular pointers and in that case, how many ways are there even to play around with fewer than the standard 8 bytes?

But ok, let's suspend disbelief for a minute and try to fill in the holes later?

He was trying to miniaturize these arrow-like references to save memory.

I already got the "miniaturization" but from the previous sentence, which mentioned "tiny pointers". This sentence isn't clearing anything up.

Instead, it wastes words on bullshit such as "arrow-like references". Sorry, but pointers aren't exactly arrow-like, unless you're drawing some diagram. And then, they're exactly as arrow-like as references, so this ends up being a pleonasm, another redundancy.

And after that I gave up reading.

-5

u/noobypgi0010 Jul 24 '25

Hey, thanks, just wanted to check if you read the entire article?

-5

u/noobypgi0010 Jul 24 '25

Hey, thanks but just wanted to check did you give the article a read?

1

u/Anxor_ Jul 24 '25

I can see this working well for smaller hash tables, but I wonder how this fares for larger ones. Linear probing sounds way more cache friendly than funneling down, but at the same time the size is divided each time so it probably fits in cache after a few iterations. We're focusing on worst case, though, so it might not even matter.

0

u/noobypgi0010 Jul 24 '25

I think this approach is more of providing a theoretical better worst time complexity then to be actually used in production as we already have a lot of different hashing algorithms that make hash tables quick.