Tree Compression with Top Trees Revisited
|
Main RePair compression algorithm. More...
#include <RePair.h>
Public Member Functions | |
RePair (std::vector< InputType > &data) | |
~RePair () | |
void | compress (std::vector< DataType > &out) |
Dictionary< DataType > & | getDictionary () |
Protected Member Functions | |
int | fillHashTable () |
void | fillQueue () |
void | passOne (const int firstReplacement, const DataType A, const DataType a, const DataType b) |
bool | removeIndex (const int index) |
void | createEntryIfNotExists (const int index) |
void | passTwo (int nextIndex, const DataType A) |
void | addIndex (const int index, const int countIncrement) |
void | moveWorkingEntriesBackToQueue () |
Protected Attributes | |
std::vector< PQEntry * > | pqentries |
Records< DataType > | records |
HashTable< DataType > | hashTable |
PriorityQueue | queue |
PQEntry * | workingEntries |
Dictionary< DataType > | dictionary |
Main RePair compression algorithm.
|
inline |
|
inline |
|
inlineprotected |
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
inline |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |
|
protected |