|
tudocomp
– The TU Dortmund Compression Framework
|
Creates arrays instead of an LCP-heap Each array corresponds to one LCP value We do not eagerly invoke decrease_key or erase. More...
#include <ArraysComp.hpp>
Public Member Functions | |
| template<typename text_t > | |
| void | factorize (text_t &text, 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 () |
Creates arrays instead of an LCP-heap Each array corresponds to one LCP value We do not eagerly invoke decrease_key or erase.
Instead, we check for every element whether it got already deleted/its key got decreased In the latter case, we push it down to the respective array
Definition at line 22 of file ArraysComp.hpp.
|
inline |
Definition at line 36 of file ArraysComp.hpp.
|
inlinestatic |
Definition at line 24 of file ArraysComp.hpp.
|
inlinestatic |
Definition at line 29 of file ArraysComp.hpp.