Struct RelationPass 

pub struct RelationPass {
    pub edges: Vec<RelationEdge>,
    pub settled: BTreeSet<String>,
    pub live_queries: usize,
    pub cache_hits: usize,
    pub answered: usize,
}

Result of one relation pass.

Fields

edges: Vec<RelationEdge>

Sorted, deduplicated edges found this pass.

settled: BTreeSet<String>

Declaring files whose every queried symbol got a definitive answer. Only their earlier edges may be pruned; files left unanswered (backend unavailable, budget, cold server) keep theirs.

live_queries: usize

Symbols asked live this pass, and answered from the cache.

cache_hits: usize

answered: usize

Symbols that got any answer (live or cached, complete or not). Zero means the pass learned nothing — e.g. a file declaring no symbol of the relation’s kinds is settled without a single question.

Implementations

impl RelationPass

pub fn may_prune(&self, relation: Relation, from: &str, to: &str) -> bool

Whether this pass may withdraw the earlier edge from → to: only when the declaring file was settled.

Trait Implementations

impl Clone for RelationPass

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 RelationPass

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

Formats the value using the given formatter.

impl Default for RelationPass

fn default() -> Self

Returns the “default value” for a type.

impl Eq for RelationPass

impl PartialEq for RelationPass

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for RelationPass