Struct iptrie::LCTrieMap

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

A map of Ip prefixes based on a level-compressed trie

Implementations

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

pub fn len(&self) -> NonZeroUsize

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

pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>where Q: IpPrefix<Addr = K::Addr>, K: IpPrefixCovering<Q> + PartialEq<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 info(&self)

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

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

Trait Implementations

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

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

Creates a value from an iterator.