– The TU Dortmund Compression Framework
tdc::lz78::BinaryTrie Class Reference

#include <BinaryTrie.hpp>

Inheritance diagram for tdc::lz78::BinaryTrie:
tdc::Algorithm tdc::lz78::LZ78Trie<>

Additional Inherited Members

- Public Types inherited from tdc::lz78::LZ78Trie<>
using node_t = LZ78TrieNode
- Public Member Functions inherited from tdc::Algorithm
virtual ~Algorithm ()=default
 Algorithm (Algorithm const &)=default
 Algorithm (Algorithm &&)=default
Algorithmoperator= (Algorithm const &)=default
Algorithmoperator= (Algorithm &&)=default
 Algorithm (Env &&env)
 Instantiates an algorithm in the specified environment. More...
Envenv ()
 Provides access to the environment that the algorithm works in. More...
const Envenv () const
- Protected Member Functions inherited from tdc::lz78::LZ78Trie<>
 LZ78Trie (const size_t n, const size_t &remaining_characters)
size_t expected_number_of_remaining_elements (const size_t z) const
node_t add_rootnode (uliteral_t c)
 The dictionary can store multiple root nodes For LZ78, we use a root node with the id = c = 0. More...
node_t get_rootnode (uliteral_t c) const
 Returns the root node corresponding to literal c. More...
void clear ()
 Erases the contents of the dictionary. More...
node_t find_or_insert (const node_t &parent, uliteral_t c)
 Searches a pair (parent, c). More...
size_t size () const
 Returns the number of entries, plus the number of rootnodes. More...

Detailed Description

Definition at line 11 of file BinaryTrie.hpp.

The documentation for this class was generated from the following file: