i dont know of any actual implementations, but it sounds like it might be a good candidate for Huffman coding. Its not too difficult to implement. :)
here's a good page here explaining how it works : http://www.cs.duke.edu/csed/poop/huff/info/ and here is a page here with python code : http://gumuz.looze.net/wordpress/index.php/archives/2004/11/25/huffman-encoding/ as to whether you can actually achieve that level of compression really depends on your input. If you absolutely must get to 25% of the input size you might need to consider something a bit more hardcore :) What concerns me is are you really going to generate a 1000 character url? or are the numbers just for demonstration purposes? thanks, Martin Henrik Lindahl wrote: > Hi, > I wonder if anyone knows of symmetric string compression librarys for AS. > What I'm looking for is functions to compress a string of about 4000 > characters to something like 1000 and then be able to recreate the > original string. A symmetric String codec?;) > > Can this be done efficiently in AS2? > > Oh, and the encoded string must be displayable in a web browsers url;) > > Cheers > /Henrik > > > > _______________________________________________ > osflash mailing list > [email protected] > http://osflash.org/mailman/listinfo/osflash_osflash.org > -- Martin Wood http://relivethefuture.com/choronzon _______________________________________________ osflash mailing list [email protected] http://osflash.org/mailman/listinfo/osflash_osflash.org
