sm3

简单易用的制作压缩包软件，原著老毛桃。使用简单，压缩时间快(easy to use for make cab)

有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)

说明：  一个简单的32位位图压缩算法，基本思想是，扫描像素点，后面有雷同的就记下重复次数。(A simple 32-bit bitmap compression algorithm, the basic idea is to scan pixel, behind identical repetitions on the record.)

一个强大的图象压缩开发包，支持压缩格式为jpeg，jpeg2000有损无损压缩(A powerful image compression development kit, support for compression formats jpeg, jpeg2000 detrimental to lossless compression)

this is renderer function

霍夫曼编码的C++实现,输入一组字符串，输出每个字符的编码及整个字符串的霍夫曼编码。(realization of Huffman coding using VC++)

哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)

此EA是本人长期实战总结的一个稳定盈利的利器，现在在期适用交果良好。(This EA is my long-term combat summary of a stable profit tool, now in the application of good fruit.)

Docuemtns,Hot Documents

用C++的模板类实现的霍夫曼树及其编码过程，可视地展示霍夫曼树的结构。(Huffman tree and its encoding process to achieve C++ template class, visual display of the structure of the Huffman tree.)