Struct RoutingTable

pub struct RoutingTable<I: Ip, D> { /* private fields */ }

An IP routing table.

RoutingTable maps destination subnets to the nearest IP hosts (on the local network) able to route IP packets to those subnets.

Implementations

impl<I: BroadcastIpExt, D: Clone + Debug + PartialEq> RoutingTable<I, D>

pub fn add_entry( &mut self, entry: EntryAndGeneration<I::Addr, D>, ) -> Result<&EntryAndGeneration<I::Addr, D>, ExistsError>

where D: PartialOrd,

Adds entry to the routing table if it does not already exist.

On success, a reference to the inserted entry is returned.

pub fn iter_table(&self) -> impl Iterator<Item = &Entry<I::Addr, D>>

Get an iterator over all of the routing entries (Entry) this RoutingTable knows about.

Trait Implementations

impl<I: Debug + Ip, D: Debug> Debug for RoutingTable<I, D>

where I::Addr: Debug,

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

Formats the value using the given formatter.

impl<I: Ip, D> Default for RoutingTable<I, D>

fn default() -> RoutingTable<I, D>

Returns the “default value” for a type.

impl<I: Ip, D, IpType> GenericOverIp<IpType> for RoutingTable<I, D>

where IpType: Ip,

type Type = RoutingTable<IpType, D>

The type of Self when its IP-generic parameter is replaced with the type NewIp.

impl<I: IpLayerIpExt, D: StrongDeviceIdentifier> OrderedLockAccess<RoutingTable<I, D>> for RoutingTableId<I, D>

type Lock = RwLock<RoutingTable<I, D>>

The lock type that observes ordering.

fn ordered_lock_access(&self) -> OrderedLockRef<'_, Self::Lock>

Returns a borrow to the order-aware lock.