tudocomp
– The TU Dortmund Compression Framework
tdc::lcpcomp Namespace Reference

Contains factorization and decoding strategies for the LCPCompressor. More...

Classes

class  ArraysComp
 Creates arrays instead of an LCP-heap Each array corresponds to one LCP value We do not eagerly invoke decrease_key or erase. More...
 
class  BoostHeap
 Implements the original "Max LCP" selection strategy for LCPComp. More...
 
class  BulldozerStrategy
 Implements the "Bulldozer" selection strategy for LCPComp. More...
 
class  CompactDec
 Decodes lcpcomp compressed data as described in the paper. More...
 
class  DecodeForwardQueueListBuffer
 
class  EagerScanDec
 
class  MaxHeapStrategy
 Implements the original "Max LCP" selection strategy for LCPComp. More...
 
class  MaxLCPStrategy
 Implements the original "Max LCP" selection strategy for LCPComp. More...
 
class  MaxLCPSuffixList
 Provides constant-time access to the suffix in a suffix array with the longest correspondig lcp table entry. More...
 
class  MultimapBuffer
 
class  NaiveStrategy
 A very naive selection strategy for LCPComp. More...
 
class  PLCPPeaksStrategy
 A very naive selection strategy for LCPComp. More...
 
class  PLCPStrategy
 
class  ScanDec
 Runs a number of scans of the factors. More...
 

Functions

template<typename coder_t , typename decode_buffer_t >
void decode_text_internal (Env &&env, coder_t &decoder, std::ostream &outs)
 

Variables

constexpr len_t undef_len = std::numeric_limits<len_compact_t>::max()
 

Detailed Description

Contains factorization and decoding strategies for the LCPCompressor.

Function Documentation

◆ decode_text_internal()

template<typename coder_t , typename decode_buffer_t >
void tdc::lcpcomp::decode_text_internal ( Env &&  env,
coder_t &  decoder,
std::ostream &  outs 
)
inline

Definition at line 24 of file LCPCompressor.hpp.

Variable Documentation

◆ undef_len

constexpr len_t tdc::lcpcomp::undef_len = std::numeric_limits<len_compact_t>::max()

Definition at line 11 of file DecodeQueueListBuffer.hpp.