▼NRePair | |
CCoder | Encode RePair output |
CDictionary | |
CHashTable | RePair hash table using hashing with open addressing and linear probing |
CPQEntry | Represents a Priority Queue Element. These can be chained into a list |
CPrepair | Prepare data for RePair by consolidating the input symbols |
CPriorityQueue | RePair Priority Queue |
CRecords | This class holds the text as it undergoes replacements in RePair |
CRePair | Main RePair compression algorithm |
▼NSimpleRePair | |
CHashCombiner | Combine hash values |
CHashMap | Specialised hash map for RePair |
CPriorityQueue | Specialised bucket priority queue for RePair |
CRecord | A RePair record consisting of a hash value, a frequency, and an occurence list |
CRecordFrequencyComparator | Compare RePair records by frequency (>) |
CRecords | A list of RePair records |
CArgParser | Parse command-line arguments |
CBitWriter | Unfinished, untested, unused bit writer |
CBlockedHuffmanWriter | Unfinished writer for blocked Huffman codes |
CBPString | Convert tree to BP string & label char collection |
CCluster | Cluster type for a top tree, holding a pointer to some data |
CDagEntropy | Calculate the different entropies of a TopDag - its structure, its merge types, and its labels |
CDagNode | This is a node type for use in a DAG |
CDebugInfo | Holds debug information about a tree compression run |
CDotGraphExporter | Base class for exporting various graphs (or trees) as DOT files |
CEntropyCalculator | Calculate entropy of a sequence of symbols |
CFakeLabels | Dummy labels that always return the same value for each index |
CFileWriter | UNFINISHED Top DAG writer. Don't use |
CHuffInnerNode | An inner node in a Huffman tree |
CHuffLeaf | A leaf in a Huffman tree |
CHuffmanBlocker | Constructs a blocked Huffman coding |
CHuffmanBuilder | Generic Huffman Code Builder. Only constructs code, does not en-/decode |
CHuffmanWriter | Unfinished Huffman code writer |
CHuffNode | A node in a Huffman tree (base class) |
CIdLabels | Hashing modulo-wrapping label generator (NOT UNIFORM) |
CLabelDataEntropy | Base class for Label entropy calculation. Define specialisation for your data types |
CLabelDataEntropy< std::string > | Compute entropy of a set of label strings |
CLabels | A key-value label storage |
CLabelsT | A label interface (pure virtual) |
CNavigationRecord | Represents an entry in the DAG stack |
CNavigator | Navigate around in an in-memory Top DAG |
CNodeHasher | Hash a node for RePair combiner |
COrderedTree | Ordered tree data structure |
COrderedTreeDotGraphExporter | Export a tree as a DOT graph |
CPreorderTraversal | Traverse an in-memory Top DAG in preorder |
CProgressBar | A simple progress bar |
CRandomLabels | Uniformly random labels |
CRandomTreeGenerator | Generates ordered unlabelled trees uniformly at random |
CRePairCombiner | Transform a tree into its top tree |
CStatistics | A statistics aggregator |
CStatWriter | A completely thread-safe statistics writer |
CSubtreeEquality | DagNode equality tester, to enable its use in a map |
CSubtreeHasher | DagNode hasher to enable its use in a map |
CTimerT | A flexible timer |
CTimerT< TimeT, 1, typename TimeT::rep > | Timer specialisation for a scaling factor of 1 (non-scaling) |
CTopDag | A binary DAG that is specialised to be a top tree's minimal DAG |
CTopDagConstructor | Transform a tree into its top tree |
CTopDagDotGraphExporter | Export a Top DAG as a DOT graph |
CTopDagUnpacker | Unpack a binary DAG to its original top tree |
CTopTree | Top tree data structure |
CTopTreeDotGraphExporter | Export a Top Tree as a DOT graph |
CTopTreeUnpacker | Unpack a TopTree into its original OrderedTree |
CTreeEdge | Edge type for use with an OrderedTree |
CTreeNode | A node for an OrderedTree |
CTreeSizeEstimation | Compute size of a succinct encoding of a tree |
CXmlParser | Read an XML file into a tree, using RapidXml |
CXmlWriter | XML tree writer (empty template for overloading) |
CXmlWriter< OrderedTree< NodeType, EdgeType > > | OrderedTree XML tree writer |
CXmlWriter< TopTree< DataType > > | Top tree XML writer |