Search Results for "code::block"

...You can use 7-Zip on any computer, including a computer in a commercial organization. You don't need to register or pay for 7-Zip. And there is command line version for Linux and macOS. Most of the source code is under the GNU LGPL license. The unRAR code is under a mixed license with GNU LGPL + unRAR restrictions. Check the license for details.

LAME is an educational tool to be used for learning about MP3 encoding. The goal of the LAME project is to improve the psycho acoustics, quality and speed of MP3 encoding. Note: we provide source code only!

Important: removed xz lib 5.6.1 from all compressed files, now we are using release 5.4.0 because it is stable C code and executable to do an archive of multiples files or folders a la tar, with the advantage of full compatibility with future versions This means that if in the future someone improve the code older files will still be able to be extracted without problems, it looks like an improvement over tar. Its an application to compress and extract files in the .val format, when functional it can be used to replace tar files, the advantage is that it will handle any previous versions without problems, it is almost as fast as tar, for the moment it can generate .val files in gzip, bzip2, bzip3, lz5, brotli2, lzop2, Zstandard, xz and LZMA, but more compression methods will be added like our DLL version of this console application, a lot need to be done yet Documentation at https://parolin.sourceforge.io

Simple, fast implementation of LZW (Lempel–Ziv–Welch) data compression algorithm in C. - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation

Lossless compressor for multichannel 8,16 and 24 bits audio data, with the ability of password data protection. Being 'lossless' means that no data/quality is lost in the compression - when uncompressed, the data will be identical to the original.

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/

gzx is a C library and a command line tool for fully GZIP-compliant file compression with fast random access read support. gzx includes a FUSE (filesystem in userspace) client that allows to access the compressed files with arbitrary applications.

Shoelacer generates C code to compress short strings based upon provided sample data. The resulting routines use small models with low memory overhead.

Lossless compression program with various algorithms included. Intended for large XML files, but can compress any files. Best results with block compression (BWT+MTF+RLE) on large block over alphabet of words.

Compression/decompression library, capable of operating on a stream and intended to be used on systems restricted in code and stack size.

Help implement an industrial strength Burrows-Wheeler transform compressor! Initial release covers block-sort, MTF coding, RLE coding, Huffman coding

...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. I expect a severe performance degradation, but I leave optimizing for speed to other people.