Struct RoutingTableSharding 

pub struct RoutingTableSharding {
    pub config: ShardConfig,
    pub shards: Vec<HashMap<NodeId, RoutingEntry>>,
    pub total_insertions: u64,
    pub total_evictions: u64,
    pub total_lookups: Cell<u64>,
    /* private fields */
}

Sharded DHT routing table.

Peers are placed into shards by node_id.0[0] % num_shards, giving an approximately uniform distribution for random node IDs while preserving the XOR-metric locality needed for closest-peer queries.

Fields

config: ShardConfig

Shard configuration (immutable after construction).

shards: Vec<HashMap<NodeId, RoutingEntry>>

One HashMap per shard.

total_insertions: u64

Monotonically increasing count of successful insert calls.

total_evictions: u64

Monotonically increasing count of evictions caused by capacity enforcement.

total_lookups: Cell<u64>

Monotonically increasing count of get / closest_nodes calls.

Uses Cell for interior-mutability so that read-only methods (get, closest_nodes) can increment the counter without requiring &mut self.

Implementations

impl RoutingTableSharding

pub fn new(config: ShardConfig) -> Self

Construct a new routing table with config.num_shards empty shards.

pub fn shard_for(&self, node_id: &NodeId) -> ShardId

Compute which shard a NodeId belongs to.

pub fn insert(&mut self, entry: RoutingEntry, _now: u64) -> bool

Insert entry into the appropriate shard.

If the shard is already at capacity after the insertion, one entry is evicted according to config.eviction_policy.

Returns true if an eviction occurred, false otherwise.

pub fn remove(&mut self, node_id: &NodeId) -> bool

Remove the entry for node_id. Returns true if an entry existed.

pub fn get(&self, node_id: &NodeId) -> Option<&RoutingEntry>

Look up a single entry by NodeId.

pub fn update_rtt(&mut self, node_id: &NodeId, rtt_ms: u32, now: u64) -> bool

Update the RTT and last_seen timestamp for an existing entry.

Returns true if the entry was found and updated.

pub fn closest_nodes(&self, target: &NodeId, k: usize) -> Vec<&RoutingEntry>

Return the k entries whose XOR distance to target is smallest, sorted ascending by distance (closest first).

Scans all shards; O(N log k) where N is the total number of entries.

pub fn nodes_in_shard(&self, shard: ShardId) -> Vec<&RoutingEntry>

Return all entries in the specified shard.

pub fn evict_stale(&mut self, now: u64, max_age_ms: u64) -> usize

Remove all entries where now.saturating_sub(last_seen) > max_age_ms.

Returns the number of entries removed.

pub fn shard_stats(&self, shard: ShardId, now: u64) -> ShardStats

Statistics for a single shard at time now.

pub fn all_stats(&self, now: u64) -> Vec<ShardStats>

Statistics for all shards, sorted ascending by shard_id.

pub fn total_entries(&self) -> usize

Total number of entries across all shards.

pub fn global_stats(&self) -> (u64, u64, u64)

Global counters: (total_insertions, total_evictions, total_lookups).