Struct PerProviderQuota 

pub struct PerProviderQuota { /* private fields */ }

Give every provider its top k before any provider gets its k + 1th: each provider’s best k frames, then each provider’s next k, and so on.

The difference from RoundRobinByRank is contiguity. A round robin deals one frame per provider per turn; a quota deals k at a time, so a provider’s block of evidence stays together in the prompt. k = 1 is a round robin.

The quota tiers, it does not truncate. A provider’s k + 1th frame is ranked lower, never dropped: dropping is the budget packer’s decision, and it records a reason for the audit. A strategy that discarded frames would leave them out of both the prompt and the record of why.

With one provider every frame sits in its own tier position in score order, so this too degenerates to ScoreDescending.

Implementations

impl PerProviderQuota

pub fn new(per_provider: usize) -> Self

A quota of per_provider frames per provider per tier. 0 is read as 1: a quota of nothing would rank every frame into one tier and mean nothing, and returning an error for a number a caller can only have meant as “one at a time” buys the caller nothing.

pub fn per_provider(&self) -> usize

The frames each provider contributes per tier.

Trait Implementations

impl Clone for PerProviderQuota

fn clone(&self) -> PerProviderQuota

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PerProviderQuota

impl Debug for PerProviderQuota

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

Formats the value using the given formatter.

impl Default for PerProviderQuota

fn default() -> Self

Three frames per provider per tier — enough that a provider’s evidence arrives as a block rather than a single frame, small enough that a second provider is reached inside any realistic budget. A host with a measured number should pass it to PerProviderQuota::new.

impl Eq for PerProviderQuota

impl PartialEq for PerProviderQuota

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

Equality operator ==.

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

Inequality operator !=.

impl RankingStrategy for PerProviderQuota

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 PerProviderQuota