Fills the dictionary, ready to start a new chunk This should also be called before any Find

////////////// Decompression Functions ///////////////////////////////////

This function checks that a number is of the form 1..10..0 - basically all 1 bits are more significant than all 0 bits (also allowed are all 1s and al

T is either uint32_t or byte

T is either uint32_t or byte

///////////////////////// Decompression Functions /////////////////////////////////////////////

Compress and return the input data. If output_buf is provided, it is used to store the output data temporarily (otherwise a buffer is

Compresses the data from the file-like object input to the file-like object output. The input object must support the method readinto

Decompress and return the input data. If output_buf is provided, it is used to store the output data temporarily (otherwise a buffer

Decompresses the data from the file-like object input to the file-like object output. The input object must support the method readin

NOTE: the "optimized" version is actually slower!

we can't do a single shift because if n is 0 then a shift by 32 is undefined Check if all pre-read bits are 0, essentially Peek(AvailableBits()) == 0

Peeking Functions ///// Peek at the next n bits of the stream Assumption: n <= 16 && n <= this->bits

Reading Functions ///// Read the next n bits of the stream, where n <= 16 (essentially Peek(n); Skip(n)) Assumption: n <= 16 && n <= this->bits

Fast Reading Functions ///// Equivalent to the reading functions but do not do bounds checks Read the next n bits of the stream, where n <= 16 (essent

Raw Reading Functions ///// Get the next integer from the underlying stream, not the pre-read bits. These assume that this->RemainingRawBytes() >= siz

Get the remaining number of raw bytes (disregards pre-read bits)

Skipping Functions ///// Skip the next n bits of the stream Assumption: n <= 16 && n <= this->bits

Skip the next n bits of the stream without bounds checks Assumption: n <= 16

LCP Array Construction ///// Creates the LCP (longest common prefix) array from the suffix array in O(n) time with 4n memory (~16kb). Uses the Phi alg

First we give some simple no-compression 'compression' functions