|
Tree Compression with Top Trees Revisited
|
Classes | |
| struct | Coder |
| encode RePair output More... | |
| struct | Dictionary |
| class | HashTable |
| RePair hash table using hashing with open addressing and linear probing. More... | |
| struct | PQEntry |
| Represents a Priority Queue Element. These can be chained into a list. More... | |
| struct | Prepair |
| Prepare data for RePair by consolidating the input symbols. More... | |
| struct | PriorityQueue |
| RePair Priority Queue. More... | |
| class | Records |
| This class holds the text as it undergoes replacements in RePair. More... | |
| struct | RePair |
| Main RePair compression algorithm. More... | |
1.8.9.1