Struct IdentityRejectionKey 

struct IdentityRejectionKey {
    path: RepositoryNodePath,
    span: IdentitySpan,
    parser: u8,
    field: GraphIdentityField,
    reason: GraphIdentityRejectionReason,
    fact_index: u64,
}

Exact membership key for one retained typed identity rejection detail.

The ordered key is kept beside the deterministic detail vector so replay checks do not scan every previously retained row.

Fields

path: RepositoryNodePath

Repository-relative source path containing the rejected fact.

span: IdentitySpan

Exact bounded source span of the rejected fact.

parser: u8

Parser strategy that produced the rejected fact.

field: GraphIdentityField

Identity field that failed admission.

reason: GraphIdentityRejectionReason

Stable rejection category.

fact_index: u64

Internal parser-fact ordinal.

Trait Implementations

impl Clone for IdentityRejectionKey

fn clone(&self) -> IdentityRejectionKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for IdentityRejectionKey

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

Formats the value using the given formatter.

impl Eq for IdentityRejectionKey

impl From<&GraphIdentityRejection> for IdentityRejectionKey

fn from(rejection: &GraphIdentityRejection) -> Self

Converts to this type from the input type.

impl Ord for IdentityRejectionKey

fn cmp(&self, other: &IdentityRejectionKey) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for IdentityRejectionKey

fn eq(&self, other: &IdentityRejectionKey) -> 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 PartialOrd for IdentityRejectionKey

fn partial_cmp(&self, other: &IdentityRejectionKey) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for IdentityRejectionKey