| it.unimi.dsi.mg4j.compression |
|
| Java Source File Name | Type | Comment |
| CanonicalFast64CodeWordDecoder.java | Class | A fast table-based decoder for canonical Huffman codes supporting only codes with limited (less than 64 bits) codewords. |
| Codec.java | Interface | An abstract factory corresponding to an instance of a specific compression technique. |
| CodedCharSequenceBooleanIterator.java | Class | A wrapper for character sequences that exposes them as a boolean iterators
returning the bits obtained coding the sequence, using
a given map from character to symbols in a prefix coder. |
| Coder.java | Interface | Coding methods for a specific compression technique. |
| CodeWordCoder.java | Class | A coder based on a set of codewords. |
| Decoder.java | Interface | Decoding methods for a specific compression technique. |
| Fast64CodeWordCoder.java | Class | A fast coder based on a set of codewords of length at most 64. |
| HuffmanCodec.java | Class | An implementation of Huffman optimal prefix-free coding.
A Huffman coder is built starting from an array of frequencies corresponding to each
symbol. |
| HuTuckerCodec.java | Class | An implementation of the Hu–Tucker optimal lexicographical prefix-free code.
The familiar Huffman coding technique can be extended so to preserve the order in which
symbols are given to the coder, in the sense that if j<k, then the
j-th symbol will get a code lexicographically smaller than the one
assigned to the k-th symbol. |
| PrefixCodec.java | Interface | A codec based on a set of prefix-free codewords.
Prefix codec work by building a vector of prefix-free codewords, one for each symbol. |
| PrefixCoder.java | Interface | A coder based on a set of prefix-free codewords.
Not all coders are codeword-based (for instance,
is not codeword-based). |
| TreeDecoder.java | Class | A decoder that follows 0/1 labelled paths in a tree.
Additional, the
TreeDecoder.buildCodes() method returns a vector
of codewords corresponding to the paths of an instance of this class. |