Tree Compression with Top Trees Revisited
|
#include <Coder.h>
Public Member Functions | |
Coder (std::vector< DataType > &output, Dictionary< DataType > &dict) | |
void | compute () |
template<typename InputType > | |
void | codeInputMapping (std::unordered_map< InputType, InputType > &mapping) |
long long | getBitsNeeded () const |
Public Attributes | |
long long | bitsForInputMapping |
std::vector< DataType > & | output |
Dictionary< DataType > & | dict |
HuffmanBuilder< DataType > | huff |
encode RePair output
|
inline |
|
inline |
|
inline |
|
inline |
long long RePair::Coder< DataType >::bitsForInputMapping |
Dictionary<DataType>& RePair::Coder< DataType >::dict |
HuffmanBuilder<DataType> RePair::Coder< DataType >::huff |
std::vector<DataType>& RePair::Coder< DataType >::output |