Struct RequiredSet 

pub struct RequiredSet {
    pub by_path: BTreeSet<String>,
    pub by_intent: BTreeSet<String>,
}

2026-09-26: Both halves, kept apart so a report can say which half required a gate.

Fields

by_path: BTreeSet<String>

2026-09-26: Gates the changed paths invalidate (coverage::invalidated_by).

by_intent: BTreeSet<String>

2026-09-26: Gates the classifications imply, unioned over all of them.

Implementations

impl RequiredSet

pub fn union(&self) -> BTreeSet<String>

2026-09-26: by_path ∪ by_intent.

pub fn intent_only(&self) -> BTreeSet<String>

2026-09-26: by_intent minus by_path: what intent added.

Trait Implementations

impl Clone for RequiredSet

fn clone(&self) -> RequiredSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RequiredSet

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

Formats the value using the given formatter.

impl Default for RequiredSet

fn default() -> RequiredSet

Returns the “default value” for a type.

impl PartialEq for RequiredSet

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

impl StructuralPartialEq for RequiredSet