Struct ReplayFinding 

pub struct ReplayFinding {
    pub step_ms: i64,
    pub analyzer: String,
    pub dedup_key: String,
    pub summary: String,
    pub severity: String,
    pub target_ref: String,
    pub address: Option<String>,
    pub recorded: String,
    pub outcome: Option<String>,
}

One would-be finding at one step.

Fields

step_ms: i64

analyzer: String

dedup_key: String

summary: String

severity: String

target_ref: String

address: Option<String>

The content address a live pass would have stored it under, when the substrate can compute one without writing.

recorded: String

How the recorded history treated a finding with this dedup key: approved (incl. applied / rolled back), rejected, never_reviewed (stored, still pending or expired), or never_proposed (the incumbent never produced it).

outcome: Option<String>

The latest Verify-gate verdict on the recorded apply of this key, when there was one: held, held_costlier, regressed, drifted.

Trait Implementations

impl Clone for ReplayFinding

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReplayFinding

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

Formats the value using the given formatter.

impl PartialEq for ReplayFinding

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for ReplayFinding

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 ReplayFinding