Enum rkyv_test::collections::btree_map::validation::ArchivedBTreeMapError

pub enum ArchivedBTreeMapError<K, V, C> {
    KeyCheckError(K),
    ValueCheckError(V),
    TooFewInnerNodeEntries(usize),
    TooFewLeafNodeEntries(usize),
    CheckInnerNodeEntryError {
        index: usize,
        inner: K,
    },
    CheckLeafNodeEntryError {
        index: usize,
        inner: LeafNodeEntryError<K, V>,
    },
    InvalidNodeSize(usize),
    MismatchedInnerChildKey,
    InnerNodeInLeafLevel,
    InvalidLeafNodeDepth {
        expected: usize,
        actual: usize,
    },
    UnsortedLeafNodeEntries,
    UnlinkedLeafNode,
    UnsortedLeafNode,
    LastLeafForwardPointerNotNull,
    LengthMismatch {
        expected: usize,
        actual: usize,
    },
    IncorrectChildKey,
    ContextError(C),
}

Errors that can occur while checking an archived B-tree.

Variants

KeyCheckError(K)

An error occurred while checking the bytes of a key

ValueCheckError(V)

An error occurred while checking the bytes of a value

TooFewInnerNodeEntries(usize)

The number of entries in the inner node is less than the minimum number of entries required

TooFewLeafNodeEntries(usize)

The number of entries in the leaf node is less than the minimum number of entries

CheckInnerNodeEntryError

Fields

index: usize

The index of the inner node entry

inner: K

The inner error that occurred

An error occurred while checking the entries of an inner node

CheckLeafNodeEntryError

Fields

index: usize

The index of the leaf node entry

inner: LeafNodeEntryError<K, V>

The inner error that occurred

An error occurred while checking the entries of a leaf node

InvalidNodeSize(usize)

The size of an inner node was invalid

MismatchedInnerChildKey

The child of an inner node had a first key that did not match the inner node’s key

InnerNodeInLeafLevel

The leaf level of the B-tree contained an inner node

InvalidLeafNodeDepth

Fields

expected: usize

The depth of the first leaf node in the tree

actual: usize

The depth of the invalid leaf node

The leaves of the B-tree were not all located at the same depth

UnsortedLeafNodeEntries

A leaf node did not contain entries in sorted order

UnlinkedLeafNode

A leaf node is not linked after a node despite being the next leaf node

UnsortedLeafNode

A leaf node with lesser keys is linked after a leaf node with greater keys

LastLeafForwardPointerNotNull

The forward pointer of the last leaf did not have an offset of 0

LengthMismatch

Fields

expected: usize

The number of entries the B-tree claims to have

actual: usize

The actual number of entries in the B-tree

The number of entries the B-tree claims to have does not match the actual number of entries

IncorrectChildKey

The keys for an inner node were incorrect

ContextError(C)

An context error occurred

Trait Implementations

impl<K: Debug, V: Debug, C: Debug> Debug for ArchivedBTreeMapError<K, V, C>

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

Formats the value using the given formatter.

impl<K, V, C> Display for ArchivedBTreeMapError<K, V, C>where
    K: Display,
    V: Display,
    C: Display,

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

Formats the value using the given formatter.

impl<K, V, C> Error for ArchivedBTreeMapError<K, V, C>where
    K: Error + 'static,
    V: Error + 'static,
    C: Error + 'static,

fn source(&self) -> Option<&(dyn Error + 'static)>

The lower-level source of this error, if any.

fn description(&self) -> &str

👎Deprecated since 1.42.0:

use the Display impl or to_string()

fn cause(&self) -> Option<&dyn Error>

👎Deprecated since 1.33.0:

replaced by Error::source, which can support downcasting

fn provide(&'a self, demand: &mut Demand<'a>)

🔬This is a nightly-only experimental API. (error_generic_member_access)

Provides type based access to context intended for error reports.

impl<K, V, C> From<Infallible> for ArchivedBTreeMapError<K, V, C>

fn from(_: Infallible) -> Self

Converts to this type from the input type.