Struct SimpleTable 

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

Simple routing table that doesn’t segregate IPv4 and IPv6 routes.

The prefix 8.0.0.0/8 is treated equivalently to 0800::/8 by this table. You most likely want SplitStackTable if you’re operating in a dual-IP-stack environment.

Implementations

impl<Node> SimpleTable<Node>

pub const fn root(&self) -> &Node

Get a handle to the root node.

impl<T, C> SimpleTable<Node<T, C>>

where C: ?Sized + Storage,

pub const EMPTY: Self

The empty table.

Trait Implementations

impl<Node: Clone> Clone for SimpleTable<Node>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Node: Copy> Copy for SimpleTable<Node>

impl<Node: Debug> Debug for SimpleTable<Node>

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

Formats the value using the given formatter.

impl<Node: Default> Default for SimpleTable<Node>

fn default() -> SimpleTable<Node>

Returns the “default value” for a type.

impl<Node: Eq> Eq for SimpleTable<Node>

impl<Node: Hash> Hash for SimpleTable<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 SimpleTable<Node>

fn eq(&self, other: &SimpleTable<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 SimpleTable<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 SimpleTable<Node>