Struct AncestorState 

pub struct AncestorState<T>
where
    T: CustomTraversal,
{
    pub container_header: ContainerHeader<T>,
    pub container_start_offset: usize,
    pub current_child_index: usize,
}

Fields

container_header: ContainerHeader<T>

container_start_offset: usize

The byte offset of the start of the container in the input buffer

current_child_index: usize

Goes from 0,… container_header.child_count() - 1 as children in the container are considered. NOTE: For maps, container_header.child_count() = 2 * Map length

The current_child_index does NOT necessarily point at a valid value which can be decoded,

• the index is updated before the child is read, to record errors against it.

Trait Implementations

impl<T> Clone for AncestorState<T>

where T: Clone + CustomTraversal,

fn clone(&self) -> AncestorState<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for AncestorState<T>

where T: Debug + CustomTraversal,

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

Formats the value using the given formatter.

impl<T> PartialEq for AncestorState<T>

where T: PartialEq + CustomTraversal,

fn eq(&self, other: &AncestorState<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Copy for AncestorState<T>

where T: Copy + CustomTraversal,

impl<T> Eq for AncestorState<T>

where T: Eq + CustomTraversal,

impl<T> StructuralPartialEq for AncestorState<T>

where T: CustomTraversal,