Struct SplitStackTable 

pub struct SplitStackTable<Node> { /* private fields */ }

Routing table that segregates routes into independent IPv4 and IPv6 tables.

This is likely the kind of table you want unless you know you’ll be operating in an exclusively-single-stack environment and want to save the slight runtime overhead of discriminating on address type.

Implementations

impl<T, C> SplitStackTable<Node<T, C>>

where C: ?Sized + Storage,

pub const EMPTY: Self

The empty table.

impl<Node> SplitStackTable<Node>

where Node: StrideOps,

pub fn size4(&self) -> usize

Report the total number of IPv4 routes stored in the table.

pub fn size6(&self) -> usize

Report the total number of IPv6 routes stored in the table.

pub const fn root(&self, ipv4: bool) -> &Node

Get a reference to the root node for the given ip stack.

Trait Implementations

impl<Node: Clone> Clone for SplitStackTable<Node>

fn clone(&self) -> SplitStackTable<Node>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Node: Copy> Copy for SplitStackTable<Node>

impl<Node: Debug> Debug for SplitStackTable<Node>

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

Formats the value using the given formatter.

impl<Node: Default> Default for SplitStackTable<Node>

fn default() -> SplitStackTable<Node>

Returns the “default value” for a type.

impl<Node: Eq> Eq for SplitStackTable<Node>

impl<Node: Hash> Hash for SplitStackTable<Node>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Node: PartialEq> PartialEq for SplitStackTable<Node>

fn eq(&self, other: &SplitStackTable<Node>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Node> RoutingTable for SplitStackTable<Node>

where Node: StrideOps,

type Value = <Node as StrideBase>::T

The value stored in each route.

fn contains(&self, ip: IpAddr) -> bool

Report whether ip is covered by a route in the table.

fn insert(&mut self, prefix: IpNet, val: Node::T) -> Option<Node::T>

Insert a route into the table at prefix.

fn remove(&mut self, prefix: IpNet) -> Option<Node::T>

Remove the route from the table with the given prefix.

fn clear(&mut self)

Wipe the whole table.

fn lookup(&self, ip: IpAddr) -> Option<&Node::T>

Lookup the route that most closely covers ip.

fn lookup_all(&self, ip: IpAddr) -> LookupIter<'_, Self::Value>

Lookup all matches that cover ip.

fn lookup_prefix_exact(&self, prefix: IpNet) -> Option<&Node::T>

Lookup a route that exactly matches prefix (supernets do not match).

fn lookup_prefix(&self, prefix: IpNet) -> Option<&Node::T>

Lookup the route that most closely covers prefix.

fn lookup_prefix_lpm(&self, prefix: IpNet) -> Option<(IpNet, &Node::T)>

Lookup the route that most closely covers prefix, and return that matching prefix.

fn size(&self) -> usize

Report the number of routes stored in the table.

impl<Node> StructuralPartialEq for SplitStackTable<Node>