Struct PlanLimits 

pub struct PlanLimits {
    pub key_cache_per_crate: usize,
    pub key_cache_total: usize,
    pub history_per_crate: usize,
}

How many candidates each source may contribute to one plan (kunobi-ninja/kache#616).

These bound plan COMPOSITION, which is a different job from the daemon’s key/byte/time budgets: those bound resource use and are the trust boundary, these stop one low-confidence source from crowding out better candidates before the budget is even reached. 0 disables a cap.

Fields

key_cache_per_crate: usize

Key-cache variants per crate. A crate name is not a build identity, so of n variants at most one can be the right one; taking many is paying n downloads for at most one hit.

key_cache_total: usize

Key-cache candidates across the whole plan, so a build with hundreds of unresolved crates cannot fill the plan with guesses.

history_per_crate: usize

History entries per crate. Unlike shards, where one crate legitimately has several compile units, extra history rows for one crate are older variants.

Trait Implementations

impl Clone for PlanLimits

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PlanLimits

impl Debug for PlanLimits

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

Formats the value using the given formatter.

impl Default for PlanLimits

fn default() -> Self

Returns the “default value” for a type.

impl Eq for PlanLimits

impl PartialEq for PlanLimits

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PlanLimits