>> Anyone know anything about detecting sub-strings in strings? If you >> want to reply off the RB list that's fine, but on my ElfData list is >> a good place to reply. >> >> I've finally decided on a good decompressor code. I'm writing some >> compression code for my plugin, you see. >> >> It's pretty cool actually! I got so many optimisations over the >> standard "deflate" algorithm. Mine for example can even compress >> strings of 2 bytes down to 1 byte. > > It can compress any string of 2 bytes down to 1 byte without loss?
No, not any string.... any substring of 2 bytes if there are multiple occurances of them. Like this: AaBbCcAaCcBbAa My format could compress this, because there are patterns even if the patterns are only 2 bytes long :) Aa can be written in 1 byte, Bb in 1 byte, Cc in one byte... This string however, it can't compress: AaBb That's because there's only one occurance of each 2 byte long piece. Instead it would have to escape the entire thing, giving a 1 byte overhead. And no my compressor isn't "lossless" for all data :P I still haven't figured out the magical algorithm that can predict everything in time and space. -- http://elfdata.com/plugin/ "String processing, done right" _______________________________________________ Unsubscribe or switch delivery mode: <http://www.realsoftware.com/support/listmanager/> Search the archives: <http://support.realsoftware.com/listarchives/lists.html>
