Kata

Write a Zipper object that contains two methods: compress(string) should accept a string and return a new string, compressed in some way; and decompress(string) should accept a string as generated with compress, and returns the original string, losslessly. As long as there is some compression on average, and no data is lost or changed, you'll pass the kata. I give you some stats at the end of the test. If you like, you can paste them into the comments at the top of the solution to show how awesome your algorithm is!

I am aware this is a somewhat odd kata to see here on CW. It's more of a challenge than a problem to solve. It will be interesting to see who can make the best algorithm based on this, though...

(NOTE: Must be able to handle empty strings.)

Require has been disabled.