00000007
ˆ
ƒ-5þÁ (
Index of /FSS-BCZ/root/sys/class/input/mouse2/subsystem/input3/capabilities
Index of /FSS-BCZ/root/sys/class/input/mouse2/subsystem/input3/capabilities
+ ˆl–Ãa¾” *_) ï¸ ™¸&î2Ò˜´oÀ
ƒe—Û_‡I|¥ŠèªÀÃ
C Zip's deflation algorithm is a variation of LZ77 (Lempel-Ziv 1977, see
reference below). It finds duplicated strings in the input data. The
second occurrence of a string is replaced by a pointer to the previous
string, in the form of a pair (distance, length). Distances are
limited to 32K bytes, and lengths are limited to 258 bytes. When a
string does not occur anywhere in the previous 32K bytes, it is
emitted as a sequence of literal bytes. (In this description,
'string' must be taken as an arbitrary sequence of bytes, and is not
restricted to printable characters.)
Literals or match lengths are compressed with one Huffman tree, and
match distances are compressed with another tree. The trees are stored
in a compact form at the start of each block. The blocks can have any
size (except that the compressed data for one block must fit in
available memory). A block is terminated when zip determines that it
would be useful to start another block with fresh trees. (This is
somewhat similar to compress.)
Duplicated strings are found using a hash table. All input strings of
length 3 are inserted in the hash table. A hash index is computed for
the next 3 bytes. If the hash chain for this index is not empty, all
strings in the chain are compared with the current input string, and
the longest match is selected.
The hash chains are searched starting with the most recent strings, to
favor small distances and thus take advantage of the Huffman encoding.
The hash chains are singly linked. There are no deletions from the
hash chains, the algorithm simply discards matches that are too old.
To avoid a worst-case situation, very long hash