Struct iptrie::RTrieMap

pub struct RTrieMap<K, V>(_);

A map of Ip prefixes based on a radix binary trie

Implementations

impl<K: IpPrefix, V: Default> RTrieMap<K, V>

pub fn new() -> Self

Create a new map.

The root prefix is associated with the default value of V.

pub fn with_capacity(capacity: usize) -> Self

Create a new map with a initial capacity.

The root prefix is associated with the default value of V.

impl<K: IpPrefix, V> RTrieMap<K, V>

pub fn len(&self) -> NonZeroUsize

Returns the size of the map.

Notice that it is never null since the top prefix is always present in the map.

pub fn with_root(value: V) -> Self

pub fn with_root_and_capacity(value: V, capacity: usize) -> Self

pub fn compress(self) -> LCTrieMap<K, V>

pub fn insert(&mut self, k: K, v: V) -> Option<V>

pub fn get<Q>(&self, k: &Q) -> Option<&V>where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q>,

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q>,

pub fn remove<Q>(&mut self, k: &Q) -> Option<V>where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q>,

pub fn lookup<Q>(&self, k: &Q) -> (&K, &V)where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q>,

pub fn lookup_mut<Q>(&mut self, k: &Q) -> (&K, &mut V)where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q>,

pub fn iter(&self) -> impl Iterator<Item = (&K, &V)> + '_

pub fn drain(&mut self) -> impl Iterator<Item = (K, V)> + '_

pub fn prefixes(&self) -> RTrieSet<K>

Trait Implementations

impl<K: Clone, V: Clone> Clone for RTrieMap<K, V>

fn clone(&self) -> RTrieMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: IpPrefix, V: Default> Default for RTrieMap<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: IpPrefix, V> Extend<(K, V)> for RTrieMap<K, V>

fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K: IpPrefix, V: Default> FromIterator<(K, V)> for RTrieMap<K, V>

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Creates a value from an iterator.