In developing this framework, care has been taken to make it as generic as possible. This gives tremendous flexibility to the developer, and solves one of the major problems that is typically found with genetic algorithms - that of trying to represent the problem domain as a string of bits. LaTeX and HTML documentation is provided. It only requires a few member functions that need to be implemented in order to allow your objects to evolve. GLib is a library which includes support routines for C such as lists, trees, hashes, memory allocation, and many other things.
Decompression requires no memory.
In addition there are slower compression levels achieving a quite competitive compression ratio while still decompressing at this very high speed. Requires no memory for decompression. Compression is pretty fast. Requires 64 kB of memory for compression. Allows you to dial up extra compression at a speed cost in the compressor.