Struct RoundRobinByRank 

pub struct RoundRobinByRank;

Interleave providers by within-provider rank: every provider’s best frame first, then every provider’s second-best, and so on.

The only score comparisons are within one provider, where F10 says the ordering is meaningful. Across providers the order is by provider id, which is arbitrary and stable rather than a claim that one source outranks another.

With one provider the ranks are 0, 1, 2, … in score order, so this is identical to ScoreDescending — the cross-provider question does not arise, and no strategy here invents one.

Trait Implementations

impl Clone for RoundRobinByRank

fn clone(&self) -> RoundRobinByRank

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RoundRobinByRank

impl Debug for RoundRobinByRank

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

Formats the value using the given formatter.

impl Default for RoundRobinByRank

fn default() -> RoundRobinByRank

Returns the “default value” for a type.

impl Eq for RoundRobinByRank

impl PartialEq for RoundRobinByRank

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

Equality operator ==.

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

Inequality operator !=.

impl RankingStrategy for RoundRobinByRank

fn policy_name(&self) -> &str

The policy’s name, for a host that has to state which cross-provider ordering it applied. F10 requires a host to document the choice; a strategy that cannot say what it is makes that impossible, which is why this has no default implementation.

fn order(&self, frames: &[(String, ContextFrame)]) -> Vec<usize>

Order the input indices best-first. See the trait contract.

impl StructuralPartialEq for RoundRobinByRank