Struct bitstring_trees::set::RadixSet

pub struct RadixSet<S: BitString> { /* fields omitted */ }

RadixSet is a binary tree with path-shortening; leafs mark prefixes included in the set, inner nodes have no semantic value.

If a prefix is in the set, all strings prefixed by it are also considered part of the set.

If an inner node would have only a single child, the paths to and from it could be shortened - therefor all inner nodes have two children.

Implementations

impl<S: BitString + Clone> RadixSet<S>

pub fn new() -> Self

New (empty) set.

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

Add a new prefix to the set.

pub fn root(&self) -> Option<&Node<S>>

Read-only access to the tree.

An empty set doesn’t have any nodes (i.e. None).

pub fn iter(&self) -> Iter<'_, S>

Iterate over all prefixes in the set

pub fn iter_full(&self) -> IterFull<'_, S>

Iterate over all prefixes and missing prefixes in the set

Trait Implementations

impl<S: Clone + BitString> Clone for RadixSet<S>

fn clone(&self) -> RadixSet<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: BitString + Debug> Debug for RadixSet<S>

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

Formats the value using the given formatter.

impl<S: BitString> Default for RadixSet<S>

fn default() -> RadixSet<S>

Returns the “default value” for a type.