Struct ConstraintAnalysis

pub struct ConstraintAnalysis { /* private fields */ }

This analysis computes the transitive closure of the constraint relation. (Note that the resulting relation will be symmetric, but not reflexive in general.)

Implementations

impl ConstraintAnalysis

pub fn get_definition(&self, var: &VariableName) -> Option<VariableUse>

Get the variable use corresponding to the definition of the variable.

pub fn definitions(&self) -> impl Iterator<Item = &VariableUse>

pub fn get_declaration(&self, var: &VariableName) -> Option<VariableUse>

Get the variable use corresponding to the declaration of the variable.

pub fn declarations(&self) -> impl Iterator<Item = &VariableUse>

pub fn single_step_constraint( &self, source: &VariableName, ) -> HashSet<VariableName>

Returns variables constrained in a single step by source.

pub fn multi_step_constraint( &self, source: &VariableName, ) -> HashSet<VariableName>

Returns variables constrained in one or more steps by source.

pub fn constrains_any( &self, source: &VariableName, sinks: &HashSet<VariableName>, ) -> bool

Returns true if the source constrains any of the sinks.

pub fn constrained_variables(&self) -> HashSet<VariableName>

Returns the set of variables occurring in a constraint together with at least one other variable.

Trait Implementations

impl Clone for ConstraintAnalysis

fn clone(&self) -> ConstraintAnalysis

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for ConstraintAnalysis

fn default() -> ConstraintAnalysis

Returns the “default value” for a type.