Tree Compression with Top Trees Revisited
|
This class holds the text as it undergoes replacements in RePair. More...
#include <Records.h>
Public Member Functions | |
Records () | |
template<typename InputType > | |
Records (std::vector< InputType > &data) | |
template<typename InputType > | |
void | init (std::vector< InputType > &data) |
int | nextIndex (int index) const |
int | prevIndex (int index) const |
DataType | nextSymbol (const int index) const |
DataType | prevSymbol (const int index) const |
bool | occursAt (const int index, const DataType first, const DataType second) const |
int | nextNonOverlappingOccurrence (int index) const |
void | replacePair (const int index, const DataType newSymbol) |
int | remove (const int index) |
void | insertBefore (const int index, const int nextIndex) |
int | findInHash (const DataType first, const DataType second, const std::vector< int > &hash) const |
void | collapse (std::vector< DataType > &out) |
Public Attributes | |
int | symbolCount |
const DataType | skipSymbol |
std::vector< DataType > | text |
std::vector< int > | prev |
std::vector< int > | next |
This class holds the text as it undergoes replacements in RePair.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
std::vector<int> RePair::Records< DataType >::next |
std::vector<int> RePair::Records< DataType >::prev |
const DataType RePair::Records< DataType >::skipSymbol |
int RePair::Records< DataType >::symbolCount |
std::vector<DataType> RePair::Records< DataType >::text |