Struct ReExportCycleFinding 

pub struct ReExportCycleFinding {
    pub cycle: ReExportCycle,
    pub actions: Vec<IssueAction>,
    pub introduced: Option<AuditIntroduced>,
    pub effective_severity: Option<EffectiveSeverity>,
}

Wire-shape envelope for a ReExportCycle finding. Mirrors CircularDependencyFinding: flattens the bare finding and carries a typed actions array (refactor-re-export-cycle informational primary plus suppress-file secondary; cycles are file-scoped so a single file-level suppression on the alphabetically-first member breaks the cycle, and no // fallow-ignore-next-line form makes sense because the diagnostic is anchored at line 1 col 0 of each member).

Fields

cycle: ReExportCycle

The underlying dead-code entry.

actions: Vec<IssueAction>

Suggested next steps. Always emitted (possibly empty for forward-compat).

introduced: Option<AuditIntroduced>

Set by the audit pass when this finding is introduced relative to the merge-base.

effective_severity: Option<EffectiveSeverity>

Gate severity of this finding after rules and overrides[].rules resolve for its path. CI formats read it for the annotation, SARIF and CodeClimate level. Absent in output from older versions. Not part of the finding identity, baseline keys or fingerprints.

Implementations

impl ReExportCycleFinding

pub fn with_actions(cycle: ReExportCycle) -> ReExportCycleFinding

Build the wrapper from a raw ReExportCycle.

The SuppressFile action targets the alphabetically-first member (cycle.files[0]; the files Vec is already sorted at graph layer); for multi-node cycles the description names the other members so consumers see context for why one file-level suppression suffices.

Trait Implementations

impl Clone for ReExportCycleFinding

fn clone(&self) -> ReExportCycleFinding

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReExportCycleFinding

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for ReExportCycleFinding

fn deserialize<__D>( __deserializer: __D, ) -> Result<ReExportCycleFinding, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl GatedFinding for ReExportCycleFinding

fn effective_severity(&self) -> Option<EffectiveSeverity>

The gate severity, or None when no value was written.

fn set_effective_severity(&mut self, severity: Option<EffectiveSeverity>)

Write the gate severity.

impl JsonSchema for ReExportCycleFinding

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl RuleSeverity for ReExportCycleFinding

fn rule_severity(&self, source: &SeveritySource<'_>) -> Severity

The severity of this finding under source.

fn uniform_severity(source: &SeveritySource<'_>) -> Option<Severity>

The severity that every finding of this kind has under source, or None when the severity can differ from finding to finding.

impl Serialize for ReExportCycleFinding

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

where __S: Serializer,

Serialize this value into the given Serde serializer.