实现文件压缩和解压缩，全英文有兴趣的同志请仔细阅读，相信你一定能得到一些启发...

java实现的类winrar的压缩工具，支持zip,jar,gz.还不是很完善。-achieve the kind WinRAR compression tools, support zip, jar, gz. It is not perfect.

本程序分两部分，分别为界面和驱动程序，其中驱动程序为压缩解压缩的核心程序。 开发环境为VC6.0。 界面部分可由crs->ddu->ddu.dsp建立工作组，编译生成的可执行程序为debug中的ddu.exe 驱动部分由crs->驱动->驱动.c编译生成可执行文件。 具体压缩解压缩操作可见《操作手册》。-This procedure was divided into two parts, namely, interface and driver, one of the drivers for the compression of the core decompression procedure. Development environment for VC6.0. Interface may be part of crs->ddu-> ddu.dsp Working Group set up, the compiler generates the executable program to debug the ddu.exe driven in part by crs-> Driver-> Driver. C compiler to generate executable file. Extract specific compression operation can be seen " manual."

自己刚编的一个串口测试程序,可以下下来看一下,-their first draft of a serial test procedure can look at the Lower,

this upload sample-this upload sample................

一个解压程序,只要设定了解压路径和解压文件的种类,就可以随意解压-A decompression procedure, as long as the set-extracting file path and extract the type, it can extract

struts的一个入门例子,struts的一个入门例子!-struts example of a portal, a portal struts example!

经典的霍夫曼算法，此例为算法测试过程实现！并去除bug-Classic Huffman algorithm, in this case, the testing process for the algorithm to achieve! And remove the bug

哈夫曼压缩程序哈夫曼压缩哈夫曼压缩哈夫曼压缩程序

ROI的ezw和huffman混合压缩编码，对感兴趣区域采用了huffman无损压缩，非感兴趣区调用ezw压缩-ROI ezw mixed and Huffman coding. the region of interest using a lossless compression Huffman, non-interest area called compression ezw

This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer.