Struct ChunkDecompressor 

pub struct ChunkDecompressor<'src, T> { /* private fields */ }

The decompressor is implemented as a Q buffer Q because it is a circular buffer + a linear buffer, which if you draw them, looks like a Q

Data is always decompressed in the circular buffer, but since the whole circular buffer might be needed when extracting new data, we temporarily store remaining data in the linear buffer.

The linear part would not be needed if we could control the maximum data that must be decompressed

Implementations

impl<'src, 'buf> ChunkDecompressor<'src, &'buf mut [u8]>

pub fn new_ref( data_chunks: &'src [u8], buffer: &'buf mut [u8], buffer_extra: &'buf mut [u8], check_crc: bool, ) -> Self

impl<'src> ChunkDecompressor<'src, Vec<u8>>

pub fn new_vec(data_chunks: &'src [u8], check_crc: bool) -> Self

pub fn update_buffers(&mut self)

impl<'src> ChunkDecompressor<'src, [u8; 32768]>

pub fn new_static(data_chunks: &'src [u8], check_crc: bool) -> Self

impl<'src, T> ChunkDecompressor<'src, T>

where T: AsRef<[u8]> + AsMut<[u8]>,

pub fn decode_next_scanline( &mut self, last_scanline: &mut [u8], bytes_per_pixel: usize, ) -> Result<(), DecodeError>

pub fn reset(&mut self)