Struct FindingKey 

pub struct FindingKey {
    pub binding_hash: String,
    pub source_head: String,
}

A binding’s hash(D) plus the source_head a finding was observed at.

Only the binding_hash half keys the store: a changed hash(D) (a binding-declaration edit) invalidates prior findings by construction — segregated as superseded, never silently mixed into the current view (A3). The source_head half is observation metadata, carried on every finding so it stays self-describing about when it was observed — a moved head does NOT invalidate a finding (findings survive head movement; see the module docs).

The real key behind plan 03’s schema stub (which lived, IO-less, in crate::binding).

Fields

binding_hash: String

The binding’s hash(D) (lowercase hex SHA-256; see crate::binding::hash_binding) — the store key.

source_head: String

The composite source-head token the finding was observed at — the per-facet baseline tokens current at observation time. Metadata, not part of the store key.

Trait Implementations

impl Clone for FindingKey

fn clone(&self) -> FindingKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for FindingKey

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for FindingKey

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for FindingKey

impl Ord for FindingKey

fn cmp(&self, other: &FindingKey) -> 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 FindingKey

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for FindingKey

fn partial_cmp(&self, other: &FindingKey) -> 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 Serialize for FindingKey

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for FindingKey