Struct RecordStore 

pub struct RecordStore { /* private fields */ }

Receiver-side DHT record store.

Not internally synchronised — the handler owns it behind a Mutex / RwLock, mirroring how RoutingTable is composed. The methods are &mut self because every admission path touches multiple indexes (the primary (hash → entries) map, the per-publisher quota count, and the global LRU ordering); requiring exclusive access keeps those invariants atomic without internal locking overhead.

Implementations

impl RecordStore

pub fn new(cfg: RecordStoreConfig) -> Self

Construct an empty store.

pub fn len(&self) -> usize

Total record count across all publishers.

pub fn is_empty(&self) -> bool

True iff the store has zero records.

pub const fn capacity(&self) -> usize

Global record capacity — the configured RecordStoreConfig::max_records_global ceiling. Paired with Self::len to report store utilization in the admin_v1_status health view (issue #741).

pub fn publisher_record_count(&self, holder: &NodeId) -> usize

Record count for one publisher. Returns 0 for unknown publishers.

pub fn insert_at( &mut self, holder: NodeId, hash: Hash, coverage: Coverage, receive_us: u64, ) -> InsertOutcome

Insert or refresh (holder, hash) with receive_us as the receiver-anchored wall-clock at acceptance. Returns the outcome.

The caller is responsible for the upstream admission checks (rate limit, holder == authenticated NodeId, StakerSet::is_active). This method enforces only the storage-level invariants (per-publisher quota with hard reject, global LRU with eviction, per-hash provider cap with oldest-provider eviction).

pub fn providers_at(&mut self, hash: &Hash, now_us: u64) -> Vec<Provider>

Return the current holders for hash, dropping any whose expiry_us <= now_us. The result is capped at the configured per-hash provider count (which equals the wire MAX_PROVIDERS_PER_HASH in production), so the handler can serialise the return value directly into a decdn_protocol::FindValueResponse.

now_us is the requester-side wall-clock — passed in rather than read inline so the same store can be exercised under a mock clock in tests.

pub fn gc(&mut self, now_us: u64) -> usize

Periodic GC sweep — drops every expired record across the store. Returns the number removed.

ttl_us is constant for all records, so global_lru (ordered by receive_us) is ALSO ordered by expiry_us — the oldest entries are always at the front. The sweep pops from global_lru.first() until it sees a non-expired record and returns, which is O(expired × log N) rather than the previous O(N) full scan.

Trait Implementations

impl Debug for RecordStore

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

Formats the value using the given formatter.