Struct RoutingTableId

pub struct RoutingTableId<I, D>(/* private fields */)
where
    I: Ip;

Identifier to a routing table.

Implementations

impl<I, D> RoutingTableId<I, D>

where I: Ip,

pub fn downgrade(&self) -> WeakRoutingTableId<I, D>

Downgrades the strong ID into a weak one.

Trait Implementations

impl<I, D> Clone for RoutingTableId<I, D>

where I: Clone + Ip, D: Clone,

fn clone(&self) -> RoutingTableId<I, D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I, D> Debug for RoutingTableId<I, D>

where I: Ip,

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

Formats the value using the given formatter.

impl<I, D> Hash for RoutingTableId<I, D>

where I: Hash + Ip, D: Hash,

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

where __H: Hasher,

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<I, D> OrderedLockAccess<RoutingTable<I, D>> for RoutingTableId<I, D>

where I: IpLayerIpExt, D: StrongDeviceIdentifier,

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

The lock type that observes ordering.

fn ordered_lock_access( &self, ) -> OrderedLockRef<'_, <RoutingTableId<I, D> as OrderedLockAccess<RoutingTable<I, D>>>::Lock>

Returns a borrow to the order-aware lock.

impl<I, D> PartialEq for RoutingTableId<I, D>

where I: PartialEq + Ip, D: PartialEq,

fn eq(&self, other: &RoutingTableId<I, D>) -> 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<I, D> Eq for RoutingTableId<I, D>

where I: Eq + Ip, D: Eq,

impl<I, D> StructuralPartialEq for RoutingTableId<I, D>

where I: Ip,