Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Fully Managed MySQL, PostgreSQL, and SQL Server
Automatic backups, patching, replication, and failover. Focus on your app, not your database.
Cloud SQL handles your database ops end to end, so you can focus on your app.
I want to test some ways to store the data for the Huffman Tree
Lectures on Huffman Code mostly focus on creating the Huffman Tree and converting the given data into the new bitmap. But what about the informations needed to create the Huffman Tree? They must be stored as well. With this project I want to test some possibilities to store these data.
gmp,h is needed to compile.
See: http://gmplib.org/
A database system, another, older database system, a compression library, something to do with menus and XML, and whatever I happen to be working on at the time.
A human-readable ISC-Licensed implementation of the LZO1X algorithm.
LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable.
People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed.
So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language.
...