Struct PairTable 

pub struct PairTable { /* private fields */ }

A bounded key→value table (drop-oldest), for pending pairing state: inbound knocks (sender key → claimed name) and outbound requests (target key → the grant we’ll assign them on accept). Bounded so a knock flood can’t grow it.

Implementations

impl PairTable

pub fn new(cap: usize) -> Self

pub fn put(&mut self, key: String, value: String)

Insert or update key; evicts the oldest at capacity.

pub fn take(&mut self, key: &str) -> Option<String>

Remove and return key’s value.

pub fn get(&self, key: &str) -> Option<&String>

pub fn find(&self, key_or_fp: &str) -> Option<(String, String)>

Resolve a full key or an exact 8-char fingerprint to (key, value).

pub fn entries(&self) -> impl Iterator<Item = (&String, &String)>

pub fn is_empty(&self) -> bool