Search Results for "forum source code"

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!

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

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

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.

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

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