typedef struct {char a[9];} t; t b(uint8_t x) { t s; for (int i=8; i>0; x>>=1) s.a[--i]=48+(x&1); s.a[8]=0; return s; }
-
-
Replying to @stevecheckoway @johnregehr
fits in a tweet and almost as terrible to read.
1 reply 1 retweet 3 likes -
Replying to @stevecheckoway @johnregehr
Is this a competition now? I'm very competitive when it comes to terrible code..pic.twitter.com/I9e0iJK1mH
3 replies 1 retweet 8 likes -
if only I had a superoptimizer ...
1 reply 0 retweets 3 likes -
@spun_off I guess the superoptimized version of this would be a lookup table with 256 entries.
1 reply 0 retweets 3 likes
Replying to @oe1cxw @alastair_d_reid and
Claire Xen 🏳️⚧️ 🏳️🌈 🧙🏻♀️ BLM 🏴 🚩 Retweeted Claire Xen 🏳️⚧️ 🏳️🌈 🧙🏻♀️ BLM 🏴 🚩
This suboptimized version is much more fun to think through:https://twitter.com/oe1cxw/status/801418398546690049 …
Claire Xen 🏳️⚧️ 🏳️🌈 🧙🏻♀️ BLM 🏴 🚩 added,
5:48 AM - 23 Nov 2016
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.