Struct Packed 

pub struct Packed { /* private fields */ }

Decoded-but-not-unpacked samples, with everything needed to walk them.

This is the state the filter chain leaves an image in for every path that does not go through a codec of its own: raw samples at Depth, in the colour space’s own component order, still packed. The /Decode array is already folded into a byte table, so unpacking a sample is a lookup.

Implementations

impl Packed

pub fn new( data: Box<[u8]>, depth: Depth, components: usize, pitch: usize, width: u32, height: u32, space: &ColorSpace, decode: Option<&Array>, ) -> Self

Hold data as width x height samples of components at depth, with the /Decode mapping for space folded into the table.

pitch is the dictionary’s own row stride, which for a packed depth is wider than width * components * depth / 8 rounded down: a row is byte-aligned, so the tail bits of the last byte belong to no pixel.

pub const fn components(&self) -> usize

Components per pixel.

pub fn byte_size(&self) -> usize

Bytes held: the packed samples plus the decode table.

pub fn truncated(&self) -> bool

Whether any row of the declared height is missing or short.

The eager pass recorded a truncated-stream diagnostic while it walked; a lazy one has to answer the same question without walking, which the stream length does.

Trait Implementations

impl Clone for Packed

fn clone(&self) -> Packed

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Packed

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for Packed

fn eq(&self, other: &Packed) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Packed