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.
Contains a complete archiver by Haruhiko Okumura. The archiver uses
an LZ engine whose output is compressed with static Huffman. The
file is chopped into pieces which all get their own independent
set of Huffman tree s. ARJ 2.41, ZIP 2.0 and PKZIP 2.04g use
essentially the same method. ZOO and LHA even use excactly the
same method.
項目描述:
Fink is an attempt to bring the full world of Unix Open Source software to Darwin and Mac OS X. Packages are downloaded and built automatically and installed into a tree managed by dpkg.
Fink試圖將Unix開源軟件世界帶入到 Darwin 和Mac OS X。工具包可以被下載和自動生成,并安裝到由dpkg管理的樹狀結構中。
來源: http://sourceforge.net/projects/fink/