tudocomp
– The TU Dortmund Compression Framework
|
Implements the original "Max LCP" selection strategy for LCPComp. More...
#include <MaxHeapStrategy.hpp>
Public Member Functions | |
template<typename text_t > | |
void | factorize (text_t &text, const size_t threshold, lzss::FactorBuffer &factors) |
Public Member Functions inherited from tdc::Algorithm | |
virtual | ~Algorithm ()=default |
Algorithm (Algorithm const &)=default | |
Algorithm (Algorithm &&)=default | |
Algorithm & | operator= (Algorithm const &)=default |
Algorithm & | operator= (Algorithm &&)=default |
Algorithm (Env &&env) | |
Instantiates an algorithm in the specified environment. More... | |
Env & | env () |
Provides access to the environment that the algorithm works in. More... | |
const Env & | env () const |
Static Public Member Functions | |
static Meta | meta () |
static ds::dsflags_t | textds_flags () |
Implements the original "Max LCP" selection strategy for LCPComp.
This strategy constructs a deque containing suffix array entries sorted by their LCP length. The entry with the maximum LCP is selected and overlapping suffices are removed from the deque.
This was the original naive approach in "Textkompression mithilfe von Enhanced Suffix Arrays" (BA thesis, Patrick Dinklage, 2015).
Definition at line 22 of file MaxHeapStrategy.hpp.
|
inline |
Definition at line 36 of file MaxHeapStrategy.hpp.
|
inlinestatic |
Definition at line 24 of file MaxHeapStrategy.hpp.
|
inlinestatic |
Definition at line 29 of file MaxHeapStrategy.hpp.