[Most Recent Entries] [Calendar View] [Friends View]
Friday, July 26th, 2024
| Time | Event |
| 11:40a | "Girls don't do risky things" https://en.wikipedia.org/wiki/List_of_p Having successfully sent a cat over the falls in a barrel two days previously, Taylor survived going over the falls in an oak barrel as a stunt designed to help her financially. She exited the barrel bleeding but was not seriously injured.[1] Dunia Sayegh, a 27-year-old resident of Toronto, dropped her two-month-old son Hesham over the railing and into the river just up from the brink of Horseshoe Falls, whereupon he was quickly swept over the falls. The boy's body was never found. Sayegh was arrested and charged with second-degree murder;[38][39][40] the charges were dismissed.[41] Compare to men: Delahanty, a baseball player who was later elected to the National Baseball Hall of Fame, was swept over the falls having fallen from the International Railway Bridge; he had been kicked off a night train for drunk and disorderly conduct and threatening passengers. Delahanty's body was later recovered near the Maid of the Mist's berth; his body was mangled and one leg was severed.[6] I.e. high testosterone macho was kicked out of a train for being toxic. Current Mood:  amused |
| 12:12p | The Best Bitmap Implementation What I found that is that uint64_t keyed bitmaps with constant uint256_t pages work best. uint256_t is large enough to remove the cache factor on my CPU. Since uint256_t fits inside a 32byte cache line. That works as long as the open hashing keeps keys separate from values. Such scheme would be super easy to implement. Unfortunately only Clang supports uint256_t https://gcc.gnu.org/bugzilla/show_bug.c So I will have to parametrize the page size with a bunch of messy macros. Current Mood:  accomplished |
| 3:05p | 1m 33.67s (down from 12m 37.35s) to iterate 10 times over 32bit address space That is on 12th Gen Intel(R) Core(TM) i7-12700H 2.30 GHz Although I had to increase the value size to uint512_t Apparently my laptop's CPU's cache is larger than 32 bytes. I think with actual optimizations one can do it in under 1m.  Current Mood: accomplished |
| 7:50p | Building GNU Software On Windows Editing ./configure is really annoying. IIRC configure scripts were invented by the same retard who invented Perl. In fact, Perl was so shitty, it required this monstrosity to build.  Current Mood:  annoyed |
| 8:56p | Judy Arrays Recommended for Bitmaps Ok. Wasted the time compiling this shit. Both https://code.google.com/archive/p/judya And https://judy.sourceforge.net/downlo Slowest data structure thing so far. Even worse than roaring bitmap. If you have uint64_t key, the algorithm will break it into bytes. Then it goes through 8 levels of a tree, incurring a cache miss. Each fucking time! Somehow all these useless data structure are made by professors. They need to cook this snake oil to get their PhDs. Just like niggers need to push'n'pimp to get gangsta status. Current Mood: annoyed |
| 11:43p | Surprisingly replacing INLINE uint64_t PRFX(NH_PFX,,Hash_)(uint64_t key) { key ^= key >> 33; key *= 0xff51afd7ed558ccd; key ^= key >> 33; key *= 0xc4ceb9fe1a85ec53; key ^= key >> 33; return key; } with INLINE uint64_t PRFX(NH_PFX,,Hash_)(uint64_t key) { return (key ^ (key >> 33)) * 0xff51afd7ed558ccd; } Makes the code setting 2**32 bits 20% faster. Counter intuitive, since every one recommends stronger hash functions. Guess that is another "security expert" thingie. Because some hacker can spam your hashmap with collisions. Which never happens in reality, because nobody cares about my apps. Lesson learned: pay no attention to retards, especially renowned PhD retards. Current Mood: amused |
| << Previous Day |
2024/07/26 [Calendar] |
Next Day >> |