just to see if I can outperform the students in my class, I want to write fast Huffman decoder codes are up to 29 bits so a full table doesn't seem like the answer does a 12-bit or 16-bit lookup table followed by a secondary procedure sound like the right answer?
-
Show this thread
-
Replying to @johnregehr
yep, multi-tables is the first idea for tables > 12 bits. Do you have that many symbols to require such depth ? Or is it restricted to the standard byte value s?
3 replies 0 retweets 6 likes -
Replying to @Cyan4973 @johnregehr
I <3 multi-level tables from experience doing Unicode tables in musl.
1 reply 0 retweets 1 like -
Replying to @RichFelker @Cyan4973
we're going to read some musl functions in this class!
1 reply 0 retweets 1 like
Replying to @johnregehr @Cyan4973
Don't make it the embarrassing ones.
7:45 PM - 29 Jan 2018
0 replies
0 retweets
1 like
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.