Search Results for "code::block"

UglifyJS is a JavaScript compressor/minifier written in JavaScript. It also contains tools that allow one to automate working with JavaScript code. A parser which produces an abstract syntax tree (AST) from JavaScript code. A code generator which outputs JavaScript code from an AST, also providing the option to get a source map. A compressor (optimizer). it uses the transformer API to optimize an AST into a smaller one. A mangler, reduce names of local variables to (usually) single-letters. ...

Snappy is a compression/decompression library. It does not aim for maximum compression, or compatibility with any other compression library; instead, it aims for very high speeds and reasonable compression. For instance, compared to the fastest mode of zlib, Snappy is an order of magnitude faster for most inputs, but the resulting compressed files are anywhere from 20% to 100% bigger. Snappy is intended to be fast. On a single core of a Core i7 processor in 64-bit mode, it compresses at...

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!

A differential compresor (or a binary diff) for huge files. Unlike other tools, e.g. xdelta3, it searches for matching data through the whole source file, even if it weights several gigabytes, while using much less memory (with default configuration approx 25x less than the size of the source file). Output files are not compressed, so you can use any compressor you like with great results. It is quite fast for very similar files (about the speed of hdd, however it reads input files twice)...

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

Compress videos, remove audio, manipulate thumbnails, and make your video compatible with all platforms through this lightweight and efficient library. 100% native code was used, we do not use FFMPEG as it is very slow, bloated and the GNU license is an obstacle for commercial applications. In addition, google chrome uses VP8/VP9, safari uses h264, and most of the time, it is necessary to encode the video in two formats, but not with this library. All video files are encoded in an MP4 container with AAC audio that allows 100% compatibility with safari, mozila, chrome, android and iOS. ...

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.

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.

SEG-Y files need special compression because they don't compress well using gzip and the like. The code is cross-platform C++ using nothing else than standard system libraries. This is a spin-off from the OpendTect project (http://opendtect.org).

A simple C++ library to code/decode data.

Java HTML/XML Compressor is a very small, fast and easy to use library that compresses given HTML or XML source by removing extra whitespaces, comments and other unneeded characters without breaking the content structure.

OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)

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.

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.

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

A pure-Java compression library suitable as a drop-in replacement to current native implementations of java.util.zip. Typical scenarios where it is useful are applets, where access to native code is not allowed. It may also be useful on platforms where it

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

This is an academic project. A library and a sample program will be developed, that will implement the Burrows-Wheeler compression algorithm, using C++ and templates. This is the same algorithm for BZip.

pgn2pgc converts text Portable Game Notation (PGN) chess files into highly compressed Portable Game Coding (PGC) chess files. This is the only implementation of PGC as described in the PGN standard. Code is also useful for writing chess software.

...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.