this post was submitted on 16 Jul 2025
56 points (100.0% liked)

badposting

640 readers
217 users here now

badposting is a comm where you post badly


This is not a !the_dunk_tank@hexbear.net alternative. This is not a !memes@hexbear.net alternative. This is a place for you to post your bad posts.

Ever had a really shitty bit idea? Joke you want to take way past the point of where it was funny? Want to feel like a stand-up comedy guy who's been bombing a set for the past 30 minutes straight and at this point is just saying shit to see if people react to it? Really bad pun? A homemade cringe concoction? A cognitohazard that you have birthed into this world and have an urge to spread like chain mail?


Rules:

  1. Do not post good posts.
    • Unauthorized goodposting is to be punished in the manner of commenting the phrase "GOOD post" followed by an emoji that has not yet been used in the thread
    • Use an emoticon/kaomoji/rule-three-abiding ASCII art if the rations run out
  2. This is not a comm where you direct people to other people's bad posts. This is a comm where you post badly.
  3. This rule intentionally left blank.
  4. If you're struck for rule 3, skill issue, not allowed to complain about it.

Code of Conduct applies just as much here as it does everywhere else. Technically, CoC violations are bad posts. On the other hand: L + ratio + get ~~better~~ worse material bozo

founded 2 years ago
MODERATORS
 

It is a faster and more optimized data type, and I like being able to use numpy functions on my Epstein arrays.

top 9 comments
sorted by: hot top controversial new old
[–] LaGG_3@hexbear.net 16 points 1 week ago (1 children)
[–] dat_math@hexbear.net 8 points 1 week ago

you fools, we need a system that can handle Epstein tensors of arbitrary rank!

[–] iByteABit@hexbear.net 14 points 1 week ago (3 children)

Epstein Hashmaps are the way, you get O(1) read operations epstein

[–] propter_hog@hexbear.net 10 points 1 week ago

Hashing is always the answer. That's why hash browns are so much better than fries.

[–] comrade_pibb@hexbear.net 6 points 1 week ago

Doesn't change search complexity, which is what is important here

Nope, hash tables are worst-case O(n) generally

[–] insurgentrat@hexbear.net 7 points 1 week ago

I don't want to precommit to a finite number of ghouls. However o(1) access time is good. Show me the epistein hash table

[–] ButtBidet@hexbear.net 5 points 1 week ago

Merge sort on the Epstein array, because I want to merge all their bodies together.

[–] AernaLingus@hexbear.net 5 points 1 week ago

I prefer an Epstein Linked List because cache rhymes with fash fash-bash