Struct Presence 

pub struct Presence { /* private fields */ }

Room presence: room_key -> sessions, session_key -> rooms.

Sprint 5: Added user-level indexing and tenant counters for governance. Lock-free best-effort design: under heavy contention, limits can be temporarily exceeded by a small margin to preserve throughput.

Implementations

impl Presence

pub fn new() -> Presence

pub fn try_join( &self, tenant_id: &str, room_key: &str, user_key: &str, session_key: &str, limits: &TenantLimits, ) -> Result<(), WsPrismError>

Attempt to join a room with per-tenant/user/room limits enforced.

Concurrency note: This uses lock-free counters and map lookups for performance. The check (e.g., current < limit) and the subsequent insert are not atomic across threads, so at high contention the limit may be exceeded by a small margin (acceptable trade-off for throughput). Do not rely on this for exact “hard” ceilings; it is designed for fast best-effort enforcement in a single-node gateway.

pub fn leave( &self, tenant_id: &str, room_key: &str, user_key: &str, session_key: &str, )

pub fn sessions_in(&self, room_key: &str) -> Vec<String>

pub fn cleanup_session( &self, tenant_id: &str, user_key: &str, session_key: &str, )

Trait Implementations

impl Default for Presence

fn default() -> Presence

Returns the “default value” for a type.