Agemixer (01:50:00)
i don't mean such a generic code compressor

mirrorbird (01:49:31)
applied information theory trying to be pure

mirrorbird (01:49:08)
when it comes to: trying to pack some Farbrausch shit, that's really interesting. "i had an idea to squish the data even smaller, but it will require an extra routine" -- will it be 3 byets more or less

mirrorbird (01:48:30)
the "speed vs. size" is absolutely set in stone, you might not remember the difference between quicksort and shellsort but you know bigger is (potentially) faster.

Agemixer (01:48:21)
and it returns you the pointers for each case, inits, tables, processes etc you can then call from your own program

mirrorbird (01:47:27)

mirrorbird (01:47:25)
i've seen demoscene compressors, sometimes a hint like 'favour 230-bytes' will save you 1 byte in the end, jesus christ, i know

mirrorbird (01:46:56)
yes

Agemixer (01:46:19)
Think that, you call a demoengine API, "make this algo as a compiled code, optimal for cases x,y,z and max RAM = 10 kilobytes"

mirrorbird (01:43:51)
"you forgot me"

Above All Clouds

Bacter (Itzik Shemesh-Sarel)

Saga Musix (Johannes Schultz)

djrandom

Time Left: 3:42