Struct ProviderStoreLimits 

pub struct ProviderStoreLimits {
    pub max_providers_per_key: usize,
    pub max_total_records: usize,
}

Bounds enforced by ProviderStore::put — the admission control that keeps the store from growing without bound under inbound add_provider traffic from untrusted peers.

Both caps are enforced on every put, not just at GC time: a single misbehaving peer that floods add_provider for many distinct content keys (or many distinct providers per key) is rejected once a cap is hit, rather than accepted and relying on TTL expiry to eventually free memory (SPEC §6.3, §14 “Unbounded provider store”).

Fields

max_providers_per_key: usize

Maximum distinct provider records kept per content key. When a put for a new provider would exceed this, the soonest-to-expire existing record for that key is evicted to make room (a fresher/longer-lived record is preferred over a stale one).

max_total_records: usize

Maximum total records across all content keys. When a put for a genuinely new (content_key, provider) pair would exceed this, the request is rejected outright (no eviction across keys — that would let one attacker evict another key’s legitimate holders).

Trait Implementations

impl Clone for ProviderStoreLimits

fn clone(&self) -> ProviderStoreLimits

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ProviderStoreLimits

impl Debug for ProviderStoreLimits

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

Formats the value using the given formatter.

impl Default for ProviderStoreLimits

fn default() -> Self

Conservative defaults: k (20, the Kademlia replication parameter) providers per key is already generous replication, and a global ceiling that comfortably covers a node participating in many lookups while still bounding worst-case memory from a single misbehaving peer.

impl Eq for ProviderStoreLimits

impl PartialEq for ProviderStoreLimits

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ProviderStoreLimits