Enum TraversalStrategy 

pub enum TraversalStrategy {
    TopDown,
    BottomUp,
    Innermost,
    Fixpoint {
        max_iterations: usize,
    },
}

Traversal ordering for rule matches.

Variants

TopDown

Parents before children.

BottomUp

Children before parents.

Innermost

Only matches that do not contain another match.

Fixpoint

Re-apply a mutable visitor until it reports no changes or reaches the cap.

Fields

max_iterations: usize

Implementations

impl TraversalStrategy

pub fn matches( self, network: &LinkNetwork, rule: &LinkRule, registry: &LinkRuleRegistry, ) -> Vec<LinkRuleMatch>

Returns rule matches ordered by this strategy.

pub fn apply_mut<F>( self, network: &mut LinkNetwork, rule: &LinkRule, registry: &LinkRuleRegistry, visitor: F, ) -> TraversalReport

where F: FnMut(&mut LinkNetwork, &LinkRuleMatch) -> bool,

Visits matches according to this strategy. Fixpoint repeats until the visitor returns no changes.

Trait Implementations

impl Clone for TraversalStrategy

fn clone(&self) -> TraversalStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TraversalStrategy

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

Formats the value using the given formatter.

impl PartialEq for TraversalStrategy

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

impl Eq for TraversalStrategy

impl StructuralPartialEq for TraversalStrategy