Struct GraphEdgeSelection 

pub struct GraphEdgeSelection { /* private fields */ }

The edge kinds and certainties one analysis admits.

A selection admits exactly the Cartesian intersection of the kinds and the certainties it was stated with: naming a kind twice changes nothing, and either empty side admits no edge at all. There is no default, because which relations answer a question is the caller’s to state rather than this crate’s to assume.

Implementations

impl GraphEdgeSelection

pub fn new(kinds: &[GraphEdgeKind], certainties: &[GraphCertainty]) -> Self

Exactly the edges whose kind is one of kinds and whose certainty is one of certainties.

pub fn all() -> Self

Every kind at every certainty.

pub fn code_relations() -> Self

Every source relation at every certainty, and no build-unit dependency.

pub fn allows(self, edge: &GraphEdge) -> bool

Whether this selection admits one edge.

The exact predicate analysis construction applies, so a caller can ask the same question of a raw edge that the indexes were built with.

Trait Implementations

impl Clone for GraphEdgeSelection

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphEdgeSelection

impl Debug for GraphEdgeSelection

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

Formats the value using the given formatter.

impl Eq for GraphEdgeSelection

impl PartialEq for GraphEdgeSelection

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphEdgeSelection