radio_free_asgarthr [he/him, comrade/them]@hexbear.net to badposting@hexbear.net · edit-210 days agoPeople keep asking for Epstein Lists, I prefer an Epstein Array.message-squaremessage-square9fedilinkarrow-up156arrow-down10file-text
arrow-up156arrow-down1message-squarePeople keep asking for Epstein Lists, I prefer an Epstein Array.radio_free_asgarthr [he/him, comrade/them]@hexbear.net to badposting@hexbear.net · edit-210 days agomessage-square9fedilinkfile-text
It is a faster and more optimized data type, and I like being able to use numpy functions on my Epstein arrays.
minus-squareiByteABit [comrade/them]@hexbear.netlinkfedilinkEnglisharrow-up14·10 days agoEpstein Hashmaps are the way, you get O(1) read operations
minus-squarepropter_hog [any, any]@hexbear.netlinkfedilinkEnglisharrow-up10·10 days agoHashing is always the answer. That’s why hash browns are so much better than fries.
minus-squarecomrade_pibb [comrade/them]@hexbear.netlinkfedilinkarrow-up6·10 days agoDoesn’t change search complexity, which is what is important here
minus-squareda_gay_pussy_eatah [she/her]@hexbear.netlinkfedilinkEnglisharrow-up4·10 days agoNope, hash tables are worst-case O(n) generally
Epstein Hashmaps are the way, you get O(1) read operations
Hashing is always the answer. That’s why hash browns are so much better than fries.
Doesn’t change search complexity, which is what is important here
Nope, hash tables are worst-case O(n) generally