Agemixer (01:52:46)
as well it can be told, what kind of timing would be required

Agemixer (01:51:58)
and that's a huge difference

Agemixer (01:51:20)
i mean a demoengine call that produces required tables and code(pieces) up to 64k, from a 20-bytes of algorithm or such

mirrorbird (01:50:56)
ahemmm -- sorry, listening

mirrorbird (01:50:48)
K just sent me a genius idea, it's Space Invaders but you are the space invaders. and they all have names. "poor Kevin died after 2 minutes 3 seconds"...

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

Playtrip

djrandom

Time Left: 3:39