Struct SubscriptionTrie 

pub struct SubscriptionTrie { /* private fields */ }

Efficient subscription storage using a sorted set for O(log N) operations.

Backed by a BTreeSet<Vec<u8>> which allows O(log N) prefix searching: find the largest stored prefix ≤ the topic, then check if it is a prefix of the topic. Subscribe/unsubscribe are also O(log N).

Implementations

impl SubscriptionTrie

pub fn new() -> Self

Create a new empty subscription trie

pub fn subscribe(&mut self, prefix: Bytes)

Add a subscription

pub fn unsubscribe(&mut self, prefix: &Bytes)

Remove a subscription

pub fn matches(&self, topic: &[u8]) -> bool

Check if a topic matches any subscription

Returns true if the topic should be delivered. O(log N) using BTreeSet range lookup.

pub fn subscriptions(&self) -> Vec<Subscription>

Get all subscriptions as a Vec<Subscription>.

pub fn is_empty(&self) -> bool

Check if there are no subscriptions

pub fn len(&self) -> usize

Get the number of subscriptions

pub fn clear(&mut self)

Clear all subscriptions

Trait Implementations

impl Debug for SubscriptionTrie

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

Formats the value using the given formatter.

impl Default for SubscriptionTrie

fn default() -> SubscriptionTrie

Returns the “default value” for a type.