Struct Set

pub struct Set<K: BitString + Clone> { /* private fields */ }

Set of bit string prefixes

Sibling prefixes are automatically merged.

This is implemented as a crate::tree::Tree where nodes don’t carry values at all, buf leaf nodes represent set membership of the associated key.

Implementations

impl<K: BitString + Clone> Set<K>

pub const fn new() -> Self

New (empty) set.

pub fn tree(&self) -> &Tree<TpSet<K>>

Access raw tree of set

pub fn insert(&mut self, key: K)

Insert prefix into set

pub fn remove(&mut self, key: K)

Remove everything covered by prefix from set

pub fn contains(&self, key: &K) -> bool

Whether prefix is (completely) contained in set

pub fn iter(&self) -> IterSet<'_, K>

Iterate over all contained prefixes

pub fn iter_full(&self) -> IterSetFull<'_, K>

Iterate over smallest list of bit strings that cover everything with information whether they are part of the set or not

Trait Implementations

impl<K: Clone + BitString + Clone> Clone for Set<K>

fn clone(&self) -> Set<K>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K: BitString + Clone + Debug> Debug for Set<K>

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

Formats the value using the given formatter.

impl<K: BitString + Clone> Default for Set<K>

fn default() -> Self

Returns the “default value” for a type.