Struct PathStrategy 

pub struct PathStrategy {
    pub policies: Vec<Arc<dyn PathPolicy>>,
    pub ranking: Vec<Arc<dyn PathRanking>>,
}

PathStrategy combines multiple path operations into a single strategy.

Fields

policies: Vec<Arc<dyn PathPolicy>>

The path policies to apply.

ranking: Vec<Arc<dyn PathRanking>>

The path ranking functions to apply.

Implementations

impl PathStrategy

pub fn add_policy(&mut self, policy: impl PathPolicy)

Appends a path policy to the list of policies.

pub fn add_ranking(&mut self, ranking: impl PathRanking)

Appends a path ranking function to the list of ranking functions.

pub fn predicate(&self, path: &PathManagerPath) -> bool

Returns true if the given path is accepted by all policies.

If no policies are added, all paths are accepted.

pub fn rank_order( &self, this: &PathManagerPath, other: &PathManagerPath, ) -> Ordering

Ranks the order of two paths based on preference.

Return

Returns the preference ordering between two paths.

• Ordering::Less if this is preferred over other
• Ordering::Greater if other is preferred over this
• Ordering::Equal if both paths are equally preferred

pub fn filter_inplace<'path: 'iter, 'iter>( &self, paths: &mut Vec<PathManagerPath>, )

Filters the given paths based on all policies, removing paths that are not accepted.

pub fn rank_inplace<'path: 'iter, 'iter>(&self, path: &mut [PathManagerPath])

Sorts the given paths in place, placing the most preferred paths first.

Uses the ranking functions in the order they were added.

If no ranking functions are added, the paths are not modified.

Trait Implementations

impl Default for PathStrategy

fn default() -> PathStrategy

Returns the “default value” for a type.